./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label35.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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/eca-rers2012/Problem13_label35.c -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 bf2e434ddb1157766f0427b524597e37ed925d60033c6d19795be6a9bcd22934 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:43:35,871 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:43:35,934 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:43:35,938 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:43:35,938 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:43:35,960 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:43:35,961 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:43:35,961 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:43:35,961 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:43:35,961 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:43:35,962 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:43:35,962 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:43:35,962 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:43:35,962 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:43:35,962 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:43:35,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:43:35,963 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:43:35,963 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:43:35,963 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:43:35,963 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:43:35,963 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:43:35,963 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:43:35,963 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:43:35,963 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:43:35,963 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:43:35,963 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:43:35,963 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:43:35,963 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:43:35,963 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:43:35,963 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:43:35,964 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:43:35,964 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:43:35,964 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:43:35,964 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:43:35,964 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:43:35,964 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:43:35,964 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:43:35,964 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:43:35,964 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:43:35,964 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:43:35,964 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:43:35,964 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:43:35,964 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:43:35,964 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 -> bf2e434ddb1157766f0427b524597e37ed925d60033c6d19795be6a9bcd22934 [2025-03-03 10:43:36,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:43:36,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:43:36,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:43:36,228 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:43:36,229 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:43:36,230 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label35.c [2025-03-03 10:43:37,475 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a069f189/a8a44b1c922d446e891668dae0a3603a/FLAGb7afd8a22 [2025-03-03 10:43:37,921 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:43:37,921 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label35.c [2025-03-03 10:43:37,947 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a069f189/a8a44b1c922d446e891668dae0a3603a/FLAGb7afd8a22 [2025-03-03 10:43:38,040 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a069f189/a8a44b1c922d446e891668dae0a3603a [2025-03-03 10:43:38,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:43:38,042 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:43:38,043 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:43:38,043 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:43:38,046 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:43:38,047 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:43:38" (1/1) ... [2025-03-03 10:43:38,048 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eeab85d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:43:38, skipping insertion in model container [2025-03-03 10:43:38,049 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:43:38" (1/1) ... [2025-03-03 10:43:38,124 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:43:38,282 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/eca-rers2012/Problem13_label35.c[1793,1806] [2025-03-03 10:43:38,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:43:38,765 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:43:38,776 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/eca-rers2012/Problem13_label35.c[1793,1806] [2025-03-03 10:43:39,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:43:39,110 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:43:39,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:43:39 WrapperNode [2025-03-03 10:43:39,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:43:39,112 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:43:39,113 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:43:39,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:43:39,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:43:39" (1/1) ... [2025-03-03 10:43:39,161 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:43:39" (1/1) ... [2025-03-03 10:43:39,554 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-03 10:43:39,555 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:43:39,556 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:43:39,556 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:43:39,557 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:43:39,564 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:43:39" (1/1) ... [2025-03-03 10:43:39,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:43:39" (1/1) ... [2025-03-03 10:43:39,627 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:43:39" (1/1) ... [2025-03-03 10:43:39,862 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-03 10:43:39,862 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:43:39" (1/1) ... [2025-03-03 10:43:39,862 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:43:39" (1/1) ... [2025-03-03 10:43:40,049 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:43:39" (1/1) ... [2025-03-03 10:43:40,079 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:43:39" (1/1) ... [2025-03-03 10:43:40,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:43:39" (1/1) ... [2025-03-03 10:43:40,159 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:43:39" (1/1) ... [2025-03-03 10:43:40,214 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:43:40,215 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:43:40,215 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:43:40,215 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:43:40,217 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:43:39" (1/1) ... [2025-03-03 10:43:40,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:43:40,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:43:40,257 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-03 10:43:40,262 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-03 10:43:40,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:43:40,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:43:40,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:43:40,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:43:40,326 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:43:40,327 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:43:44,207 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-03 10:43:44,208 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-03 10:43:44,208 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-03 10:43:44,330 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-03 10:43:44,331 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:43:44,359 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:43:44,362 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:43:44,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:43:44 BoogieIcfgContainer [2025-03-03 10:43:44,363 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:43:44,365 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:43:44,366 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:43:44,369 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:43:44,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:43:38" (1/3) ... [2025-03-03 10:43:44,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb82eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:43:44, skipping insertion in model container [2025-03-03 10:43:44,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:43:39" (2/3) ... [2025-03-03 10:43:44,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb82eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:43:44, skipping insertion in model container [2025-03-03 10:43:44,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:43:44" (3/3) ... [2025-03-03 10:43:44,372 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label35.c [2025-03-03 10:43:44,381 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:43:44,383 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label35.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:43:44,455 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:43:44,464 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;@2d3feda3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:43:44,465 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:43:44,473 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:43:44,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-03 10:43:44,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:43:44,477 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:43:44,478 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:43:44,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:43:44,483 INFO L85 PathProgramCache]: Analyzing trace with hash 191434712, now seen corresponding path program 1 times [2025-03-03 10:43:44,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:43:44,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105495344] [2025-03-03 10:43:44,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:44,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:43:44,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 10:43:44,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 10:43:44,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:44,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:44,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:43:44,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:43:44,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105495344] [2025-03-03 10:43:44,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105495344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:43:44,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:43:44,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:43:44,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12293201] [2025-03-03 10:43:44,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:43:44,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:43:44,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:43:44,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:43:44,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:43:44,656 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:43:48,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:43:48,153 INFO L93 Difference]: Finished difference Result 3160 states and 5840 transitions. [2025-03-03 10:43:48,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:43:48,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-03 10:43:48,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:43:48,174 INFO L225 Difference]: With dead ends: 3160 [2025-03-03 10:43:48,174 INFO L226 Difference]: Without dead ends: 1983 [2025-03-03 10:43:48,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:43:48,181 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 1093 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 3030 mSolverCounterSat, 974 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1093 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 4004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 974 IncrementalHoareTripleChecker+Valid, 3030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:43:48,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1093 Valid, 349 Invalid, 4004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [974 Valid, 3030 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-03 10:43:48,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2025-03-03 10:43:48,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1930. [2025-03-03 10:43:48,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1929 states have (on average 1.7973043027475375) internal successors, (3467), 1929 states have internal predecessors, (3467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:43:48,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 3467 transitions. [2025-03-03 10:43:48,284 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 3467 transitions. Word has length 10 [2025-03-03 10:43:48,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:43:48,284 INFO L471 AbstractCegarLoop]: Abstraction has 1930 states and 3467 transitions. [2025-03-03 10:43:48,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:43:48,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 3467 transitions. [2025-03-03 10:43:48,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 10:43:48,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:43:48,286 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:43:48,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:43:48,287 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:43:48,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:43:48,288 INFO L85 PathProgramCache]: Analyzing trace with hash -360447183, now seen corresponding path program 1 times [2025-03-03 10:43:48,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:43:48,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839091113] [2025-03-03 10:43:48,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:48,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:43:48,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 10:43:48,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 10:43:48,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:48,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:48,647 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:43:48,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:43:48,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839091113] [2025-03-03 10:43:48,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839091113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:43:48,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:43:48,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:43:48,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836661120] [2025-03-03 10:43:48,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:43:48,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:43:48,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:43:48,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:43:48,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:43:48,652 INFO L87 Difference]: Start difference. First operand 1930 states and 3467 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:43:51,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:43:51,467 INFO L93 Difference]: Finished difference Result 4718 states and 8523 transitions. [2025-03-03 10:43:51,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:43:51,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-03 10:43:51,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:43:51,476 INFO L225 Difference]: With dead ends: 4718 [2025-03-03 10:43:51,477 INFO L226 Difference]: Without dead ends: 2790 [2025-03-03 10:43:51,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:43:51,480 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 815 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 3015 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 3316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 3015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:43:51,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 737 Invalid, 3316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 3015 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 10:43:51,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2790 states. [2025-03-03 10:43:51,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2790 to 2729. [2025-03-03 10:43:51,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2729 states, 2728 states have (on average 1.7001466275659824) internal successors, (4638), 2728 states have internal predecessors, (4638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:43:51,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2729 states to 2729 states and 4638 transitions. [2025-03-03 10:43:51,522 INFO L78 Accepts]: Start accepts. Automaton has 2729 states and 4638 transitions. Word has length 75 [2025-03-03 10:43:51,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:43:51,523 INFO L471 AbstractCegarLoop]: Abstraction has 2729 states and 4638 transitions. [2025-03-03 10:43:51,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:43:51,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2729 states and 4638 transitions. [2025-03-03 10:43:51,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 10:43:51,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:43:51,524 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:43:51,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:43:51,524 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:43:51,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:43:51,525 INFO L85 PathProgramCache]: Analyzing trace with hash 676777120, now seen corresponding path program 1 times [2025-03-03 10:43:51,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:43:51,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290833657] [2025-03-03 10:43:51,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:51,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:43:51,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 10:43:51,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 10:43:51,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:51,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:51,700 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:43:51,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:43:51,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290833657] [2025-03-03 10:43:51,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290833657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:43:51,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:43:51,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:43:51,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717233721] [2025-03-03 10:43:51,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:43:51,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:43:51,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:43:51,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:43:51,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:43:51,704 INFO L87 Difference]: Start difference. First operand 2729 states and 4638 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:43:54,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:43:54,460 INFO L93 Difference]: Finished difference Result 7862 states and 13450 transitions. [2025-03-03 10:43:54,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:43:54,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-03 10:43:54,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:43:54,478 INFO L225 Difference]: With dead ends: 7862 [2025-03-03 10:43:54,478 INFO L226 Difference]: Without dead ends: 5135 [2025-03-03 10:43:54,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:43:54,482 INFO L435 NwaCegarLoop]: 879 mSDtfsCounter, 937 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2603 mSolverCounterSat, 749 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 3352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 749 IncrementalHoareTripleChecker+Valid, 2603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:43:54,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [937 Valid, 1015 Invalid, 3352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [749 Valid, 2603 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 10:43:54,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5135 states. [2025-03-03 10:43:54,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5135 to 5127. [2025-03-03 10:43:54,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5127 states, 5126 states have (on average 1.533164260632072) internal successors, (7859), 5126 states have internal predecessors, (7859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:43:54,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5127 states to 5127 states and 7859 transitions. [2025-03-03 10:43:54,549 INFO L78 Accepts]: Start accepts. Automaton has 5127 states and 7859 transitions. Word has length 81 [2025-03-03 10:43:54,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:43:54,550 INFO L471 AbstractCegarLoop]: Abstraction has 5127 states and 7859 transitions. [2025-03-03 10:43:54,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:43:54,550 INFO L276 IsEmpty]: Start isEmpty. Operand 5127 states and 7859 transitions. [2025-03-03 10:43:54,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 10:43:54,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:43:54,551 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:43:54,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:43:54,552 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:43:54,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:43:54,552 INFO L85 PathProgramCache]: Analyzing trace with hash -264425642, now seen corresponding path program 1 times [2025-03-03 10:43:54,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:43:54,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678163098] [2025-03-03 10:43:54,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:54,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:43:54,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 10:43:54,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 10:43:54,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:54,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:54,693 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:43:54,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:43:54,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678163098] [2025-03-03 10:43:54,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678163098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:43:54,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:43:54,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:43:54,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876404982] [2025-03-03 10:43:54,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:43:54,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:43:54,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:43:54,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:43:54,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:43:54,696 INFO L87 Difference]: Start difference. First operand 5127 states and 7859 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:43:57,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:43:57,174 INFO L93 Difference]: Finished difference Result 15019 states and 23083 transitions. [2025-03-03 10:43:57,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:43:57,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2025-03-03 10:43:57,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:43:57,198 INFO L225 Difference]: With dead ends: 15019 [2025-03-03 10:43:57,198 INFO L226 Difference]: Without dead ends: 9894 [2025-03-03 10:43:57,204 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-03 10:43:57,204 INFO L435 NwaCegarLoop]: 979 mSDtfsCounter, 874 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2468 mSolverCounterSat, 794 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 3262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 794 IncrementalHoareTripleChecker+Valid, 2468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:43:57,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 1129 Invalid, 3262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [794 Valid, 2468 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:43:57,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9894 states. [2025-03-03 10:43:57,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9894 to 9872. [2025-03-03 10:43:57,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9872 states, 9871 states have (on average 1.3389727484550704) internal successors, (13217), 9871 states have internal predecessors, (13217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:43:57,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9872 states to 9872 states and 13217 transitions. [2025-03-03 10:43:57,328 INFO L78 Accepts]: Start accepts. Automaton has 9872 states and 13217 transitions. Word has length 121 [2025-03-03 10:43:57,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:43:57,329 INFO L471 AbstractCegarLoop]: Abstraction has 9872 states and 13217 transitions. [2025-03-03 10:43:57,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:43:57,329 INFO L276 IsEmpty]: Start isEmpty. Operand 9872 states and 13217 transitions. [2025-03-03 10:43:57,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 10:43:57,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:43:57,331 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:43:57,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:43:57,331 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:43:57,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:43:57,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1279414950, now seen corresponding path program 1 times [2025-03-03 10:43:57,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:43:57,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567353046] [2025-03-03 10:43:57,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:57,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:43:57,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 10:43:57,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 10:43:57,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:57,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:57,658 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 10:43:57,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:43:57,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567353046] [2025-03-03 10:43:57,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567353046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:43:57,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:43:57,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:43:57,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164799875] [2025-03-03 10:43:57,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:43:57,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:43:57,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:43:57,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:43:57,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:43:57,662 INFO L87 Difference]: Start difference. First operand 9872 states and 13217 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:43:59,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:43:59,756 INFO L93 Difference]: Finished difference Result 17378 states and 23437 transitions. [2025-03-03 10:43:59,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:43:59,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2025-03-03 10:43:59,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:43:59,781 INFO L225 Difference]: With dead ends: 17378 [2025-03-03 10:43:59,781 INFO L226 Difference]: Without dead ends: 10666 [2025-03-03 10:43:59,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:43:59,791 INFO L435 NwaCegarLoop]: 1046 mSDtfsCounter, 707 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2567 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 2571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:43:59,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 1175 Invalid, 2571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2567 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:43:59,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10666 states. [2025-03-03 10:43:59,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10666 to 10659. [2025-03-03 10:43:59,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10659 states, 10658 states have (on average 1.3172264965284293) internal successors, (14039), 10658 states have internal predecessors, (14039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:43:59,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10659 states to 10659 states and 14039 transitions. [2025-03-03 10:43:59,979 INFO L78 Accepts]: Start accepts. Automaton has 10659 states and 14039 transitions. Word has length 164 [2025-03-03 10:43:59,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:43:59,979 INFO L471 AbstractCegarLoop]: Abstraction has 10659 states and 14039 transitions. [2025-03-03 10:43:59,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:43:59,980 INFO L276 IsEmpty]: Start isEmpty. Operand 10659 states and 14039 transitions. [2025-03-03 10:43:59,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 10:43:59,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:43:59,982 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:43:59,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:43:59,983 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:43:59,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:43:59,983 INFO L85 PathProgramCache]: Analyzing trace with hash 29927646, now seen corresponding path program 1 times [2025-03-03 10:43:59,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:43:59,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426201498] [2025-03-03 10:43:59,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:59,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:00,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 10:44:00,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 10:44:00,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:00,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:00,251 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-03 10:44:00,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:00,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426201498] [2025-03-03 10:44:00,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426201498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:00,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:00,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:44:00,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269905439] [2025-03-03 10:44:00,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:00,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:00,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:00,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:00,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:00,256 INFO L87 Difference]: Start difference. First operand 10659 states and 14039 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:03,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:03,006 INFO L93 Difference]: Finished difference Result 23671 states and 32238 transitions. [2025-03-03 10:44:03,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:03,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2025-03-03 10:44:03,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:03,028 INFO L225 Difference]: With dead ends: 23671 [2025-03-03 10:44:03,028 INFO L226 Difference]: Without dead ends: 13801 [2025-03-03 10:44:03,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:03,035 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 880 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2321 mSolverCounterSat, 874 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 3195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 874 IncrementalHoareTripleChecker+Valid, 2321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:03,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 1019 Invalid, 3195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [874 Valid, 2321 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 10:44:03,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13801 states. [2025-03-03 10:44:03,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13801 to 13798. [2025-03-03 10:44:03,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13798 states, 13797 states have (on average 1.247155178662028) internal successors, (17207), 13797 states have internal predecessors, (17207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:03,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13798 states to 13798 states and 17207 transitions. [2025-03-03 10:44:03,156 INFO L78 Accepts]: Start accepts. Automaton has 13798 states and 17207 transitions. Word has length 171 [2025-03-03 10:44:03,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:03,156 INFO L471 AbstractCegarLoop]: Abstraction has 13798 states and 17207 transitions. [2025-03-03 10:44:03,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:03,156 INFO L276 IsEmpty]: Start isEmpty. Operand 13798 states and 17207 transitions. [2025-03-03 10:44:03,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-03 10:44:03,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:03,158 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:44:03,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:44:03,158 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:03,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:03,159 INFO L85 PathProgramCache]: Analyzing trace with hash 982293305, now seen corresponding path program 1 times [2025-03-03 10:44:03,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:03,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831879583] [2025-03-03 10:44:03,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:03,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:03,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-03 10:44:03,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-03 10:44:03,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:03,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:03,353 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:44:03,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:03,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831879583] [2025-03-03 10:44:03,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831879583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:03,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:03,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:44:03,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203641535] [2025-03-03 10:44:03,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:03,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:03,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:03,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:03,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:03,355 INFO L87 Difference]: Start difference. First operand 13798 states and 17207 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:06,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:06,070 INFO L93 Difference]: Finished difference Result 33140 states and 42604 transitions. [2025-03-03 10:44:06,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:06,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 222 [2025-03-03 10:44:06,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:06,151 INFO L225 Difference]: With dead ends: 33140 [2025-03-03 10:44:06,151 INFO L226 Difference]: Without dead ends: 20131 [2025-03-03 10:44:06,165 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-03 10:44:06,167 INFO L435 NwaCegarLoop]: 1800 mSDtfsCounter, 772 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2560 mSolverCounterSat, 715 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1943 SdHoareTripleChecker+Invalid, 3275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 715 IncrementalHoareTripleChecker+Valid, 2560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:06,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 1943 Invalid, 3275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [715 Valid, 2560 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 10:44:06,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20131 states. [2025-03-03 10:44:06,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20131 to 20100. [2025-03-03 10:44:06,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20100 states, 20099 states have (on average 1.2067267028210358) internal successors, (24254), 20099 states have internal predecessors, (24254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:06,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20100 states to 20100 states and 24254 transitions. [2025-03-03 10:44:06,420 INFO L78 Accepts]: Start accepts. Automaton has 20100 states and 24254 transitions. Word has length 222 [2025-03-03 10:44:06,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:06,421 INFO L471 AbstractCegarLoop]: Abstraction has 20100 states and 24254 transitions. [2025-03-03 10:44:06,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:06,421 INFO L276 IsEmpty]: Start isEmpty. Operand 20100 states and 24254 transitions. [2025-03-03 10:44:06,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-03 10:44:06,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:06,423 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:44:06,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:44:06,423 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:06,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:06,428 INFO L85 PathProgramCache]: Analyzing trace with hash -2092943941, now seen corresponding path program 1 times [2025-03-03 10:44:06,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:06,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959672842] [2025-03-03 10:44:06,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:06,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:06,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-03 10:44:06,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-03 10:44:06,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:06,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:06,602 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:44:06,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:06,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959672842] [2025-03-03 10:44:06,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959672842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:06,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:06,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:44:06,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120050581] [2025-03-03 10:44:06,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:06,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:06,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:06,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:06,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:06,604 INFO L87 Difference]: Start difference. First operand 20100 states and 24254 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:09,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:09,154 INFO L93 Difference]: Finished difference Result 57506 states and 69724 transitions. [2025-03-03 10:44:09,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:09,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 224 [2025-03-03 10:44:09,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:09,194 INFO L225 Difference]: With dead ends: 57506 [2025-03-03 10:44:09,194 INFO L226 Difference]: Without dead ends: 36616 [2025-03-03 10:44:09,214 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-03 10:44:09,214 INFO L435 NwaCegarLoop]: 1696 mSDtfsCounter, 936 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2420 mSolverCounterSat, 812 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1833 SdHoareTripleChecker+Invalid, 3232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 812 IncrementalHoareTripleChecker+Valid, 2420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:09,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 1833 Invalid, 3232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [812 Valid, 2420 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:44:09,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36616 states. [2025-03-03 10:44:09,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36616 to 35036. [2025-03-03 10:44:09,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35036 states, 35035 states have (on average 1.167261310118453) internal successors, (40895), 35035 states have internal predecessors, (40895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:09,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35036 states to 35036 states and 40895 transitions. [2025-03-03 10:44:09,626 INFO L78 Accepts]: Start accepts. Automaton has 35036 states and 40895 transitions. Word has length 224 [2025-03-03 10:44:09,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:09,627 INFO L471 AbstractCegarLoop]: Abstraction has 35036 states and 40895 transitions. [2025-03-03 10:44:09,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:09,627 INFO L276 IsEmpty]: Start isEmpty. Operand 35036 states and 40895 transitions. [2025-03-03 10:44:09,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-03-03 10:44:09,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:09,632 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:44:09,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:44:09,632 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:09,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:09,633 INFO L85 PathProgramCache]: Analyzing trace with hash 169386479, now seen corresponding path program 1 times [2025-03-03 10:44:09,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:09,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570456714] [2025-03-03 10:44:09,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:09,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:09,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-03-03 10:44:09,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-03-03 10:44:09,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:09,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:10,756 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 144 proven. 113 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 10:44:10,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:10,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570456714] [2025-03-03 10:44:10,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570456714] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:44:10,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138994721] [2025-03-03 10:44:10,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:10,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:44:10,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:44:10,760 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-03 10:44:10,761 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-03 10:44:10,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-03-03 10:44:10,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-03-03 10:44:10,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:10,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:10,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:44:10,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:44:11,026 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-03 10:44:11,026 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:44:11,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138994721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:11,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:44:11,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-03 10:44:11,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466304393] [2025-03-03 10:44:11,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:11,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:11,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:11,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:11,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:44:11,028 INFO L87 Difference]: Start difference. First operand 35036 states and 40895 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:13,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:13,467 INFO L93 Difference]: Finished difference Result 69272 states and 80986 transitions. [2025-03-03 10:44:13,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:13,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 316 [2025-03-03 10:44:13,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:13,498 INFO L225 Difference]: With dead ends: 69272 [2025-03-03 10:44:13,498 INFO L226 Difference]: Without dead ends: 35025 [2025-03-03 10:44:13,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:44:13,508 INFO L435 NwaCegarLoop]: 679 mSDtfsCounter, 1075 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2388 mSolverCounterSat, 526 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 2914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 526 IncrementalHoareTripleChecker+Valid, 2388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:13,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 808 Invalid, 2914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [526 Valid, 2388 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:44:13,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35025 states. [2025-03-03 10:44:13,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35025 to 35022. [2025-03-03 10:44:13,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35022 states, 35021 states have (on average 1.12189828959767) internal successors, (39290), 35021 states have internal predecessors, (39290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:13,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35022 states to 35022 states and 39290 transitions. [2025-03-03 10:44:13,781 INFO L78 Accepts]: Start accepts. Automaton has 35022 states and 39290 transitions. Word has length 316 [2025-03-03 10:44:13,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:13,782 INFO L471 AbstractCegarLoop]: Abstraction has 35022 states and 39290 transitions. [2025-03-03 10:44:13,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:13,782 INFO L276 IsEmpty]: Start isEmpty. Operand 35022 states and 39290 transitions. [2025-03-03 10:44:13,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-03-03 10:44:13,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:13,786 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:44:13,793 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-03 10:44:13,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:44:13,987 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:13,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:13,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1127660430, now seen corresponding path program 1 times [2025-03-03 10:44:13,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:13,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073360648] [2025-03-03 10:44:13,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:13,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:14,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-03 10:44:14,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-03 10:44:14,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:14,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:14,289 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-03 10:44:14,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:14,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073360648] [2025-03-03 10:44:14,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073360648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:14,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:14,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:44:14,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867545643] [2025-03-03 10:44:14,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:14,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:14,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:14,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:14,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:14,295 INFO L87 Difference]: Start difference. First operand 35022 states and 39290 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:17,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:17,188 INFO L93 Difference]: Finished difference Result 80263 states and 91165 transitions. [2025-03-03 10:44:17,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:17,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 325 [2025-03-03 10:44:17,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:17,231 INFO L225 Difference]: With dead ends: 80263 [2025-03-03 10:44:17,231 INFO L226 Difference]: Without dead ends: 46030 [2025-03-03 10:44:17,246 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-03 10:44:17,247 INFO L435 NwaCegarLoop]: 1437 mSDtfsCounter, 1145 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 2384 mSolverCounterSat, 766 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 3150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 766 IncrementalHoareTripleChecker+Valid, 2384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:17,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 1521 Invalid, 3150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [766 Valid, 2384 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 10:44:17,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46030 states. [2025-03-03 10:44:17,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46030 to 46029. [2025-03-03 10:44:17,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46029 states, 46028 states have (on average 1.113170244199183) internal successors, (51237), 46028 states have internal predecessors, (51237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:17,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46029 states to 46029 states and 51237 transitions. [2025-03-03 10:44:17,699 INFO L78 Accepts]: Start accepts. Automaton has 46029 states and 51237 transitions. Word has length 325 [2025-03-03 10:44:17,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:17,699 INFO L471 AbstractCegarLoop]: Abstraction has 46029 states and 51237 transitions. [2025-03-03 10:44:17,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:17,699 INFO L276 IsEmpty]: Start isEmpty. Operand 46029 states and 51237 transitions. [2025-03-03 10:44:17,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-03-03 10:44:17,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:17,705 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:44:17,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:44:17,705 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:17,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:17,706 INFO L85 PathProgramCache]: Analyzing trace with hash 242366445, now seen corresponding path program 1 times [2025-03-03 10:44:17,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:17,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535025176] [2025-03-03 10:44:17,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:17,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:17,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-03-03 10:44:17,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-03-03 10:44:17,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:17,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:17,996 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 406 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-03 10:44:17,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:17,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535025176] [2025-03-03 10:44:17,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535025176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:17,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:17,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:44:17,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992852584] [2025-03-03 10:44:17,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:17,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:44:17,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:17,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:44:17,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:44:18,000 INFO L87 Difference]: Start difference. First operand 46029 states and 51237 transitions. Second operand has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:23,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:23,097 INFO L93 Difference]: Finished difference Result 126858 states and 140816 transitions. [2025-03-03 10:44:23,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:44:23,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 358 [2025-03-03 10:44:23,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:23,181 INFO L225 Difference]: With dead ends: 126858 [2025-03-03 10:44:23,181 INFO L226 Difference]: Without dead ends: 81618 [2025-03-03 10:44:23,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:44:23,221 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 1675 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 6523 mSolverCounterSat, 944 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1675 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 7467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 944 IncrementalHoareTripleChecker+Valid, 6523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:23,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1675 Valid, 856 Invalid, 7467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [944 Valid, 6523 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-03-03 10:44:23,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81618 states. [2025-03-03 10:44:23,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81618 to 59420. [2025-03-03 10:44:23,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59420 states, 59419 states have (on average 1.0986721419074708) internal successors, (65282), 59419 states have internal predecessors, (65282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:23,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59420 states to 59420 states and 65282 transitions. [2025-03-03 10:44:23,859 INFO L78 Accepts]: Start accepts. Automaton has 59420 states and 65282 transitions. Word has length 358 [2025-03-03 10:44:23,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:23,859 INFO L471 AbstractCegarLoop]: Abstraction has 59420 states and 65282 transitions. [2025-03-03 10:44:23,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:23,860 INFO L276 IsEmpty]: Start isEmpty. Operand 59420 states and 65282 transitions. [2025-03-03 10:44:23,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-03-03 10:44:23,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:23,863 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:44:23,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:44:23,863 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:23,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:23,864 INFO L85 PathProgramCache]: Analyzing trace with hash 198716456, now seen corresponding path program 1 times [2025-03-03 10:44:23,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:23,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413666521] [2025-03-03 10:44:23,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:23,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:23,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-03 10:44:23,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-03 10:44:23,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:23,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:23,996 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-03 10:44:23,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:23,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413666521] [2025-03-03 10:44:23,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413666521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:23,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:23,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:44:23,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202524666] [2025-03-03 10:44:23,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:23,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:23,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:23,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:23,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:23,998 INFO L87 Difference]: Start difference. First operand 59420 states and 65282 transitions. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:27,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 10:44:27,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:27,962 INFO L93 Difference]: Finished difference Result 134579 states and 148447 transitions. [2025-03-03 10:44:27,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:27,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 371 [2025-03-03 10:44:27,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:28,042 INFO L225 Difference]: With dead ends: 134579 [2025-03-03 10:44:28,042 INFO L226 Difference]: Without dead ends: 75948 [2025-03-03 10:44:28,073 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-03 10:44:28,073 INFO L435 NwaCegarLoop]: 748 mSDtfsCounter, 813 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2400 mSolverCounterSat, 898 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 3298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 898 IncrementalHoareTripleChecker+Valid, 2400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:28,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 830 Invalid, 3298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [898 Valid, 2400 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-03-03 10:44:28,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75948 states. [2025-03-03 10:44:28,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75948 to 74362. [2025-03-03 10:44:28,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74362 states, 74361 states have (on average 1.0902220249862158) internal successors, (81070), 74361 states have internal predecessors, (81070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:28,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74362 states to 74362 states and 81070 transitions. [2025-03-03 10:44:28,832 INFO L78 Accepts]: Start accepts. Automaton has 74362 states and 81070 transitions. Word has length 371 [2025-03-03 10:44:28,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:28,833 INFO L471 AbstractCegarLoop]: Abstraction has 74362 states and 81070 transitions. [2025-03-03 10:44:28,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:28,833 INFO L276 IsEmpty]: Start isEmpty. Operand 74362 states and 81070 transitions. [2025-03-03 10:44:28,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-03-03 10:44:28,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:28,854 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:44:28,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:44:28,854 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:28,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:28,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1517580509, now seen corresponding path program 1 times [2025-03-03 10:44:28,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:28,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140091594] [2025-03-03 10:44:28,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:28,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:28,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-03 10:44:28,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-03 10:44:28,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:28,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:29,177 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2025-03-03 10:44:29,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:29,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140091594] [2025-03-03 10:44:29,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140091594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:29,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:29,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:44:29,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101134966] [2025-03-03 10:44:29,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:29,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:29,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:29,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:29,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:29,180 INFO L87 Difference]: Start difference. First operand 74362 states and 81070 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:31,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:31,972 INFO L93 Difference]: Finished difference Result 162889 states and 178357 transitions. [2025-03-03 10:44:31,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:31,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 477 [2025-03-03 10:44:31,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:32,069 INFO L225 Difference]: With dead ends: 162889 [2025-03-03 10:44:32,070 INFO L226 Difference]: Without dead ends: 87742 [2025-03-03 10:44:32,112 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-03 10:44:32,113 INFO L435 NwaCegarLoop]: 1699 mSDtfsCounter, 848 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 2484 mSolverCounterSat, 670 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 1834 SdHoareTripleChecker+Invalid, 3154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 670 IncrementalHoareTripleChecker+Valid, 2484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:32,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 1834 Invalid, 3154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [670 Valid, 2484 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:44:32,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87742 states. [2025-03-03 10:44:33,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87742 to 87729. [2025-03-03 10:44:33,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87729 states, 87728 states have (on average 1.07666879445559) internal successors, (94454), 87728 states have internal predecessors, (94454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:33,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87729 states to 87729 states and 94454 transitions. [2025-03-03 10:44:33,168 INFO L78 Accepts]: Start accepts. Automaton has 87729 states and 94454 transitions. Word has length 477 [2025-03-03 10:44:33,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:33,169 INFO L471 AbstractCegarLoop]: Abstraction has 87729 states and 94454 transitions. [2025-03-03 10:44:33,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:33,169 INFO L276 IsEmpty]: Start isEmpty. Operand 87729 states and 94454 transitions. [2025-03-03 10:44:33,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2025-03-03 10:44:33,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:33,189 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:44:33,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:44:33,190 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:33,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:33,190 INFO L85 PathProgramCache]: Analyzing trace with hash -193835113, now seen corresponding path program 1 times [2025-03-03 10:44:33,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:33,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941799076] [2025-03-03 10:44:33,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:33,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:33,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-03-03 10:44:33,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-03-03 10:44:33,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:33,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:34,529 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 253 proven. 113 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 10:44:34,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:34,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941799076] [2025-03-03 10:44:34,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941799076] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:44:34,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623885892] [2025-03-03 10:44:34,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:34,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:44:34,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:44:34,532 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:44:34,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 10:44:34,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-03-03 10:44:34,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-03-03 10:44:34,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:34,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:34,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:44:34,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:44:35,202 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2025-03-03 10:44:35,202 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:44:35,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623885892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:35,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:44:35,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2025-03-03 10:44:35,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977694887] [2025-03-03 10:44:35,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:35,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:35,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:35,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:35,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:44:35,203 INFO L87 Difference]: Start difference. First operand 87729 states and 94454 transitions. Second operand has 3 states, 3 states have (on average 158.0) internal successors, (474), 2 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:37,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:37,660 INFO L93 Difference]: Finished difference Result 179404 states and 193004 transitions. [2025-03-03 10:44:37,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:37,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 2 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 593 [2025-03-03 10:44:37,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:37,766 INFO L225 Difference]: With dead ends: 179404 [2025-03-03 10:44:37,766 INFO L226 Difference]: Without dead ends: 90887 [2025-03-03 10:44:37,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 592 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:44:37,824 INFO L435 NwaCegarLoop]: 981 mSDtfsCounter, 680 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2421 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 2528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 2421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:37,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 1110 Invalid, 2528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 2421 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:44:37,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90887 states. [2025-03-03 10:44:38,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90887 to 90878. [2025-03-03 10:44:38,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90878 states, 90877 states have (on average 1.0684881763262433) internal successors, (97101), 90877 states have internal predecessors, (97101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:38,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90878 states to 90878 states and 97101 transitions. [2025-03-03 10:44:38,900 INFO L78 Accepts]: Start accepts. Automaton has 90878 states and 97101 transitions. Word has length 593 [2025-03-03 10:44:38,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:38,900 INFO L471 AbstractCegarLoop]: Abstraction has 90878 states and 97101 transitions. [2025-03-03 10:44:38,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 2 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:38,900 INFO L276 IsEmpty]: Start isEmpty. Operand 90878 states and 97101 transitions. [2025-03-03 10:44:38,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2025-03-03 10:44:38,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:38,922 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:44:38,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 10:44:39,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 10:44:39,123 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:39,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:39,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1645978099, now seen corresponding path program 1 times [2025-03-03 10:44:39,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:39,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243283530] [2025-03-03 10:44:39,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:39,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:39,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 635 statements into 1 equivalence classes. [2025-03-03 10:44:39,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 635 of 635 statements. [2025-03-03 10:44:39,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:39,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:39,426 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 743 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-03-03 10:44:39,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:39,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243283530] [2025-03-03 10:44:39,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243283530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:39,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:39,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:44:39,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204733945] [2025-03-03 10:44:39,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:39,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:39,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:39,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:39,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:39,428 INFO L87 Difference]: Start difference. First operand 90878 states and 97101 transitions. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:41,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:41,882 INFO L93 Difference]: Finished difference Result 179381 states and 191744 transitions. [2025-03-03 10:44:41,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:41,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 635 [2025-03-03 10:44:41,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:41,983 INFO L225 Difference]: With dead ends: 179381 [2025-03-03 10:44:41,983 INFO L226 Difference]: Without dead ends: 89292 [2025-03-03 10:44:42,035 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-03 10:44:42,036 INFO L435 NwaCegarLoop]: 1313 mSDtfsCounter, 917 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 2356 mSolverCounterSat, 555 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 2911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 555 IncrementalHoareTripleChecker+Valid, 2356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:42,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 1386 Invalid, 2911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [555 Valid, 2356 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:44:42,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89292 states. [2025-03-03 10:44:42,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89292 to 89280. [2025-03-03 10:44:42,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89280 states, 89279 states have (on average 1.051378263645426) internal successors, (93866), 89279 states have internal predecessors, (93866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:43,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89280 states to 89280 states and 93866 transitions. [2025-03-03 10:44:43,112 INFO L78 Accepts]: Start accepts. Automaton has 89280 states and 93866 transitions. Word has length 635 [2025-03-03 10:44:43,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:43,112 INFO L471 AbstractCegarLoop]: Abstraction has 89280 states and 93866 transitions. [2025-03-03 10:44:43,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:43,112 INFO L276 IsEmpty]: Start isEmpty. Operand 89280 states and 93866 transitions. [2025-03-03 10:44:43,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2025-03-03 10:44:43,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:43,128 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:44:43,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:44:43,129 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:43,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:43,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1968242779, now seen corresponding path program 1 times [2025-03-03 10:44:43,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:43,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530422486] [2025-03-03 10:44:43,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:43,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:43,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 651 statements into 1 equivalence classes. [2025-03-03 10:44:43,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 651 of 651 statements. [2025-03-03 10:44:43,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:43,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:43,478 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 631 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-03 10:44:43,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:43,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530422486] [2025-03-03 10:44:43,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530422486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:43,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:43,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:44:43,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999898206] [2025-03-03 10:44:43,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:43,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:43,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:43,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:43,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:43,480 INFO L87 Difference]: Start difference. First operand 89280 states and 93866 transitions. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:45,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:45,727 INFO L93 Difference]: Finished difference Result 178564 states and 187779 transitions. [2025-03-03 10:44:45,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:45,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 651 [2025-03-03 10:44:45,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:45,831 INFO L225 Difference]: With dead ends: 178564 [2025-03-03 10:44:45,832 INFO L226 Difference]: Without dead ends: 90073 [2025-03-03 10:44:46,016 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-03 10:44:46,016 INFO L435 NwaCegarLoop]: 1687 mSDtfsCounter, 722 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 2421 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1811 SdHoareTripleChecker+Invalid, 2429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:46,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1811 Invalid, 2429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2421 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 10:44:46,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90073 states. [2025-03-03 10:44:46,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90073 to 90068. [2025-03-03 10:44:46,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90068 states, 90067 states have (on average 1.0513062497918217) internal successors, (94688), 90067 states have internal predecessors, (94688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:46,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90068 states to 90068 states and 94688 transitions. [2025-03-03 10:44:46,650 INFO L78 Accepts]: Start accepts. Automaton has 90068 states and 94688 transitions. Word has length 651 [2025-03-03 10:44:46,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:46,651 INFO L471 AbstractCegarLoop]: Abstraction has 90068 states and 94688 transitions. [2025-03-03 10:44:46,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:46,651 INFO L276 IsEmpty]: Start isEmpty. Operand 90068 states and 94688 transitions. [2025-03-03 10:44:46,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2025-03-03 10:44:46,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:46,663 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:44:46,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:44:46,663 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:46,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:46,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1981167193, now seen corresponding path program 1 times [2025-03-03 10:44:46,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:46,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632020015] [2025-03-03 10:44:46,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:46,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:46,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 653 statements into 1 equivalence classes. [2025-03-03 10:44:46,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 653 of 653 statements. [2025-03-03 10:44:46,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:46,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:47,004 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 505 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-03 10:44:47,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:47,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632020015] [2025-03-03 10:44:47,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632020015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:47,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:47,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:44:47,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254090728] [2025-03-03 10:44:47,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:47,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:47,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:47,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:47,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:47,008 INFO L87 Difference]: Start difference. First operand 90068 states and 94688 transitions. Second operand has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:49,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:49,796 INFO L93 Difference]: Finished difference Result 180938 states and 190189 transitions. [2025-03-03 10:44:49,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:49,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 653 [2025-03-03 10:44:49,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:50,082 INFO L225 Difference]: With dead ends: 180938 [2025-03-03 10:44:50,082 INFO L226 Difference]: Without dead ends: 90080 [2025-03-03 10:44:50,107 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-03 10:44:50,107 INFO L435 NwaCegarLoop]: 1589 mSDtfsCounter, 773 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 2409 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 2573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 2409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:50,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 1715 Invalid, 2573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 2409 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:44:50,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90080 states. [2025-03-03 10:44:50,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90080 to 90064. [2025-03-03 10:44:50,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90064 states, 90063 states have (on average 1.0476999433729723) internal successors, (94359), 90063 states have internal predecessors, (94359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:50,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90064 states to 90064 states and 94359 transitions. [2025-03-03 10:44:50,960 INFO L78 Accepts]: Start accepts. Automaton has 90064 states and 94359 transitions. Word has length 653 [2025-03-03 10:44:50,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:50,960 INFO L471 AbstractCegarLoop]: Abstraction has 90064 states and 94359 transitions. [2025-03-03 10:44:50,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:50,960 INFO L276 IsEmpty]: Start isEmpty. Operand 90064 states and 94359 transitions. [2025-03-03 10:44:50,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2025-03-03 10:44:50,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:50,971 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:44:50,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:44:50,971 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:50,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:50,972 INFO L85 PathProgramCache]: Analyzing trace with hash -218623981, now seen corresponding path program 1 times [2025-03-03 10:44:50,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:50,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948013630] [2025-03-03 10:44:50,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:50,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:51,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 676 statements into 1 equivalence classes. [2025-03-03 10:44:51,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 676 of 676 statements. [2025-03-03 10:44:51,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:51,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:51,157 INFO L134 CoverageAnalysis]: Checked inductivity of 972 backedges. 441 proven. 0 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked. [2025-03-03 10:44:51,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:51,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948013630] [2025-03-03 10:44:51,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948013630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:51,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:51,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:44:51,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666783679] [2025-03-03 10:44:51,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:51,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:51,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:51,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:51,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:51,159 INFO L87 Difference]: Start difference. First operand 90064 states and 94359 transitions. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 2 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:52,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:52,768 INFO L93 Difference]: Finished difference Result 178537 states and 187032 transitions. [2025-03-03 10:44:52,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:52,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 2 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 676 [2025-03-03 10:44:52,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:52,865 INFO L225 Difference]: With dead ends: 178537 [2025-03-03 10:44:52,865 INFO L226 Difference]: Without dead ends: 89262 [2025-03-03 10:44:52,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:52,918 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 1539 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1539 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:52,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1539 Valid, 259 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:44:52,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89262 states. [2025-03-03 10:44:53,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89262 to 89261. [2025-03-03 10:44:53,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89261 states, 89260 states have (on average 1.0469303159309882) internal successors, (93449), 89260 states have internal predecessors, (93449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:53,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89261 states to 89261 states and 93449 transitions. [2025-03-03 10:44:53,815 INFO L78 Accepts]: Start accepts. Automaton has 89261 states and 93449 transitions. Word has length 676 [2025-03-03 10:44:53,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:53,815 INFO L471 AbstractCegarLoop]: Abstraction has 89261 states and 93449 transitions. [2025-03-03 10:44:53,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 2 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:53,815 INFO L276 IsEmpty]: Start isEmpty. Operand 89261 states and 93449 transitions. [2025-03-03 10:44:53,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 682 [2025-03-03 10:44:53,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:53,827 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:44:53,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 10:44:53,827 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:53,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:53,828 INFO L85 PathProgramCache]: Analyzing trace with hash -249508995, now seen corresponding path program 1 times [2025-03-03 10:44:53,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:53,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813401912] [2025-03-03 10:44:53,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:53,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:54,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 681 statements into 1 equivalence classes. [2025-03-03 10:44:54,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 681 of 681 statements. [2025-03-03 10:44:54,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:54,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:54,433 INFO L134 CoverageAnalysis]: Checked inductivity of 998 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2025-03-03 10:44:54,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:54,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813401912] [2025-03-03 10:44:54,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813401912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:54,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:54,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:44:54,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961512955] [2025-03-03 10:44:54,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:54,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:54,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:54,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:54,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:54,434 INFO L87 Difference]: Start difference. First operand 89261 states and 93449 transitions. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:56,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:56,701 INFO L93 Difference]: Finished difference Result 177738 states and 186112 transitions. [2025-03-03 10:44:56,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:56,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 681 [2025-03-03 10:44:56,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:56,802 INFO L225 Difference]: With dead ends: 177738 [2025-03-03 10:44:56,802 INFO L226 Difference]: Without dead ends: 89266 [2025-03-03 10:44:56,851 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-03 10:44:56,852 INFO L435 NwaCegarLoop]: 1594 mSDtfsCounter, 616 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2348 mSolverCounterSat, 370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 1711 SdHoareTripleChecker+Invalid, 2718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 2348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:56,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 1711 Invalid, 2718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 2348 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:44:56,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89266 states. [2025-03-03 10:44:57,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89266 to 89259. [2025-03-03 10:44:57,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89259 states, 89258 states have (on average 1.0383270967308253) internal successors, (92679), 89258 states have internal predecessors, (92679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:57,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89259 states to 89259 states and 92679 transitions. [2025-03-03 10:44:57,900 INFO L78 Accepts]: Start accepts. Automaton has 89259 states and 92679 transitions. Word has length 681 [2025-03-03 10:44:57,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:57,901 INFO L471 AbstractCegarLoop]: Abstraction has 89259 states and 92679 transitions. [2025-03-03 10:44:57,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:57,901 INFO L276 IsEmpty]: Start isEmpty. Operand 89259 states and 92679 transitions. [2025-03-03 10:44:57,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2025-03-03 10:44:57,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:57,919 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:44:57,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 10:44:57,919 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:57,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:57,920 INFO L85 PathProgramCache]: Analyzing trace with hash 466351560, now seen corresponding path program 1 times [2025-03-03 10:44:57,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:57,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371442186] [2025-03-03 10:44:57,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:57,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:57,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 690 statements into 1 equivalence classes. [2025-03-03 10:44:58,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 690 of 690 statements. [2025-03-03 10:44:58,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:58,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:58,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1021 backedges. 465 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2025-03-03 10:44:58,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:58,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371442186] [2025-03-03 10:44:58,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371442186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:58,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:58,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:44:58,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571189015] [2025-03-03 10:44:58,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:58,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:58,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:58,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:58,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:58,659 INFO L87 Difference]: Start difference. First operand 89259 states and 92679 transitions. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)