./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label28.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label28.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 484926faa58a404dd95f955e93679d6ad13b338cc4627616c79e80f48803476c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:44:14,304 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:44:14,355 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:44:14,362 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:44:14,362 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:44:14,383 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:44:14,384 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:44:14,384 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:44:14,384 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:44:14,384 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:44:14,384 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:44:14,384 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:44:14,384 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:44:14,384 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:44:14,384 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:44:14,385 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:44:14,386 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:44:14,386 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:44:14,386 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:44:14,386 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:44:14,387 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:44:14,387 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:44:14,387 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:44:14,387 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:44:14,387 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:44:14,387 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:44:14,387 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:44:14,387 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:44:14,387 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:44:14,387 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:44:14,387 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:44:14,387 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:44:14,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:44:14,387 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:44:14,387 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:44:14,387 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:44:14,387 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:44:14,387 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:44:14,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:44:14,388 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:44:14,388 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:44:14,388 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:44:14,388 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:44:14,388 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-jdk21/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 -> 484926faa58a404dd95f955e93679d6ad13b338cc4627616c79e80f48803476c [2025-02-05 11:44:14,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:44:14,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:44:14,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:44:14,623 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:44:14,624 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:44:14,625 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label28.c [2025-02-05 11:44:15,788 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a233f8d7/dff01f6b081f476e968d33836b6bf158/FLAG4f25d86f5 [2025-02-05 11:44:16,153 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:44:16,154 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label28.c [2025-02-05 11:44:16,181 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a233f8d7/dff01f6b081f476e968d33836b6bf158/FLAG4f25d86f5 [2025-02-05 11:44:16,197 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a233f8d7/dff01f6b081f476e968d33836b6bf158 [2025-02-05 11:44:16,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:44:16,200 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:44:16,202 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:44:16,202 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:44:16,206 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:44:16,206 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:44:16" (1/1) ... [2025-02-05 11:44:16,207 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@adbaab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:16, skipping insertion in model container [2025-02-05 11:44:16,207 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:44:16" (1/1) ... [2025-02-05 11:44:16,280 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:44:16,460 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label28.c[2473,2486] [2025-02-05 11:44:17,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:44:17,060 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:44:17,073 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label28.c[2473,2486] [2025-02-05 11:44:17,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:44:17,380 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:44:17,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:17 WrapperNode [2025-02-05 11:44:17,382 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:44:17,383 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:44:17,383 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:44:17,383 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:44:17,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:17" (1/1) ... [2025-02-05 11:44:17,451 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:17" (1/1) ... [2025-02-05 11:44:17,835 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-02-05 11:44:17,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:44:17,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:44:17,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:44:17,837 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:44:17,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:17" (1/1) ... [2025-02-05 11:44:17,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:17" (1/1) ... [2025-02-05 11:44:17,915 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:17" (1/1) ... [2025-02-05 11:44:18,110 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-02-05 11:44:18,110 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:17" (1/1) ... [2025-02-05 11:44:18,111 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:17" (1/1) ... [2025-02-05 11:44:18,254 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:17" (1/1) ... [2025-02-05 11:44:18,271 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:17" (1/1) ... [2025-02-05 11:44:18,290 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:17" (1/1) ... [2025-02-05 11:44:18,310 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:17" (1/1) ... [2025-02-05 11:44:18,366 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:44:18,368 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:44:18,368 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:44:18,368 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:44:18,369 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:17" (1/1) ... [2025-02-05 11:44:18,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:44:18,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:44:18,393 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 11:44:18,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 11:44:18,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:44:18,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:44:18,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:44:18,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:44:18,464 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:44:18,466 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:44:22,749 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-02-05 11:44:22,749 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-02-05 11:44:22,749 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-02-05 11:44:22,971 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-02-05 11:44:22,971 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:44:23,003 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:44:23,006 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:44:23,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:44:23 BoogieIcfgContainer [2025-02-05 11:44:23,006 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:44:23,011 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:44:23,011 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:44:23,015 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:44:23,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:44:16" (1/3) ... [2025-02-05 11:44:23,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c4c107 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:44:23, skipping insertion in model container [2025-02-05 11:44:23,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:17" (2/3) ... [2025-02-05 11:44:23,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c4c107 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:44:23, skipping insertion in model container [2025-02-05 11:44:23,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:44:23" (3/3) ... [2025-02-05 11:44:23,019 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label28.c [2025-02-05 11:44:23,032 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:44:23,034 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label28.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:44:23,105 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:44:23,113 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;@5a2e175a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:44:23,115 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:44:23,122 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-02-05 11:44:23,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-05 11:44:23,127 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:23,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:44:23,127 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:23,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:23,132 INFO L85 PathProgramCache]: Analyzing trace with hash -2065475139, now seen corresponding path program 1 times [2025-02-05 11:44:23,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:23,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034912476] [2025-02-05 11:44:23,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:23,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:23,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-05 11:44:23,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-05 11:44:23,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:23,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:23,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:44:23,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:23,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034912476] [2025-02-05 11:44:23,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034912476] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:23,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:23,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:44:23,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913165012] [2025-02-05 11:44:23,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:23,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:23,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:23,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:23,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:23,349 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 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:27,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:27,141 INFO L93 Difference]: Finished difference Result 3082 states and 5686 transitions. [2025-02-05 11:44:27,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:27,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-05 11:44:27,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:27,161 INFO L225 Difference]: With dead ends: 3082 [2025-02-05 11:44:27,161 INFO L226 Difference]: Without dead ends: 1899 [2025-02-05 11:44:27,168 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-02-05 11:44:27,170 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 1024 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 2955 mSolverCounterSat, 599 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1024 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 3554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 599 IncrementalHoareTripleChecker+Valid, 2955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:27,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1024 Valid, 646 Invalid, 3554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [599 Valid, 2955 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-02-05 11:44:27,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2025-02-05 11:44:27,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1894. [2025-02-05 11:44:27,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1893 states have (on average 1.7374537770734284) internal successors, (3289), 1893 states have internal predecessors, (3289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:27,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 3289 transitions. [2025-02-05 11:44:27,280 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 3289 transitions. Word has length 15 [2025-02-05 11:44:27,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:27,280 INFO L471 AbstractCegarLoop]: Abstraction has 1894 states and 3289 transitions. [2025-02-05 11:44:27,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:27,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 3289 transitions. [2025-02-05 11:44:27,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 11:44:27,282 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:27,282 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 11:44:27,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:44:27,282 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:27,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:27,283 INFO L85 PathProgramCache]: Analyzing trace with hash -854281851, now seen corresponding path program 1 times [2025-02-05 11:44:27,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:27,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347504570] [2025-02-05 11:44:27,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:27,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:27,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 11:44:27,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 11:44:27,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:27,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:27,654 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:44:27,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:27,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347504570] [2025-02-05 11:44:27,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347504570] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:27,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:27,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:44:27,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915316418] [2025-02-05 11:44:27,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:27,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:27,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:27,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:27,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:27,658 INFO L87 Difference]: Start difference. First operand 1894 states and 3289 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:30,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:30,734 INFO L93 Difference]: Finished difference Result 5439 states and 9567 transitions. [2025-02-05 11:44:30,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:30,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-02-05 11:44:30,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:30,746 INFO L225 Difference]: With dead ends: 5439 [2025-02-05 11:44:30,746 INFO L226 Difference]: Without dead ends: 3547 [2025-02-05 11:44:30,749 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-02-05 11:44:30,749 INFO L435 NwaCegarLoop]: 746 mSDtfsCounter, 817 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 3128 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 3488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 3128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:30,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 882 Invalid, 3488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 3128 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-02-05 11:44:30,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3547 states. [2025-02-05 11:44:30,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3547 to 3484. [2025-02-05 11:44:30,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3484 states, 3483 states have (on average 1.5868504163077806) internal successors, (5527), 3483 states have internal predecessors, (5527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:30,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3484 states to 3484 states and 5527 transitions. [2025-02-05 11:44:30,808 INFO L78 Accepts]: Start accepts. Automaton has 3484 states and 5527 transitions. Word has length 80 [2025-02-05 11:44:30,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:30,808 INFO L471 AbstractCegarLoop]: Abstraction has 3484 states and 5527 transitions. [2025-02-05 11:44:30,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:30,808 INFO L276 IsEmpty]: Start isEmpty. Operand 3484 states and 5527 transitions. [2025-02-05 11:44:30,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 11:44:30,810 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:30,810 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 11:44:30,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:44:30,810 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:30,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:30,813 INFO L85 PathProgramCache]: Analyzing trace with hash 600327637, now seen corresponding path program 1 times [2025-02-05 11:44:30,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:30,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952925696] [2025-02-05 11:44:30,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:30,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:30,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 11:44:30,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 11:44:30,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:30,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:30,932 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:44:30,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:30,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952925696] [2025-02-05 11:44:30,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952925696] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:30,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:30,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:44:30,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273394374] [2025-02-05 11:44:30,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:30,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:30,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:30,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:30,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:30,935 INFO L87 Difference]: Start difference. First operand 3484 states and 5527 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-02-05 11:44:33,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:33,433 INFO L93 Difference]: Finished difference Result 10138 states and 16137 transitions. [2025-02-05 11:44:33,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:33,434 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-02-05 11:44:33,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:33,457 INFO L225 Difference]: With dead ends: 10138 [2025-02-05 11:44:33,458 INFO L226 Difference]: Without dead ends: 6656 [2025-02-05 11:44:33,465 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-02-05 11:44:33,467 INFO L435 NwaCegarLoop]: 983 mSDtfsCounter, 871 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 3256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:33,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 1136 Invalid, 3256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 11:44:33,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6656 states. [2025-02-05 11:44:33,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6656 to 6655. [2025-02-05 11:44:33,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6655 states, 6654 states have (on average 1.4174932371505862) internal successors, (9432), 6654 states have internal predecessors, (9432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:33,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6655 states to 6655 states and 9432 transitions. [2025-02-05 11:44:33,625 INFO L78 Accepts]: Start accepts. Automaton has 6655 states and 9432 transitions. Word has length 81 [2025-02-05 11:44:33,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:33,626 INFO L471 AbstractCegarLoop]: Abstraction has 6655 states and 9432 transitions. [2025-02-05 11:44:33,627 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-02-05 11:44:33,627 INFO L276 IsEmpty]: Start isEmpty. Operand 6655 states and 9432 transitions. [2025-02-05 11:44:33,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 11:44:33,628 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:33,628 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 11:44:33,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:44:33,628 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:33,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:33,631 INFO L85 PathProgramCache]: Analyzing trace with hash -898805937, now seen corresponding path program 1 times [2025-02-05 11:44:33,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:33,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735794152] [2025-02-05 11:44:33,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:33,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:33,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 11:44:33,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 11:44:33,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:33,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:33,744 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:44:33,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:33,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735794152] [2025-02-05 11:44:33,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735794152] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:33,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:33,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:44:33,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386904218] [2025-02-05 11:44:33,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:33,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:33,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:33,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:33,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:33,748 INFO L87 Difference]: Start difference. First operand 6655 states and 9432 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:36,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:36,635 INFO L93 Difference]: Finished difference Result 14120 states and 20675 transitions. [2025-02-05 11:44:36,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:36,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2025-02-05 11:44:36,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:36,655 INFO L225 Difference]: With dead ends: 14120 [2025-02-05 11:44:36,655 INFO L226 Difference]: Without dead ends: 7467 [2025-02-05 11:44:36,664 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-02-05 11:44:36,666 INFO L435 NwaCegarLoop]: 1043 mSDtfsCounter, 872 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2662 mSolverCounterSat, 719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 3381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 2662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:36,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 1176 Invalid, 3381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 2662 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-05 11:44:36,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7467 states. [2025-02-05 11:44:36,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7467 to 7456. [2025-02-05 11:44:36,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7456 states, 7455 states have (on average 1.3389671361502347) internal successors, (9982), 7455 states have internal predecessors, (9982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:36,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7456 states to 7456 states and 9982 transitions. [2025-02-05 11:44:36,771 INFO L78 Accepts]: Start accepts. Automaton has 7456 states and 9982 transitions. Word has length 84 [2025-02-05 11:44:36,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:36,772 INFO L471 AbstractCegarLoop]: Abstraction has 7456 states and 9982 transitions. [2025-02-05 11:44:36,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:36,772 INFO L276 IsEmpty]: Start isEmpty. Operand 7456 states and 9982 transitions. [2025-02-05 11:44:36,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 11:44:36,776 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:36,776 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 11:44:36,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:44:36,776 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:36,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:36,776 INFO L85 PathProgramCache]: Analyzing trace with hash 758143680, now seen corresponding path program 1 times [2025-02-05 11:44:36,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:36,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250174292] [2025-02-05 11:44:36,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:36,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:36,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 11:44:36,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 11:44:36,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:36,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:36,900 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:44:36,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:36,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250174292] [2025-02-05 11:44:36,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250174292] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:36,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:36,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:44:36,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734747021] [2025-02-05 11:44:36,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:36,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:36,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:36,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:36,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:36,901 INFO L87 Difference]: Start difference. First operand 7456 states and 9982 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:39,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:39,526 INFO L93 Difference]: Finished difference Result 19656 states and 27011 transitions. [2025-02-05 11:44:39,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:39,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2025-02-05 11:44:39,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:39,557 INFO L225 Difference]: With dead ends: 19656 [2025-02-05 11:44:39,557 INFO L226 Difference]: Without dead ends: 12989 [2025-02-05 11:44:39,567 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-02-05 11:44:39,567 INFO L435 NwaCegarLoop]: 1045 mSDtfsCounter, 857 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2509 mSolverCounterSat, 781 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 3290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 781 IncrementalHoareTripleChecker+Valid, 2509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:39,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 1196 Invalid, 3290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [781 Valid, 2509 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 11:44:39,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12989 states. [2025-02-05 11:44:39,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12989 to 12972. [2025-02-05 11:44:39,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12972 states, 12971 states have (on average 1.2362963534037468) internal successors, (16036), 12971 states have internal predecessors, (16036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:39,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12972 states to 12972 states and 16036 transitions. [2025-02-05 11:44:39,737 INFO L78 Accepts]: Start accepts. Automaton has 12972 states and 16036 transitions. Word has length 126 [2025-02-05 11:44:39,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:39,738 INFO L471 AbstractCegarLoop]: Abstraction has 12972 states and 16036 transitions. [2025-02-05 11:44:39,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:39,743 INFO L276 IsEmpty]: Start isEmpty. Operand 12972 states and 16036 transitions. [2025-02-05 11:44:39,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-02-05 11:44:39,744 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:39,745 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 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] [2025-02-05 11:44:39,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:44:39,745 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:39,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:39,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1085588568, now seen corresponding path program 1 times [2025-02-05 11:44:39,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:39,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172333888] [2025-02-05 11:44:39,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:39,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:39,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-02-05 11:44:39,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-02-05 11:44:39,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:39,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:40,081 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 11:44:40,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:40,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172333888] [2025-02-05 11:44:40,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172333888] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:40,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:40,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:44:40,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967297708] [2025-02-05 11:44:40,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:40,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:40,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:40,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:40,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:40,087 INFO L87 Difference]: Start difference. First operand 12972 states and 16036 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:42,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:42,257 INFO L93 Difference]: Finished difference Result 25155 states and 31273 transitions. [2025-02-05 11:44:42,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:42,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 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 220 [2025-02-05 11:44:42,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:42,282 INFO L225 Difference]: With dead ends: 25155 [2025-02-05 11:44:42,282 INFO L226 Difference]: Without dead ends: 12972 [2025-02-05 11:44:42,292 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-02-05 11:44:42,294 INFO L435 NwaCegarLoop]: 1084 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 2525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:42,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1213 Invalid, 2525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 11:44:42,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12972 states. [2025-02-05 11:44:42,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12972 to 12972. [2025-02-05 11:44:42,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12972 states, 12971 states have (on average 1.235910878112713) internal successors, (16031), 12971 states have internal predecessors, (16031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:42,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12972 states to 12972 states and 16031 transitions. [2025-02-05 11:44:42,451 INFO L78 Accepts]: Start accepts. Automaton has 12972 states and 16031 transitions. Word has length 220 [2025-02-05 11:44:42,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:42,452 INFO L471 AbstractCegarLoop]: Abstraction has 12972 states and 16031 transitions. [2025-02-05 11:44:42,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:42,453 INFO L276 IsEmpty]: Start isEmpty. Operand 12972 states and 16031 transitions. [2025-02-05 11:44:42,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-02-05 11:44:42,454 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:42,455 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-02-05 11:44:42,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:44:42,455 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:42,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:42,455 INFO L85 PathProgramCache]: Analyzing trace with hash -827020102, now seen corresponding path program 1 times [2025-02-05 11:44:42,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:42,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760893238] [2025-02-05 11:44:42,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:42,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:42,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-02-05 11:44:42,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-02-05 11:44:42,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:42,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:42,673 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:44:42,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:42,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760893238] [2025-02-05 11:44:42,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760893238] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:42,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:42,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:44:42,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374194217] [2025-02-05 11:44:42,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:42,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:42,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:42,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:42,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:42,675 INFO L87 Difference]: Start difference. First operand 12972 states and 16031 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:45,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:45,721 INFO L93 Difference]: Finished difference Result 31480 states and 39986 transitions. [2025-02-05 11:44:45,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:45,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 227 [2025-02-05 11:44:45,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:45,753 INFO L225 Difference]: With dead ends: 31480 [2025-02-05 11:44:45,753 INFO L226 Difference]: Without dead ends: 19297 [2025-02-05 11:44:45,765 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-02-05 11:44:45,766 INFO L435 NwaCegarLoop]: 1777 mSDtfsCounter, 774 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2547 mSolverCounterSat, 721 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 1920 SdHoareTripleChecker+Invalid, 3268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 721 IncrementalHoareTripleChecker+Valid, 2547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:45,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 1920 Invalid, 3268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [721 Valid, 2547 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-05 11:44:45,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19297 states. [2025-02-05 11:44:45,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19297 to 19273. [2025-02-05 11:44:45,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19273 states, 19272 states have (on average 1.1919883769198838) internal successors, (22972), 19272 states have internal predecessors, (22972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:45,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19273 states to 19273 states and 22972 transitions. [2025-02-05 11:44:45,950 INFO L78 Accepts]: Start accepts. Automaton has 19273 states and 22972 transitions. Word has length 227 [2025-02-05 11:44:45,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:45,951 INFO L471 AbstractCegarLoop]: Abstraction has 19273 states and 22972 transitions. [2025-02-05 11:44:45,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:45,951 INFO L276 IsEmpty]: Start isEmpty. Operand 19273 states and 22972 transitions. [2025-02-05 11:44:45,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-02-05 11:44:45,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:45,957 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 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-02-05 11:44:45,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:44:45,958 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:45,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:45,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1511116454, now seen corresponding path program 1 times [2025-02-05 11:44:45,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:45,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876368731] [2025-02-05 11:44:45,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:45,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:45,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-02-05 11:44:45,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-02-05 11:44:45,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:45,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:46,070 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:44:46,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:46,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876368731] [2025-02-05 11:44:46,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876368731] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:46,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:46,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:44:46,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396369485] [2025-02-05 11:44:46,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:46,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:46,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:46,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:46,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:46,071 INFO L87 Difference]: Start difference. First operand 19273 states and 22972 transitions. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:48,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:48,569 INFO L93 Difference]: Finished difference Result 53487 states and 64315 transitions. [2025-02-05 11:44:48,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:48,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 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 229 [2025-02-05 11:44:48,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:48,612 INFO L225 Difference]: With dead ends: 53487 [2025-02-05 11:44:48,612 INFO L226 Difference]: Without dead ends: 33425 [2025-02-05 11:44:48,627 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-02-05 11:44:48,628 INFO L435 NwaCegarLoop]: 1672 mSDtfsCounter, 953 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 2412 mSolverCounterSat, 813 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 1810 SdHoareTripleChecker+Invalid, 3225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 813 IncrementalHoareTripleChecker+Valid, 2412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:48,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [953 Valid, 1810 Invalid, 3225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [813 Valid, 2412 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 11:44:48,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33425 states. [2025-02-05 11:44:48,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33425 to 31844. [2025-02-05 11:44:48,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31844 states, 31843 states have (on average 1.1618252049115976) internal successors, (36996), 31843 states have internal predecessors, (36996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:48,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31844 states to 31844 states and 36996 transitions. [2025-02-05 11:44:48,934 INFO L78 Accepts]: Start accepts. Automaton has 31844 states and 36996 transitions. Word has length 229 [2025-02-05 11:44:48,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:48,934 INFO L471 AbstractCegarLoop]: Abstraction has 31844 states and 36996 transitions. [2025-02-05 11:44:48,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:48,937 INFO L276 IsEmpty]: Start isEmpty. Operand 31844 states and 36996 transitions. [2025-02-05 11:44:48,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-02-05 11:44:48,941 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:48,941 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:44:48,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:44:48,942 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:48,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:48,942 INFO L85 PathProgramCache]: Analyzing trace with hash -5089372, now seen corresponding path program 1 times [2025-02-05 11:44:48,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:48,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101310154] [2025-02-05 11:44:48,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:48,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:48,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-02-05 11:44:48,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-02-05 11:44:48,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:48,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:49,098 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-02-05 11:44:49,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:49,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101310154] [2025-02-05 11:44:49,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101310154] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:49,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:49,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:44:49,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108918944] [2025-02-05 11:44:49,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:49,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:49,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:49,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:49,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:49,100 INFO L87 Difference]: Start difference. First operand 31844 states and 36996 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:51,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:51,925 INFO L93 Difference]: Finished difference Result 74712 states and 88427 transitions. [2025-02-05 11:44:51,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:51,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 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 306 [2025-02-05 11:44:51,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:51,971 INFO L225 Difference]: With dead ends: 74712 [2025-02-05 11:44:51,972 INFO L226 Difference]: Without dead ends: 43657 [2025-02-05 11:44:51,988 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-02-05 11:44:51,989 INFO L435 NwaCegarLoop]: 1803 mSDtfsCounter, 849 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 2542 mSolverCounterSat, 721 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 3263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 721 IncrementalHoareTripleChecker+Valid, 2542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:51,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 1947 Invalid, 3263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [721 Valid, 2542 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 11:44:52,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43657 states. [2025-02-05 11:44:52,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43657 to 42866. [2025-02-05 11:44:52,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42866 states, 42865 states have (on average 1.1408375131225943) internal successors, (48902), 42865 states have internal predecessors, (48902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:52,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42866 states to 42866 states and 48902 transitions. [2025-02-05 11:44:52,405 INFO L78 Accepts]: Start accepts. Automaton has 42866 states and 48902 transitions. Word has length 306 [2025-02-05 11:44:52,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:52,406 INFO L471 AbstractCegarLoop]: Abstraction has 42866 states and 48902 transitions. [2025-02-05 11:44:52,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:52,406 INFO L276 IsEmpty]: Start isEmpty. Operand 42866 states and 48902 transitions. [2025-02-05 11:44:52,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-02-05 11:44:52,409 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:52,409 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-02-05 11:44:52,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:44:52,410 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:52,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:52,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1656992039, now seen corresponding path program 1 times [2025-02-05 11:44:52,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:52,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065696844] [2025-02-05 11:44:52,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:52,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:52,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-02-05 11:44:52,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-02-05 11:44:52,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:52,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:53,484 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 154 proven. 113 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 11:44:53,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:53,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065696844] [2025-02-05 11:44:53,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065696844] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:44:53,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104511499] [2025-02-05 11:44:53,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:53,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:44:53,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:44:53,488 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:44:53,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 11:44:53,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-02-05 11:44:53,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-02-05 11:44:53,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:53,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:53,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:44:53,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:44:53,710 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-02-05 11:44:53,712 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:44:53,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104511499] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:53,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:44:53,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-02-05 11:44:53,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14937152] [2025-02-05 11:44:53,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:53,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:53,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:53,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:53,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:44:53,714 INFO L87 Difference]: Start difference. First operand 42866 states and 48902 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:56,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:56,139 INFO L93 Difference]: Finished difference Result 84934 states and 97002 transitions. [2025-02-05 11:44:56,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:56,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 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 321 [2025-02-05 11:44:56,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:56,188 INFO L225 Difference]: With dead ends: 84934 [2025-02-05 11:44:56,188 INFO L226 Difference]: Without dead ends: 42857 [2025-02-05 11:44:56,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 320 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-02-05 11:44:56,211 INFO L435 NwaCegarLoop]: 678 mSDtfsCounter, 1076 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 2389 mSolverCounterSat, 526 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1076 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 2915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 526 IncrementalHoareTripleChecker+Valid, 2389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:56,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1076 Valid, 803 Invalid, 2915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [526 Valid, 2389 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 11:44:56,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42857 states. [2025-02-05 11:44:56,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42857 to 42856. [2025-02-05 11:44:56,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42856 states, 42855 states have (on average 1.1046318982615797) internal successors, (47339), 42855 states have internal predecessors, (47339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:56,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42856 states to 42856 states and 47339 transitions. [2025-02-05 11:44:56,653 INFO L78 Accepts]: Start accepts. Automaton has 42856 states and 47339 transitions. Word has length 321 [2025-02-05 11:44:56,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:56,654 INFO L471 AbstractCegarLoop]: Abstraction has 42856 states and 47339 transitions. [2025-02-05 11:44:56,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:56,654 INFO L276 IsEmpty]: Start isEmpty. Operand 42856 states and 47339 transitions. [2025-02-05 11:44:56,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-02-05 11:44:56,657 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:56,657 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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] [2025-02-05 11:44:56,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 11:44:56,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 11:44:56,858 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:56,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:56,858 INFO L85 PathProgramCache]: Analyzing trace with hash 466130122, now seen corresponding path program 1 times [2025-02-05 11:44:56,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:56,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630427235] [2025-02-05 11:44:56,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:56,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:56,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-02-05 11:44:56,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-02-05 11:44:56,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:56,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:57,178 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2025-02-05 11:44:57,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:57,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630427235] [2025-02-05 11:44:57,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630427235] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:57,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:57,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:44:57,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597528965] [2025-02-05 11:44:57,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:57,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:57,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:57,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:57,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:57,180 INFO L87 Difference]: Start difference. First operand 42856 states and 47339 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:59,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:59,725 INFO L93 Difference]: Finished difference Result 84921 states and 93883 transitions. [2025-02-05 11:44:59,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:59,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 340 [2025-02-05 11:44:59,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:59,763 INFO L225 Difference]: With dead ends: 84921 [2025-02-05 11:44:59,764 INFO L226 Difference]: Without dead ends: 42854 [2025-02-05 11:44:59,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-02-05 11:44:59,782 INFO L435 NwaCegarLoop]: 1342 mSDtfsCounter, 1187 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2451 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 1420 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:59,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 1420 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2451 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 11:44:59,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42854 states. [2025-02-05 11:45:00,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42854 to 42853. [2025-02-05 11:45:00,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42853 states, 42852 states have (on average 1.0796695603472417) internal successors, (46266), 42852 states have internal predecessors, (46266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:00,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42853 states to 42853 states and 46266 transitions. [2025-02-05 11:45:00,121 INFO L78 Accepts]: Start accepts. Automaton has 42853 states and 46266 transitions. Word has length 340 [2025-02-05 11:45:00,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:00,121 INFO L471 AbstractCegarLoop]: Abstraction has 42853 states and 46266 transitions. [2025-02-05 11:45:00,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:00,121 INFO L276 IsEmpty]: Start isEmpty. Operand 42853 states and 46266 transitions. [2025-02-05 11:45:00,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-02-05 11:45:00,125 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:00,125 INFO L218 NwaCegarLoop]: trace histogram [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, 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-02-05 11:45:00,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:45:00,125 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:00,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:00,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1574171960, now seen corresponding path program 1 times [2025-02-05 11:45:00,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:00,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649354840] [2025-02-05 11:45:00,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:00,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:00,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-02-05 11:45:00,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-02-05 11:45:00,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:00,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:00,280 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-02-05 11:45:00,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:00,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649354840] [2025-02-05 11:45:00,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649354840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:00,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:45:00,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:45:00,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916015467] [2025-02-05 11:45:00,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:00,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:45:00,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:00,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:45:00,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:45:00,283 INFO L87 Difference]: Start difference. First operand 42853 states and 46266 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-02-05 11:45:05,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:05,287 INFO L93 Difference]: Finished difference Result 147303 states and 159290 transitions. [2025-02-05 11:45:05,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:45:05,288 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 363 [2025-02-05 11:45:05,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:05,412 INFO L225 Difference]: With dead ends: 147303 [2025-02-05 11:45:05,412 INFO L226 Difference]: Without dead ends: 105239 [2025-02-05 11:45:05,452 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-02-05 11:45:05,452 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 1703 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 6594 mSolverCounterSat, 1029 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1703 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 7623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1029 IncrementalHoareTripleChecker+Valid, 6594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:05,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1703 Valid, 791 Invalid, 7623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1029 Valid, 6594 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-02-05 11:45:05,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105239 states. [2025-02-05 11:45:06,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105239 to 102743. [2025-02-05 11:45:06,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102743 states, 102742 states have (on average 1.0723559985205662) internal successors, (110176), 102742 states have internal predecessors, (110176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:06,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102743 states to 102743 states and 110176 transitions. [2025-02-05 11:45:06,432 INFO L78 Accepts]: Start accepts. Automaton has 102743 states and 110176 transitions. Word has length 363 [2025-02-05 11:45:06,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:06,432 INFO L471 AbstractCegarLoop]: Abstraction has 102743 states and 110176 transitions. [2025-02-05 11:45:06,432 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-02-05 11:45:06,432 INFO L276 IsEmpty]: Start isEmpty. Operand 102743 states and 110176 transitions. [2025-02-05 11:45:06,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-02-05 11:45:06,437 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:06,438 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:45:06,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:45:06,438 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:06,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:06,438 INFO L85 PathProgramCache]: Analyzing trace with hash -67268733, now seen corresponding path program 1 times [2025-02-05 11:45:06,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:06,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544520158] [2025-02-05 11:45:06,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:06,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:06,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-02-05 11:45:06,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-02-05 11:45:06,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:06,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:07,466 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 323 proven. 113 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-02-05 11:45:07,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:07,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544520158] [2025-02-05 11:45:07,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544520158] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:45:07,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106817594] [2025-02-05 11:45:07,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:07,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:45:07,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:45:07,469 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:45:07,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 11:45:07,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-02-05 11:45:07,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-02-05 11:45:07,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:07,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:07,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 11:45:07,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:45:08,162 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-02-05 11:45:08,162 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:45:08,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106817594] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:08,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:45:08,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2025-02-05 11:45:08,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377790285] [2025-02-05 11:45:08,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:08,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:45:08,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:08,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:45:08,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:45:08,164 INFO L87 Difference]: Start difference. First operand 102743 states and 110176 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:10,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:10,584 INFO L93 Difference]: Finished difference Result 197618 states and 212237 transitions. [2025-02-05 11:45:10,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:45:10,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 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 406 [2025-02-05 11:45:10,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:10,721 INFO L225 Difference]: With dead ends: 197618 [2025-02-05 11:45:10,721 INFO L226 Difference]: Without dead ends: 106689 [2025-02-05 11:45:10,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 405 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-02-05 11:45:10,772 INFO L435 NwaCegarLoop]: 1026 mSDtfsCounter, 683 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 2456 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 2568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:10,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 1160 Invalid, 2568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2456 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 11:45:10,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106689 states. [2025-02-05 11:45:11,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106689 to 105105. [2025-02-05 11:45:11,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105105 states, 105104 states have (on average 1.0656016897549094) internal successors, (111999), 105104 states have internal predecessors, (111999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:11,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105105 states to 105105 states and 111999 transitions. [2025-02-05 11:45:11,669 INFO L78 Accepts]: Start accepts. Automaton has 105105 states and 111999 transitions. Word has length 406 [2025-02-05 11:45:11,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:11,669 INFO L471 AbstractCegarLoop]: Abstraction has 105105 states and 111999 transitions. [2025-02-05 11:45:11,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:11,669 INFO L276 IsEmpty]: Start isEmpty. Operand 105105 states and 111999 transitions. [2025-02-05 11:45:11,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2025-02-05 11:45:11,674 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:11,675 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-02-05 11:45:11,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 11:45:11,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:45:11,875 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:11,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:11,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1495265370, now seen corresponding path program 1 times [2025-02-05 11:45:11,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:11,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596285232] [2025-02-05 11:45:11,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:11,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:11,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-02-05 11:45:11,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-02-05 11:45:11,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:11,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:12,011 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 667 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2025-02-05 11:45:12,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:12,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596285232] [2025-02-05 11:45:12,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596285232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:12,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:45:12,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:45:12,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41376937] [2025-02-05 11:45:12,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:12,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:45:12,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:12,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:45:12,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:45:12,012 INFO L87 Difference]: Start difference. First operand 105105 states and 111999 transitions. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:14,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:14,651 INFO L93 Difference]: Finished difference Result 208632 states and 222344 transitions. [2025-02-05 11:45:14,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:45:14,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 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 452 [2025-02-05 11:45:14,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:14,769 INFO L225 Difference]: With dead ends: 208632 [2025-02-05 11:45:14,769 INFO L226 Difference]: Without dead ends: 104316 [2025-02-05 11:45:14,815 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-02-05 11:45:14,815 INFO L435 NwaCegarLoop]: 1346 mSDtfsCounter, 938 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 2391 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 2975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 2391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:14,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 1429 Invalid, 2975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 2391 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 11:45:14,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104316 states. [2025-02-05 11:45:15,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104316 to 103515. [2025-02-05 11:45:15,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103515 states, 103514 states have (on average 1.054978070599146) internal successors, (109205), 103514 states have internal predecessors, (109205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:16,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103515 states to 103515 states and 109205 transitions. [2025-02-05 11:45:16,023 INFO L78 Accepts]: Start accepts. Automaton has 103515 states and 109205 transitions. Word has length 452 [2025-02-05 11:45:16,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:16,024 INFO L471 AbstractCegarLoop]: Abstraction has 103515 states and 109205 transitions. [2025-02-05 11:45:16,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:16,024 INFO L276 IsEmpty]: Start isEmpty. Operand 103515 states and 109205 transitions. [2025-02-05 11:45:16,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-02-05 11:45:16,032 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:16,032 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-02-05 11:45:16,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 11:45:16,032 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:16,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:16,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1688222516, now seen corresponding path program 1 times [2025-02-05 11:45:16,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:16,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642671818] [2025-02-05 11:45:16,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:16,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:16,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-02-05 11:45:16,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-02-05 11:45:16,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:16,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:16,476 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 670 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2025-02-05 11:45:16,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:16,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642671818] [2025-02-05 11:45:16,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642671818] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:16,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:45:16,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:45:16,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886772917] [2025-02-05 11:45:16,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:16,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:45:16,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:16,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:45:16,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:45:16,477 INFO L87 Difference]: Start difference. First operand 103515 states and 109205 transitions. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:19,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:19,107 INFO L93 Difference]: Finished difference Result 231438 states and 245288 transitions. [2025-02-05 11:45:19,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:45:19,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 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 466 [2025-02-05 11:45:19,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:19,253 INFO L225 Difference]: With dead ends: 231438 [2025-02-05 11:45:19,254 INFO L226 Difference]: Without dead ends: 127133 [2025-02-05 11:45:19,316 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-02-05 11:45:19,317 INFO L435 NwaCegarLoop]: 1700 mSDtfsCounter, 763 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2487 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 1837 SdHoareTripleChecker+Invalid, 2907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 2487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:19,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 1837 Invalid, 2907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 2487 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 11:45:19,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127133 states. [2025-02-05 11:45:20,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127133 to 125533. [2025-02-05 11:45:20,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125533 states, 125532 states have (on average 1.0512618296529967) internal successors, (131967), 125532 states have internal predecessors, (131967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:20,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125533 states to 125533 states and 131967 transitions. [2025-02-05 11:45:20,783 INFO L78 Accepts]: Start accepts. Automaton has 125533 states and 131967 transitions. Word has length 466 [2025-02-05 11:45:20,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:20,784 INFO L471 AbstractCegarLoop]: Abstraction has 125533 states and 131967 transitions. [2025-02-05 11:45:20,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:20,784 INFO L276 IsEmpty]: Start isEmpty. Operand 125533 states and 131967 transitions. [2025-02-05 11:45:20,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2025-02-05 11:45:20,792 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:20,792 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-02-05 11:45:20,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 11:45:20,792 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:20,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:20,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1502700942, now seen corresponding path program 1 times [2025-02-05 11:45:20,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:20,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227432985] [2025-02-05 11:45:20,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:20,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:20,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 493 statements into 1 equivalence classes. [2025-02-05 11:45:20,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 493 of 493 statements. [2025-02-05 11:45:20,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:20,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:21,035 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2025-02-05 11:45:21,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:21,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227432985] [2025-02-05 11:45:21,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227432985] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:21,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:45:21,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:45:21,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927261271] [2025-02-05 11:45:21,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:21,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:45:21,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:21,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:45:21,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:45:21,037 INFO L87 Difference]: Start difference. First operand 125533 states and 131967 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 2 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:22,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:22,930 INFO L93 Difference]: Finished difference Result 234516 states and 247007 transitions. [2025-02-05 11:45:22,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:45:22,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 2 states have internal predecessors, (216), 0 states have call successors, (0), 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 493 [2025-02-05 11:45:22,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:23,265 INFO L225 Difference]: With dead ends: 234516 [2025-02-05 11:45:23,266 INFO L226 Difference]: Without dead ends: 124731 [2025-02-05 11:45:23,307 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-02-05 11:45:23,312 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 1595 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1595 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:23,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1595 Valid, 289 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1453 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 11:45:23,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124731 states. [2025-02-05 11:45:24,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124731 to 124730. [2025-02-05 11:45:24,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124730 states, 124729 states have (on average 1.0511749472857155) internal successors, (131112), 124729 states have internal predecessors, (131112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:24,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124730 states to 124730 states and 131112 transitions. [2025-02-05 11:45:24,332 INFO L78 Accepts]: Start accepts. Automaton has 124730 states and 131112 transitions. Word has length 493 [2025-02-05 11:45:24,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:24,332 INFO L471 AbstractCegarLoop]: Abstraction has 124730 states and 131112 transitions. [2025-02-05 11:45:24,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 2 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:24,332 INFO L276 IsEmpty]: Start isEmpty. Operand 124730 states and 131112 transitions. [2025-02-05 11:45:24,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2025-02-05 11:45:24,338 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:24,338 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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] [2025-02-05 11:45:24,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 11:45:24,338 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:24,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:24,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1396588940, now seen corresponding path program 1 times [2025-02-05 11:45:24,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:24,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235329996] [2025-02-05 11:45:24,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:24,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:24,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 495 statements into 1 equivalence classes. [2025-02-05 11:45:24,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 495 of 495 statements. [2025-02-05 11:45:24,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:24,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:24,811 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 364 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-02-05 11:45:24,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:24,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235329996] [2025-02-05 11:45:24,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235329996] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:24,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:45:24,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:45:24,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504648162] [2025-02-05 11:45:24,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:24,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:45:24,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:24,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:45:24,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:45:24,813 INFO L87 Difference]: Start difference. First operand 124730 states and 131112 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:27,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:27,411 INFO L93 Difference]: Finished difference Result 250262 states and 263041 transitions. [2025-02-05 11:45:27,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:45:27,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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 495 [2025-02-05 11:45:27,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:27,574 INFO L225 Difference]: With dead ends: 250262 [2025-02-05 11:45:27,574 INFO L226 Difference]: Without dead ends: 124747 [2025-02-05 11:45:27,650 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-02-05 11:45:27,651 INFO L435 NwaCegarLoop]: 1636 mSDtfsCounter, 704 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2416 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 1772 SdHoareTripleChecker+Invalid, 2816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 2416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:27,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 1772 Invalid, 2816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 2416 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 11:45:27,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124747 states. [2025-02-05 11:45:29,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124747 to 123155. [2025-02-05 11:45:29,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123155 states, 123154 states have (on average 1.037538366597918) internal successors, (127777), 123154 states have internal predecessors, (127777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:29,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123155 states to 123155 states and 127777 transitions. [2025-02-05 11:45:29,243 INFO L78 Accepts]: Start accepts. Automaton has 123155 states and 127777 transitions. Word has length 495 [2025-02-05 11:45:29,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:29,243 INFO L471 AbstractCegarLoop]: Abstraction has 123155 states and 127777 transitions. [2025-02-05 11:45:29,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:29,244 INFO L276 IsEmpty]: Start isEmpty. Operand 123155 states and 127777 transitions. [2025-02-05 11:45:29,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2025-02-05 11:45:29,249 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:29,249 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 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] [2025-02-05 11:45:29,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 11:45:29,249 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:29,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:29,250 INFO L85 PathProgramCache]: Analyzing trace with hash 996618975, now seen corresponding path program 1 times [2025-02-05 11:45:29,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:29,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596596124] [2025-02-05 11:45:29,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:29,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:29,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-02-05 11:45:29,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-02-05 11:45:29,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:29,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:29,483 INFO L134 CoverageAnalysis]: Checked inductivity of 821 backedges. 575 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2025-02-05 11:45:29,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:29,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596596124] [2025-02-05 11:45:29,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596596124] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:29,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:45:29,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:45:29,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227724676] [2025-02-05 11:45:29,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:29,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:45:29,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:29,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:45:29,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:45:29,484 INFO L87 Difference]: Start difference. First operand 123155 states and 127777 transitions. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:32,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:32,731 INFO L93 Difference]: Finished difference Result 280176 states and 291570 transitions. [2025-02-05 11:45:32,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:45:32,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 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 504 [2025-02-05 11:45:32,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:32,952 INFO L225 Difference]: With dead ends: 280176 [2025-02-05 11:45:32,953 INFO L226 Difference]: Without dead ends: 172769 [2025-02-05 11:45:33,019 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-02-05 11:45:33,020 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 1003 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2398 mSolverCounterSat, 866 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1003 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 3264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 866 IncrementalHoareTripleChecker+Valid, 2398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:33,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1003 Valid, 599 Invalid, 3264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [866 Valid, 2398 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 11:45:33,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172769 states. [2025-02-05 11:45:34,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172769 to 171978. [2025-02-05 11:45:34,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171978 states, 171977 states have (on average 1.0360571471766573) internal successors, (178178), 171977 states have internal predecessors, (178178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:34,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171978 states to 171978 states and 178178 transitions. [2025-02-05 11:45:34,792 INFO L78 Accepts]: Start accepts. Automaton has 171978 states and 178178 transitions. Word has length 504 [2025-02-05 11:45:34,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:34,792 INFO L471 AbstractCegarLoop]: Abstraction has 171978 states and 178178 transitions. [2025-02-05 11:45:34,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:34,792 INFO L276 IsEmpty]: Start isEmpty. Operand 171978 states and 178178 transitions. [2025-02-05 11:45:34,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2025-02-05 11:45:34,797 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:34,797 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:45:34,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 11:45:34,797 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:34,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:34,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1592121437, now seen corresponding path program 1 times [2025-02-05 11:45:34,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:34,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026160227] [2025-02-05 11:45:34,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:34,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:34,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 507 statements into 1 equivalence classes. [2025-02-05 11:45:35,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 507 of 507 statements. [2025-02-05 11:45:35,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:35,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:35,506 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2025-02-05 11:45:35,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:35,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026160227] [2025-02-05 11:45:35,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026160227] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:35,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:45:35,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:45:35,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506818471] [2025-02-05 11:45:35,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:35,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:45:35,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:35,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:45:35,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:45:35,507 INFO L87 Difference]: Start difference. First operand 171978 states and 178178 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)