./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-86.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6148f57821a61bb66da81c5e9fb13250aa14d609ed7f31d3b9237ae5f0b8d661 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:37:40,100 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:37:40,159 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:37:40,165 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:37:40,167 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:37:40,185 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:37:40,186 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:37:40,186 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:37:40,187 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:37:40,187 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:37:40,187 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:37:40,187 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:37:40,188 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:37:40,188 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:37:40,188 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:37:40,188 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:37:40,188 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:37:40,188 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:37:40,188 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:37:40,189 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:37:40,189 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:37:40,189 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:37:40,189 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:37:40,189 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:37:40,189 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:37:40,189 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:37:40,189 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:37:40,189 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:37:40,189 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:37:40,189 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:37:40,190 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:37:40,190 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:37:40,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:37:40,190 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:37:40,190 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:37:40,190 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:37:40,190 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:37:40,191 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:37:40,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:37:40,191 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:37:40,191 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:37:40,191 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:37:40,191 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:37:40,191 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6148f57821a61bb66da81c5e9fb13250aa14d609ed7f31d3b9237ae5f0b8d661 [2025-03-16 23:37:40,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:37:40,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:37:40,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:37:40,446 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:37:40,447 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:37:40,448 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-86.i [2025-03-16 23:37:41,621 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81afffa0b/96323a0d761a40b8b4aa24d08f0cbb89/FLAGb108f92e7 [2025-03-16 23:37:41,820 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:37:41,821 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-86.i [2025-03-16 23:37:41,826 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81afffa0b/96323a0d761a40b8b4aa24d08f0cbb89/FLAGb108f92e7 [2025-03-16 23:37:41,836 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81afffa0b/96323a0d761a40b8b4aa24d08f0cbb89 [2025-03-16 23:37:41,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:37:41,839 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:37:41,840 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:37:41,840 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:37:41,843 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:37:41,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:37:41" (1/1) ... [2025-03-16 23:37:41,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12aae2ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:37:41, skipping insertion in model container [2025-03-16 23:37:41,844 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:37:41" (1/1) ... [2025-03-16 23:37:41,855 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:37:41,952 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-86.i[913,926] [2025-03-16 23:37:42,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:37:42,014 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:37:42,023 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-86.i[913,926] [2025-03-16 23:37:42,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:37:42,066 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:37:42,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:37:42 WrapperNode [2025-03-16 23:37:42,068 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:37:42,069 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:37:42,069 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:37:42,069 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:37:42,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:37:42" (1/1) ... [2025-03-16 23:37:42,080 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:37:42" (1/1) ... [2025-03-16 23:37:42,111 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2025-03-16 23:37:42,115 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:37:42,115 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:37:42,117 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:37:42,117 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:37:42,122 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:37:42" (1/1) ... [2025-03-16 23:37:42,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:37:42" (1/1) ... [2025-03-16 23:37:42,125 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:37:42" (1/1) ... [2025-03-16 23:37:42,140 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 23:37:42,141 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:37:42" (1/1) ... [2025-03-16 23:37:42,141 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:37:42" (1/1) ... [2025-03-16 23:37:42,150 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:37:42" (1/1) ... [2025-03-16 23:37:42,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:37:42" (1/1) ... [2025-03-16 23:37:42,153 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:37:42" (1/1) ... [2025-03-16 23:37:42,153 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:37:42" (1/1) ... [2025-03-16 23:37:42,155 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:37:42,158 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:37:42,159 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:37:42,159 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:37:42,160 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:37:42" (1/1) ... [2025-03-16 23:37:42,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:37:42,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:37:42,188 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-16 23:37:42,189 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-16 23:37:42,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:37:42,204 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:37:42,205 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:37:42,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:37:42,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:37:42,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:37:42,263 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:37:42,264 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:37:42,548 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-16 23:37:42,548 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:37:42,555 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:37:42,556 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:37:42,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:37:42 BoogieIcfgContainer [2025-03-16 23:37:42,557 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:37:42,559 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:37:42,559 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:37:42,562 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:37:42,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:37:41" (1/3) ... [2025-03-16 23:37:42,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d0a71f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:37:42, skipping insertion in model container [2025-03-16 23:37:42,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:37:42" (2/3) ... [2025-03-16 23:37:42,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d0a71f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:37:42, skipping insertion in model container [2025-03-16 23:37:42,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:37:42" (3/3) ... [2025-03-16 23:37:42,564 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-86.i [2025-03-16 23:37:42,573 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:37:42,574 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-86.i that has 2 procedures, 49 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:37:42,619 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:37:42,628 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=LoopHeads, 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;@272e7ed9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:37:42,628 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:37:42,631 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-16 23:37:42,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 23:37:42,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:37:42,640 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:37:42,640 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:37:42,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:37:42,644 INFO L85 PathProgramCache]: Analyzing trace with hash 51516376, now seen corresponding path program 1 times [2025-03-16 23:37:42,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:37:42,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542445110] [2025-03-16 23:37:42,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:37:42,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:37:42,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 23:37:42,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 23:37:42,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:37:42,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:37:42,872 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-16 23:37:42,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:37:42,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542445110] [2025-03-16 23:37:42,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542445110] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:37:42,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695069015] [2025-03-16 23:37:42,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:37:42,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:37:42,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:37:42,879 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-16 23:37:42,880 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-16 23:37:42,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 23:37:43,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 23:37:43,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:37:43,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:37:43,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:37:43,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:37:43,030 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-16 23:37:43,031 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:37:43,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695069015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:37:43,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:37:43,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:37:43,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711486291] [2025-03-16 23:37:43,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:37:43,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:37:43,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:37:43,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:37:43,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:37:43,058 INFO L87 Difference]: Start difference. First operand has 49 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-16 23:37:43,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:37:43,072 INFO L93 Difference]: Finished difference Result 95 states and 163 transitions. [2025-03-16 23:37:43,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:37:43,073 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 97 [2025-03-16 23:37:43,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:37:43,077 INFO L225 Difference]: With dead ends: 95 [2025-03-16 23:37:43,077 INFO L226 Difference]: Without dead ends: 47 [2025-03-16 23:37:43,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:37:43,080 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:37:43,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:37:43,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-16 23:37:43,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-16 23:37:43,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-16 23:37:43,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 71 transitions. [2025-03-16 23:37:43,109 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 71 transitions. Word has length 97 [2025-03-16 23:37:43,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:37:43,109 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 71 transitions. [2025-03-16 23:37:43,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-16 23:37:43,110 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 71 transitions. [2025-03-16 23:37:43,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 23:37:43,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:37:43,112 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:37:43,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 23:37:43,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-16 23:37:43,313 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:37:43,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:37:43,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1626130391, now seen corresponding path program 1 times [2025-03-16 23:37:43,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:37:43,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949458797] [2025-03-16 23:37:43,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:37:43,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:37:43,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 23:37:43,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 23:37:43,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:37:43,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:37:43,636 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-16 23:37:43,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:37:43,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949458797] [2025-03-16 23:37:43,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949458797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:37:43,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:37:43,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 23:37:43,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396012816] [2025-03-16 23:37:43,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:37:43,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 23:37:43,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:37:43,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 23:37:43,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:37:43,639 INFO L87 Difference]: Start difference. First operand 47 states and 71 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 23:37:43,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:37:43,787 INFO L93 Difference]: Finished difference Result 140 states and 212 transitions. [2025-03-16 23:37:43,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 23:37:43,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2025-03-16 23:37:43,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:37:43,790 INFO L225 Difference]: With dead ends: 140 [2025-03-16 23:37:43,790 INFO L226 Difference]: Without dead ends: 94 [2025-03-16 23:37:43,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 23:37:43,791 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 63 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:37:43,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 228 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 23:37:43,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-16 23:37:43,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2025-03-16 23:37:43,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-16 23:37:43,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 113 transitions. [2025-03-16 23:37:43,813 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 113 transitions. Word has length 97 [2025-03-16 23:37:43,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:37:43,813 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 113 transitions. [2025-03-16 23:37:43,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 23:37:43,813 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 113 transitions. [2025-03-16 23:37:43,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 23:37:43,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:37:43,816 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:37:43,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 23:37:43,817 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:37:43,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:37:43,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1332727384, now seen corresponding path program 1 times [2025-03-16 23:37:43,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:37:43,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171761447] [2025-03-16 23:37:43,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:37:43,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:37:43,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 23:37:43,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 23:37:43,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:37:43,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:37:51,831 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-16 23:37:51,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:37:51,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171761447] [2025-03-16 23:37:51,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171761447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:37:51,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:37:51,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-16 23:37:51,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541414792] [2025-03-16 23:37:51,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:37:51,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 23:37:51,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:37:51,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 23:37:51,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-16 23:37:51,833 INFO L87 Difference]: Start difference. First operand 75 states and 113 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 23:37:55,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:37:55,854 INFO L93 Difference]: Finished difference Result 183 states and 269 transitions. [2025-03-16 23:37:55,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 23:37:55,855 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2025-03-16 23:37:55,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:37:55,857 INFO L225 Difference]: With dead ends: 183 [2025-03-16 23:37:55,857 INFO L226 Difference]: Without dead ends: 137 [2025-03-16 23:37:55,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=204, Invalid=552, Unknown=0, NotChecked=0, Total=756 [2025-03-16 23:37:55,859 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 205 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 23:37:55,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 391 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 23:37:55,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-16 23:37:55,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 90. [2025-03-16 23:37:55,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-16 23:37:55,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 134 transitions. [2025-03-16 23:37:55,880 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 134 transitions. Word has length 97 [2025-03-16 23:37:55,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:37:55,881 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 134 transitions. [2025-03-16 23:37:55,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 23:37:55,881 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 134 transitions. [2025-03-16 23:37:55,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 23:37:55,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:37:55,882 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:37:55,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 23:37:55,882 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:37:55,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:37:55,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1136213879, now seen corresponding path program 1 times [2025-03-16 23:37:55,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:37:55,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098857348] [2025-03-16 23:37:55,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:37:55,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:37:55,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 23:37:55,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 23:37:55,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:37:55,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:37:55,928 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-16 23:37:55,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:37:55,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098857348] [2025-03-16 23:37:55,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098857348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:37:55,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:37:55,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:37:55,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262113840] [2025-03-16 23:37:55,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:37:55,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:37:55,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:37:55,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:37:55,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:37:55,932 INFO L87 Difference]: Start difference. First operand 90 states and 134 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 23:37:55,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:37:55,964 INFO L93 Difference]: Finished difference Result 181 states and 272 transitions. [2025-03-16 23:37:55,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:37:55,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2025-03-16 23:37:55,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:37:55,966 INFO L225 Difference]: With dead ends: 181 [2025-03-16 23:37:55,967 INFO L226 Difference]: Without dead ends: 135 [2025-03-16 23:37:55,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-16 23:37:55,969 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 63 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:37:55,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 142 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:37:55,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-16 23:37:55,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2025-03-16 23:37:55,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 84 states have internal predecessors, (108), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-16 23:37:55,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 198 transitions. [2025-03-16 23:37:55,988 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 198 transitions. Word has length 97 [2025-03-16 23:37:55,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:37:55,989 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 198 transitions. [2025-03-16 23:37:55,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 23:37:55,989 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 198 transitions. [2025-03-16 23:37:55,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 23:37:55,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:37:55,993 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:37:55,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 23:37:55,993 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:37:55,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:37:55,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1632291955, now seen corresponding path program 1 times [2025-03-16 23:37:55,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:37:55,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401694507] [2025-03-16 23:37:55,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:37:55,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:37:55,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 23:37:56,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 23:37:56,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:37:56,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:37:59,943 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-16 23:37:59,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:37:59,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401694507] [2025-03-16 23:37:59,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401694507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:37:59,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:37:59,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-16 23:37:59,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025021208] [2025-03-16 23:37:59,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:37:59,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 23:37:59,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:37:59,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 23:37:59,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-16 23:37:59,946 INFO L87 Difference]: Start difference. First operand 133 states and 198 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 23:38:02,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:38:02,035 INFO L93 Difference]: Finished difference Result 267 states and 387 transitions. [2025-03-16 23:38:02,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 23:38:02,036 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2025-03-16 23:38:02,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:38:02,037 INFO L225 Difference]: With dead ends: 267 [2025-03-16 23:38:02,037 INFO L226 Difference]: Without dead ends: 178 [2025-03-16 23:38:02,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2025-03-16 23:38:02,038 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 205 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:38:02,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 389 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 23:38:02,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-16 23:38:02,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 135. [2025-03-16 23:38:02,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 86 states have internal predecessors, (110), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-16 23:38:02,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 200 transitions. [2025-03-16 23:38:02,053 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 200 transitions. Word has length 98 [2025-03-16 23:38:02,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:38:02,053 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 200 transitions. [2025-03-16 23:38:02,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 23:38:02,054 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 200 transitions. [2025-03-16 23:38:02,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 23:38:02,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:38:02,054 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:38:02,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 23:38:02,055 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:38:02,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:38:02,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1088371120, now seen corresponding path program 1 times [2025-03-16 23:38:02,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:38:02,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116975468] [2025-03-16 23:38:02,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:38:02,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:38:02,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 23:38:02,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 23:38:02,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:38:02,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:38:02,130 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-16 23:38:02,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:38:02,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116975468] [2025-03-16 23:38:02,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116975468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:38:02,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:38:02,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:38:02,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972674264] [2025-03-16 23:38:02,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:38:02,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:38:02,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:38:02,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:38:02,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:38:02,133 INFO L87 Difference]: Start difference. First operand 135 states and 200 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 23:38:02,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:38:02,151 INFO L93 Difference]: Finished difference Result 235 states and 349 transitions. [2025-03-16 23:38:02,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:38:02,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2025-03-16 23:38:02,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:38:02,154 INFO L225 Difference]: With dead ends: 235 [2025-03-16 23:38:02,155 INFO L226 Difference]: Without dead ends: 143 [2025-03-16 23:38:02,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-16 23:38:02,156 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:38:02,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 130 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:38:02,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-16 23:38:02,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2025-03-16 23:38:02,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 86 states have (on average 1.244186046511628) internal successors, (107), 86 states have internal predecessors, (107), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-16 23:38:02,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 197 transitions. [2025-03-16 23:38:02,173 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 197 transitions. Word has length 98 [2025-03-16 23:38:02,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:38:02,174 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 197 transitions. [2025-03-16 23:38:02,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 23:38:02,174 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 197 transitions. [2025-03-16 23:38:02,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 23:38:02,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:38:02,175 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:38:02,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 23:38:02,176 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:38:02,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:38:02,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1117000271, now seen corresponding path program 1 times [2025-03-16 23:38:02,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:38:02,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520454570] [2025-03-16 23:38:02,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:38:02,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:38:02,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 23:38:02,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 23:38:02,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:38:02,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:38:06,518 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-16 23:38:06,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:38:06,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520454570] [2025-03-16 23:38:06,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520454570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:38:06,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:38:06,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-16 23:38:06,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520494540] [2025-03-16 23:38:06,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:38:06,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 23:38:06,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:38:06,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 23:38:06,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-03-16 23:38:06,520 INFO L87 Difference]: Start difference. First operand 135 states and 197 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-16 23:38:09,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:38:09,369 INFO L93 Difference]: Finished difference Result 180 states and 248 transitions. [2025-03-16 23:38:09,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 23:38:09,370 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 98 [2025-03-16 23:38:09,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:38:09,371 INFO L225 Difference]: With dead ends: 180 [2025-03-16 23:38:09,371 INFO L226 Difference]: Without dead ends: 178 [2025-03-16 23:38:09,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2025-03-16 23:38:09,372 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 243 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:38:09,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 332 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 23:38:09,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-16 23:38:09,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 135. [2025-03-16 23:38:09,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 86 states have (on average 1.244186046511628) internal successors, (107), 86 states have internal predecessors, (107), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-16 23:38:09,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 197 transitions. [2025-03-16 23:38:09,388 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 197 transitions. Word has length 98 [2025-03-16 23:38:09,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:38:09,388 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 197 transitions. [2025-03-16 23:38:09,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-16 23:38:09,388 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 197 transitions. [2025-03-16 23:38:09,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 23:38:09,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:38:09,390 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:38:09,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 23:38:09,390 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:38:09,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:38:09,390 INFO L85 PathProgramCache]: Analyzing trace with hash -594408207, now seen corresponding path program 1 times [2025-03-16 23:38:09,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:38:09,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664537534] [2025-03-16 23:38:09,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:38:09,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:38:09,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 23:38:09,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 23:38:09,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:38:09,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:38:12,747 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-16 23:38:12,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:38:12,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664537534] [2025-03-16 23:38:12,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664537534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:38:12,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:38:12,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-16 23:38:12,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515585098] [2025-03-16 23:38:12,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:38:12,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-16 23:38:12,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:38:12,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-16 23:38:12,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-03-16 23:38:12,749 INFO L87 Difference]: Start difference. First operand 135 states and 197 transitions. Second operand has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-16 23:38:14,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:38:14,096 INFO L93 Difference]: Finished difference Result 199 states and 270 transitions. [2025-03-16 23:38:14,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-16 23:38:14,097 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 98 [2025-03-16 23:38:14,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:38:14,099 INFO L225 Difference]: With dead ends: 199 [2025-03-16 23:38:14,099 INFO L226 Difference]: Without dead ends: 197 [2025-03-16 23:38:14,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=283, Invalid=709, Unknown=0, NotChecked=0, Total=992 [2025-03-16 23:38:14,100 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 247 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 23:38:14,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 398 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 23:38:14,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-16 23:38:14,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 144. [2025-03-16 23:38:14,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 95 states have internal predecessors, (119), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-16 23:38:14,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 209 transitions. [2025-03-16 23:38:14,115 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 209 transitions. Word has length 98 [2025-03-16 23:38:14,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:38:14,115 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 209 transitions. [2025-03-16 23:38:14,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-16 23:38:14,115 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 209 transitions. [2025-03-16 23:38:14,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 23:38:14,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:38:14,116 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:38:14,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 23:38:14,117 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:38:14,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:38:14,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1148402128, now seen corresponding path program 1 times [2025-03-16 23:38:14,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:38:14,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392568760] [2025-03-16 23:38:14,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:38:14,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:38:14,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 23:38:14,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 23:38:14,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:38:14,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:38:20,592 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-16 23:38:20,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:38:20,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392568760] [2025-03-16 23:38:20,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392568760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:38:20,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:38:20,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-16 23:38:20,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498875263] [2025-03-16 23:38:20,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:38:20,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 23:38:20,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:38:20,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 23:38:20,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-16 23:38:20,594 INFO L87 Difference]: Start difference. First operand 144 states and 209 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 23:38:25,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:38:25,633 INFO L93 Difference]: Finished difference Result 193 states and 264 transitions. [2025-03-16 23:38:25,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 23:38:25,633 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2025-03-16 23:38:25,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:38:25,635 INFO L225 Difference]: With dead ends: 193 [2025-03-16 23:38:25,635 INFO L226 Difference]: Without dead ends: 191 [2025-03-16 23:38:25,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=262, Invalid=608, Unknown=0, NotChecked=0, Total=870 [2025-03-16 23:38:25,636 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 223 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 23:38:25,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 305 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 23:38:25,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-16 23:38:25,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 144. [2025-03-16 23:38:25,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 95 states have internal predecessors, (119), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-16 23:38:25,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 209 transitions. [2025-03-16 23:38:25,644 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 209 transitions. Word has length 98 [2025-03-16 23:38:25,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:38:25,644 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 209 transitions. [2025-03-16 23:38:25,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 23:38:25,644 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 209 transitions. [2025-03-16 23:38:25,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 23:38:25,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:38:25,645 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:38:25,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 23:38:25,645 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:38:25,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:38:25,646 INFO L85 PathProgramCache]: Analyzing trace with hash 270102134, now seen corresponding path program 1 times [2025-03-16 23:38:25,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:38:25,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508779067] [2025-03-16 23:38:25,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:38:25,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:38:25,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 23:38:25,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 23:38:25,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:38:25,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:38:34,862 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-16 23:38:34,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:38:34,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508779067] [2025-03-16 23:38:34,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508779067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:38:34,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:38:34,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-16 23:38:34,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223838663] [2025-03-16 23:38:34,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:38:34,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 23:38:34,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:38:34,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 23:38:34,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-03-16 23:38:34,864 INFO L87 Difference]: Start difference. First operand 144 states and 209 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-16 23:38:40,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:38:40,499 INFO L93 Difference]: Finished difference Result 180 states and 249 transitions. [2025-03-16 23:38:40,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 23:38:40,500 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 99 [2025-03-16 23:38:40,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:38:40,501 INFO L225 Difference]: With dead ends: 180 [2025-03-16 23:38:40,501 INFO L226 Difference]: Without dead ends: 178 [2025-03-16 23:38:40,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=239, Invalid=753, Unknown=0, NotChecked=0, Total=992 [2025-03-16 23:38:40,502 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 165 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 23:38:40,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 424 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 23:38:40,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-16 23:38:40,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 141. [2025-03-16 23:38:40,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 92 states have (on average 1.25) internal successors, (115), 92 states have internal predecessors, (115), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-16 23:38:40,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 205 transitions. [2025-03-16 23:38:40,511 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 205 transitions. Word has length 99 [2025-03-16 23:38:40,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:38:40,511 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 205 transitions. [2025-03-16 23:38:40,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-16 23:38:40,511 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 205 transitions. [2025-03-16 23:38:40,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 23:38:40,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:38:40,512 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:38:40,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 23:38:40,512 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:38:40,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:38:40,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1243923341, now seen corresponding path program 1 times [2025-03-16 23:38:40,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:38:40,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266751111] [2025-03-16 23:38:40,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:38:40,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:38:40,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 23:38:40,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 23:38:40,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:38:40,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:38:44,610 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-16 23:38:44,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:38:44,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266751111] [2025-03-16 23:38:44,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266751111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:38:44,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:38:44,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-16 23:38:44,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276488526] [2025-03-16 23:38:44,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:38:44,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 23:38:44,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:38:44,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 23:38:44,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-03-16 23:38:44,612 INFO L87 Difference]: Start difference. First operand 141 states and 205 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-16 23:38:46,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:38:46,407 INFO L93 Difference]: Finished difference Result 194 states and 265 transitions. [2025-03-16 23:38:46,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-16 23:38:46,408 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 99 [2025-03-16 23:38:46,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:38:46,409 INFO L225 Difference]: With dead ends: 194 [2025-03-16 23:38:46,409 INFO L226 Difference]: Without dead ends: 192 [2025-03-16 23:38:46,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=293, Invalid=763, Unknown=0, NotChecked=0, Total=1056 [2025-03-16 23:38:46,410 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 271 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:38:46,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 339 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 23:38:46,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-16 23:38:46,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 146. [2025-03-16 23:38:46,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 97 states have (on average 1.2577319587628866) internal successors, (122), 97 states have internal predecessors, (122), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-16 23:38:46,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 212 transitions. [2025-03-16 23:38:46,418 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 212 transitions. Word has length 99 [2025-03-16 23:38:46,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:38:46,418 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 212 transitions. [2025-03-16 23:38:46,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-16 23:38:46,419 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 212 transitions. [2025-03-16 23:38:46,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 23:38:46,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:38:46,419 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:38:46,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 23:38:46,420 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:38:46,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:38:46,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1505339094, now seen corresponding path program 1 times [2025-03-16 23:38:46,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:38:46,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632551621] [2025-03-16 23:38:46,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:38:46,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:38:46,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 23:38:46,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 23:38:46,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:38:46,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:38:52,549 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-16 23:38:52,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:38:52,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632551621] [2025-03-16 23:38:52,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632551621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:38:52,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:38:52,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-16 23:38:52,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875526623] [2025-03-16 23:38:52,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:38:52,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 23:38:52,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:38:52,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 23:38:52,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-03-16 23:38:52,551 INFO L87 Difference]: Start difference. First operand 146 states and 212 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-16 23:38:58,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:38:58,993 INFO L93 Difference]: Finished difference Result 194 states and 265 transitions. [2025-03-16 23:38:58,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-16 23:38:58,994 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 99 [2025-03-16 23:38:58,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:38:58,995 INFO L225 Difference]: With dead ends: 194 [2025-03-16 23:38:58,995 INFO L226 Difference]: Without dead ends: 192 [2025-03-16 23:38:58,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=277, Invalid=779, Unknown=0, NotChecked=0, Total=1056 [2025-03-16 23:38:58,996 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 287 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 23:38:58,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 353 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 23:38:58,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-16 23:38:59,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 147. [2025-03-16 23:38:59,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 98 states have (on average 1.2551020408163265) internal successors, (123), 98 states have internal predecessors, (123), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-16 23:38:59,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 213 transitions. [2025-03-16 23:38:59,006 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 213 transitions. Word has length 99 [2025-03-16 23:38:59,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:38:59,008 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 213 transitions. [2025-03-16 23:38:59,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-16 23:38:59,008 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 213 transitions. [2025-03-16 23:38:59,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 23:38:59,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:38:59,010 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:38:59,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 23:38:59,010 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:38:59,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:38:59,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1243589492, now seen corresponding path program 1 times [2025-03-16 23:38:59,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:38:59,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107012125] [2025-03-16 23:38:59,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:38:59,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:38:59,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 23:38:59,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 23:38:59,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:38:59,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:39:03,471 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-16 23:39:03,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:39:03,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107012125] [2025-03-16 23:39:03,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107012125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:39:03,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:39:03,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-16 23:39:03,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993226467] [2025-03-16 23:39:03,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:39:03,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-16 23:39:03,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:39:03,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-16 23:39:03,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2025-03-16 23:39:03,473 INFO L87 Difference]: Start difference. First operand 147 states and 213 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 23:39:05,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:39:05,032 INFO L93 Difference]: Finished difference Result 190 states and 261 transitions. [2025-03-16 23:39:05,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-16 23:39:05,034 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2025-03-16 23:39:05,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:39:05,035 INFO L225 Difference]: With dead ends: 190 [2025-03-16 23:39:05,035 INFO L226 Difference]: Without dead ends: 188 [2025-03-16 23:39:05,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=294, Invalid=698, Unknown=0, NotChecked=0, Total=992 [2025-03-16 23:39:05,037 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 175 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 23:39:05,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 391 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 23:39:05,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-16 23:39:05,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 147. [2025-03-16 23:39:05,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 98 states have (on average 1.2551020408163265) internal successors, (123), 98 states have internal predecessors, (123), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-16 23:39:05,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 213 transitions. [2025-03-16 23:39:05,049 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 213 transitions. Word has length 99 [2025-03-16 23:39:05,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:39:05,050 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 213 transitions. [2025-03-16 23:39:05,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 23:39:05,050 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 213 transitions. [2025-03-16 23:39:05,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 23:39:05,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:39:05,050 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:39:05,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 23:39:05,050 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:39:05,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:39:05,051 INFO L85 PathProgramCache]: Analyzing trace with hash -302115369, now seen corresponding path program 1 times [2025-03-16 23:39:05,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:39:05,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473580920] [2025-03-16 23:39:05,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:39:05,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:39:05,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 23:39:05,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 23:39:05,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:39:05,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:39:08,646 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-16 23:39:08,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:39:08,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473580920] [2025-03-16 23:39:08,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473580920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:39:08,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:39:08,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-16 23:39:08,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392790475] [2025-03-16 23:39:08,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:39:08,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-16 23:39:08,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:39:08,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-16 23:39:08,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2025-03-16 23:39:08,648 INFO L87 Difference]: Start difference. First operand 147 states and 213 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 23:39:09,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:39:09,798 INFO L93 Difference]: Finished difference Result 183 states and 253 transitions. [2025-03-16 23:39:09,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 23:39:09,799 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2025-03-16 23:39:09,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:39:09,800 INFO L225 Difference]: With dead ends: 183 [2025-03-16 23:39:09,800 INFO L226 Difference]: Without dead ends: 181 [2025-03-16 23:39:09,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=269, Invalid=661, Unknown=0, NotChecked=0, Total=930 [2025-03-16 23:39:09,800 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 214 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 23:39:09,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 320 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 23:39:09,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-16 23:39:09,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 145. [2025-03-16 23:39:09,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 96 states have (on average 1.25) internal successors, (120), 96 states have internal predecessors, (120), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-16 23:39:09,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 210 transitions. [2025-03-16 23:39:09,809 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 210 transitions. Word has length 99 [2025-03-16 23:39:09,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:39:09,809 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 210 transitions. [2025-03-16 23:39:09,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 23:39:09,810 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 210 transitions. [2025-03-16 23:39:09,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 23:39:09,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:39:09,810 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:39:09,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 23:39:09,810 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:39:09,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:39:09,811 INFO L85 PathProgramCache]: Analyzing trace with hash 278562586, now seen corresponding path program 1 times [2025-03-16 23:39:09,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:39:09,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933400981] [2025-03-16 23:39:09,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:39:09,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:39:09,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 23:39:09,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 23:39:09,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:39:09,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat