./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label31.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/Problem17_label31.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 af3862af5b8a27b2989fe566f1104f15a4544b51e9167db28055ff534e84b220 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 12:04:02,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 12:04:02,659 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 12:04:02,666 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 12:04:02,671 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 12:04:02,702 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 12:04:02,703 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 12:04:02,703 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 12:04:02,703 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 12:04:02,704 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 12:04:02,705 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 12:04:02,705 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 12:04:02,705 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 12:04:02,706 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 12:04:02,706 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 12:04:02,706 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 12:04:02,706 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 12:04:02,706 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 12:04:02,706 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 12:04:02,706 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 12:04:02,706 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 12:04:02,706 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 12:04:02,706 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 12:04:02,706 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 12:04:02,706 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 12:04:02,706 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 12:04:02,706 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 12:04:02,706 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 12:04:02,706 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 12:04:02,706 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 12:04:02,707 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 12:04:02,707 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 12:04:02,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:04:02,707 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 12:04:02,707 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 12:04:02,707 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 12:04:02,707 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 12:04:02,707 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 12:04:02,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 12:04:02,707 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 12:04:02,707 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 12:04:02,707 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 12:04:02,707 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 12:04:02,707 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 -> af3862af5b8a27b2989fe566f1104f15a4544b51e9167db28055ff534e84b220 [2025-02-05 12:04:02,984 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 12:04:02,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 12:04:02,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 12:04:02,995 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 12:04:02,996 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 12:04:02,997 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label31.c [2025-02-05 12:04:04,354 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5f02eb44e/8d09a50047de45ac828d46a69b83de3f/FLAG002188608 [2025-02-05 12:04:04,863 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 12:04:04,864 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label31.c [2025-02-05 12:04:04,888 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5f02eb44e/8d09a50047de45ac828d46a69b83de3f/FLAG002188608 [2025-02-05 12:04:04,904 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5f02eb44e/8d09a50047de45ac828d46a69b83de3f [2025-02-05 12:04:04,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 12:04:04,908 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 12:04:04,909 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 12:04:04,909 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 12:04:04,913 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 12:04:04,914 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:04:04" (1/1) ... [2025-02-05 12:04:04,915 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a8be720 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:04, skipping insertion in model container [2025-02-05 12:04:04,915 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:04:04" (1/1) ... [2025-02-05 12:04:04,964 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 12:04:05,109 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/Problem17_label31.c[1403,1416] [2025-02-05 12:04:05,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:04:05,632 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 12:04:05,645 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/Problem17_label31.c[1403,1416] [2025-02-05 12:04:05,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:04:05,995 INFO L204 MainTranslator]: Completed translation [2025-02-05 12:04:05,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:05 WrapperNode [2025-02-05 12:04:05,997 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 12:04:05,998 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 12:04:05,998 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 12:04:05,998 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 12:04:06,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:05" (1/1) ... [2025-02-05 12:04:06,064 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:05" (1/1) ... [2025-02-05 12:04:06,376 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-02-05 12:04:06,377 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 12:04:06,377 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 12:04:06,377 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 12:04:06,377 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 12:04:06,392 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:05" (1/1) ... [2025-02-05 12:04:06,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:05" (1/1) ... [2025-02-05 12:04:06,562 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:05" (1/1) ... [2025-02-05 12:04:06,698 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 12:04:06,699 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:05" (1/1) ... [2025-02-05 12:04:06,699 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:05" (1/1) ... [2025-02-05 12:04:06,820 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:05" (1/1) ... [2025-02-05 12:04:06,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:05" (1/1) ... [2025-02-05 12:04:06,868 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:05" (1/1) ... [2025-02-05 12:04:06,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:05" (1/1) ... [2025-02-05 12:04:06,930 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 12:04:06,932 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 12:04:06,932 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 12:04:06,933 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 12:04:06,934 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:05" (1/1) ... [2025-02-05 12:04:06,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:04:06,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:04:06,977 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 12:04:06,994 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 12:04:07,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 12:04:07,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 12:04:07,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 12:04:07,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 12:04:07,100 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 12:04:07,102 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 12:04:10,221 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-02-05 12:04:10,411 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-02-05 12:04:10,412 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 12:04:10,451 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 12:04:10,456 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 12:04:10,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:04:10 BoogieIcfgContainer [2025-02-05 12:04:10,457 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 12:04:10,462 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 12:04:10,462 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 12:04:10,468 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 12:04:10,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:04:04" (1/3) ... [2025-02-05 12:04:10,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d107b13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:04:10, skipping insertion in model container [2025-02-05 12:04:10,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:05" (2/3) ... [2025-02-05 12:04:10,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d107b13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:04:10, skipping insertion in model container [2025-02-05 12:04:10,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:04:10" (3/3) ... [2025-02-05 12:04:10,472 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label31.c [2025-02-05 12:04:10,486 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 12:04:10,487 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label31.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 12:04:10,528 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 12:04:10,536 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;@1b53f71b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 12:04:10,536 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 12:04:10,540 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 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 12:04:10,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 12:04:10,543 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:10,544 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:04:10,544 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:10,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:10,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1457577979, now seen corresponding path program 1 times [2025-02-05 12:04:10,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:10,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045411651] [2025-02-05 12:04:10,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:10,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:10,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 12:04:10,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 12:04:10,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:10,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:10,698 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 12:04:10,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:10,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045411651] [2025-02-05 12:04:10,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045411651] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:10,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:10,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:04:10,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061289209] [2025-02-05 12:04:10,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:10,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:10,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:10,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:10,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:10,733 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 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 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:04:13,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:13,324 INFO L93 Difference]: Finished difference Result 1644 states and 3026 transitions. [2025-02-05 12:04:13,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:13,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-05 12:04:13,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:13,340 INFO L225 Difference]: With dead ends: 1644 [2025-02-05 12:04:13,340 INFO L226 Difference]: Without dead ends: 977 [2025-02-05 12:04:13,347 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 12:04:13,354 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 480 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:13,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 503 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 12:04:13,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-02-05 12:04:13,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 971. [2025-02-05 12:04:13,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5536082474226804) internal successors, (1507), 970 states have internal predecessors, (1507), 0 states have call successors, (0), 0 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 12:04:13,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1507 transitions. [2025-02-05 12:04:13,444 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1507 transitions. Word has length 8 [2025-02-05 12:04:13,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:13,449 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1507 transitions. [2025-02-05 12:04:13,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:04:13,449 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1507 transitions. [2025-02-05 12:04:13,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 12:04:13,451 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:13,451 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 12:04:13,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 12:04:13,451 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:13,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:13,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1617697405, now seen corresponding path program 1 times [2025-02-05 12:04:13,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:13,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226861650] [2025-02-05 12:04:13,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:13,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:13,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 12:04:13,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 12:04:13,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:13,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:13,766 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:04:13,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:13,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226861650] [2025-02-05 12:04:13,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226861650] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:13,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:13,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:04:13,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521311279] [2025-02-05 12:04:13,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:13,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:13,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:13,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:13,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:13,774 INFO L87 Difference]: Start difference. First operand 971 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:04:16,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:16,150 INFO L93 Difference]: Finished difference Result 2813 states and 4381 transitions. [2025-02-05 12:04:16,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:16,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-02-05 12:04:16,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:16,158 INFO L225 Difference]: With dead ends: 2813 [2025-02-05 12:04:16,158 INFO L226 Difference]: Without dead ends: 1844 [2025-02-05 12:04:16,160 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 12:04:16,161 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 405 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:16,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 580 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 12:04:16,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-02-05 12:04:16,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1841. [2025-02-05 12:04:16,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1840 states have (on average 1.35) internal successors, (2484), 1840 states have internal predecessors, (2484), 0 states have call successors, (0), 0 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 12:04:16,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2484 transitions. [2025-02-05 12:04:16,207 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2484 transitions. Word has length 75 [2025-02-05 12:04:16,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:16,207 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2484 transitions. [2025-02-05 12:04:16,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:04:16,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2484 transitions. [2025-02-05 12:04:16,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 12:04:16,209 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:16,209 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 12:04:16,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 12:04:16,210 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:16,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:16,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1235128227, now seen corresponding path program 1 times [2025-02-05 12:04:16,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:16,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345821940] [2025-02-05 12:04:16,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:16,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:16,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 12:04:16,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 12:04:16,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:16,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:16,402 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:04:16,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:16,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345821940] [2025-02-05 12:04:16,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345821940] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:16,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:16,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:16,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511924251] [2025-02-05 12:04:16,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:16,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:04:16,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:16,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:04:16,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:04:16,406 INFO L87 Difference]: Start difference. First operand 1841 states and 2484 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 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 12:04:20,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:20,459 INFO L93 Difference]: Finished difference Result 5863 states and 8156 transitions. [2025-02-05 12:04:20,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:04:20,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-02-05 12:04:20,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:20,473 INFO L225 Difference]: With dead ends: 5863 [2025-02-05 12:04:20,474 INFO L226 Difference]: Without dead ends: 4024 [2025-02-05 12:04:20,476 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 12:04:20,477 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 972 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2906 mSolverCounterSat, 697 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 3603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 697 IncrementalHoareTripleChecker+Valid, 2906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:20,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 437 Invalid, 3603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [697 Valid, 2906 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-02-05 12:04:20,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2025-02-05 12:04:20,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 4020. [2025-02-05 12:04:20,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4020 states, 4019 states have (on average 1.3262005473998506) internal successors, (5330), 4019 states have internal predecessors, (5330), 0 states have call successors, (0), 0 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 12:04:20,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4020 states to 4020 states and 5330 transitions. [2025-02-05 12:04:20,569 INFO L78 Accepts]: Start accepts. Automaton has 4020 states and 5330 transitions. Word has length 78 [2025-02-05 12:04:20,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:20,569 INFO L471 AbstractCegarLoop]: Abstraction has 4020 states and 5330 transitions. [2025-02-05 12:04:20,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 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 12:04:20,569 INFO L276 IsEmpty]: Start isEmpty. Operand 4020 states and 5330 transitions. [2025-02-05 12:04:20,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 12:04:20,571 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:20,571 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:04:20,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 12:04:20,572 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:20,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:20,572 INFO L85 PathProgramCache]: Analyzing trace with hash -275490374, now seen corresponding path program 1 times [2025-02-05 12:04:20,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:20,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464573327] [2025-02-05 12:04:20,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:20,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:20,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 12:04:20,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 12:04:20,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:20,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:20,915 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-05 12:04:20,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:20,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464573327] [2025-02-05 12:04:20,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464573327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:20,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:20,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:04:20,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209244461] [2025-02-05 12:04:20,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:20,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:20,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:20,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:20,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:20,916 INFO L87 Difference]: Start difference. First operand 4020 states and 5330 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 12:04:23,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:23,005 INFO L93 Difference]: Finished difference Result 10602 states and 14364 transitions. [2025-02-05 12:04:23,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:23,006 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 143 [2025-02-05 12:04:23,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:23,028 INFO L225 Difference]: With dead ends: 10602 [2025-02-05 12:04:23,028 INFO L226 Difference]: Without dead ends: 6580 [2025-02-05 12:04:23,034 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 12:04:23,036 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:23,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 12:04:23,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6580 states. [2025-02-05 12:04:23,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6580 to 5305. [2025-02-05 12:04:23,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5305 states, 5304 states have (on average 1.2268099547511313) internal successors, (6507), 5304 states have internal predecessors, (6507), 0 states have call successors, (0), 0 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 12:04:23,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5305 states to 5305 states and 6507 transitions. [2025-02-05 12:04:23,146 INFO L78 Accepts]: Start accepts. Automaton has 5305 states and 6507 transitions. Word has length 143 [2025-02-05 12:04:23,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:23,146 INFO L471 AbstractCegarLoop]: Abstraction has 5305 states and 6507 transitions. [2025-02-05 12:04:23,146 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 12:04:23,147 INFO L276 IsEmpty]: Start isEmpty. Operand 5305 states and 6507 transitions. [2025-02-05 12:04:23,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 12:04:23,152 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:23,152 INFO L218 NwaCegarLoop]: trace histogram [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, 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 12:04:23,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 12:04:23,153 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:23,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:23,153 INFO L85 PathProgramCache]: Analyzing trace with hash 806657706, now seen corresponding path program 1 times [2025-02-05 12:04:23,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:23,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2678473] [2025-02-05 12:04:23,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:23,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:23,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 12:04:23,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 12:04:23,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:23,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:23,365 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:04:23,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:23,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2678473] [2025-02-05 12:04:23,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2678473] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:23,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:23,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:23,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108474117] [2025-02-05 12:04:23,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:23,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:23,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:23,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:23,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:23,368 INFO L87 Difference]: Start difference. First operand 5305 states and 6507 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 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 12:04:25,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:25,082 INFO L93 Difference]: Finished difference Result 13165 states and 16536 transitions. [2025-02-05 12:04:25,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:25,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2025-02-05 12:04:25,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:25,101 INFO L225 Difference]: With dead ends: 13165 [2025-02-05 12:04:25,101 INFO L226 Difference]: Without dead ends: 7862 [2025-02-05 12:04:25,113 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 12:04:25,114 INFO L435 NwaCegarLoop]: 751 mSDtfsCounter, 500 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 1600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:25,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 808 Invalid, 1600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 12:04:25,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7862 states. [2025-02-05 12:04:25,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7862 to 7862. [2025-02-05 12:04:25,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7862 states, 7861 states have (on average 1.2101513802315227) internal successors, (9513), 7861 states have internal predecessors, (9513), 0 states have call successors, (0), 0 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 12:04:25,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7862 states to 7862 states and 9513 transitions. [2025-02-05 12:04:25,267 INFO L78 Accepts]: Start accepts. Automaton has 7862 states and 9513 transitions. Word has length 156 [2025-02-05 12:04:25,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:25,269 INFO L471 AbstractCegarLoop]: Abstraction has 7862 states and 9513 transitions. [2025-02-05 12:04:25,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 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 12:04:25,269 INFO L276 IsEmpty]: Start isEmpty. Operand 7862 states and 9513 transitions. [2025-02-05 12:04:25,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-02-05 12:04:25,272 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:25,272 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 12:04:25,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 12:04:25,272 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:25,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:25,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1672746228, now seen corresponding path program 1 times [2025-02-05 12:04:25,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:25,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610851968] [2025-02-05 12:04:25,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:25,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:25,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-02-05 12:04:25,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-02-05 12:04:25,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:25,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:25,496 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2025-02-05 12:04:25,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:25,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610851968] [2025-02-05 12:04:25,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610851968] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:25,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:25,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:25,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724974695] [2025-02-05 12:04:25,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:25,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:25,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:25,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:25,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:25,497 INFO L87 Difference]: Start difference. First operand 7862 states and 9513 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 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 12:04:27,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:27,262 INFO L93 Difference]: Finished difference Result 19110 states and 23099 transitions. [2025-02-05 12:04:27,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:27,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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 261 [2025-02-05 12:04:27,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:27,300 INFO L225 Difference]: With dead ends: 19110 [2025-02-05 12:04:27,300 INFO L226 Difference]: Without dead ends: 10400 [2025-02-05 12:04:27,309 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 12:04:27,310 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 436 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 1620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:27,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 952 Invalid, 1620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 12:04:27,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10400 states. [2025-02-05 12:04:27,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10400 to 7415. [2025-02-05 12:04:27,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7415 states, 7414 states have (on average 1.1657674669544105) internal successors, (8643), 7414 states have internal predecessors, (8643), 0 states have call successors, (0), 0 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 12:04:27,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7415 states to 7415 states and 8643 transitions. [2025-02-05 12:04:27,433 INFO L78 Accepts]: Start accepts. Automaton has 7415 states and 8643 transitions. Word has length 261 [2025-02-05 12:04:27,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:27,434 INFO L471 AbstractCegarLoop]: Abstraction has 7415 states and 8643 transitions. [2025-02-05 12:04:27,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 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 12:04:27,439 INFO L276 IsEmpty]: Start isEmpty. Operand 7415 states and 8643 transitions. [2025-02-05 12:04:27,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-02-05 12:04:27,445 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:27,446 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 12:04:27,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 12:04:27,446 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:27,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:27,447 INFO L85 PathProgramCache]: Analyzing trace with hash -644888150, now seen corresponding path program 1 times [2025-02-05 12:04:27,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:27,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449970046] [2025-02-05 12:04:27,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:27,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:27,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-02-05 12:04:27,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-02-05 12:04:27,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:27,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:27,681 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2025-02-05 12:04:27,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:27,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449970046] [2025-02-05 12:04:27,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449970046] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:27,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:27,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:27,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721130875] [2025-02-05 12:04:27,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:27,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:27,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:27,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:27,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:27,684 INFO L87 Difference]: Start difference. First operand 7415 states and 8643 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 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 12:04:29,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:29,240 INFO L93 Difference]: Finished difference Result 18651 states and 21996 transitions. [2025-02-05 12:04:29,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:29,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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 265 [2025-02-05 12:04:29,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:29,273 INFO L225 Difference]: With dead ends: 18651 [2025-02-05 12:04:29,273 INFO L226 Difference]: Without dead ends: 11237 [2025-02-05 12:04:29,329 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 12:04:29,331 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 452 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:29,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 426 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 1217 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:04:29,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11237 states. [2025-02-05 12:04:29,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11237 to 8667. [2025-02-05 12:04:29,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8667 states, 8666 states have (on average 1.1520886222017077) internal successors, (9984), 8666 states have internal predecessors, (9984), 0 states have call successors, (0), 0 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 12:04:29,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8667 states to 8667 states and 9984 transitions. [2025-02-05 12:04:29,429 INFO L78 Accepts]: Start accepts. Automaton has 8667 states and 9984 transitions. Word has length 265 [2025-02-05 12:04:29,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:29,430 INFO L471 AbstractCegarLoop]: Abstraction has 8667 states and 9984 transitions. [2025-02-05 12:04:29,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 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 12:04:29,430 INFO L276 IsEmpty]: Start isEmpty. Operand 8667 states and 9984 transitions. [2025-02-05 12:04:29,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-02-05 12:04:29,437 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:29,438 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 12:04:29,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 12:04:29,439 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:29,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:29,440 INFO L85 PathProgramCache]: Analyzing trace with hash 956939334, now seen corresponding path program 1 times [2025-02-05 12:04:29,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:29,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938394743] [2025-02-05 12:04:29,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:29,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:29,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-02-05 12:04:29,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-02-05 12:04:29,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:29,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:29,592 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-02-05 12:04:29,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:29,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938394743] [2025-02-05 12:04:29,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938394743] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:29,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:29,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:29,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426983676] [2025-02-05 12:04:29,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:29,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:29,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:29,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:29,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:29,594 INFO L87 Difference]: Start difference. First operand 8667 states and 9984 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 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 12:04:31,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:31,625 INFO L93 Difference]: Finished difference Result 22011 states and 25365 transitions. [2025-02-05 12:04:31,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:31,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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 278 [2025-02-05 12:04:31,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:31,644 INFO L225 Difference]: With dead ends: 22011 [2025-02-05 12:04:31,645 INFO L226 Difference]: Without dead ends: 13346 [2025-02-05 12:04:31,653 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 12:04:31,654 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 484 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:31,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 396 Invalid, 1550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 1261 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 12:04:31,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13346 states. [2025-02-05 12:04:31,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13346 to 11642. [2025-02-05 12:04:31,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11642 states, 11641 states have (on average 1.1441456919508632) internal successors, (13319), 11641 states have internal predecessors, (13319), 0 states have call successors, (0), 0 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 12:04:31,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11642 states to 11642 states and 13319 transitions. [2025-02-05 12:04:31,835 INFO L78 Accepts]: Start accepts. Automaton has 11642 states and 13319 transitions. Word has length 278 [2025-02-05 12:04:31,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:31,836 INFO L471 AbstractCegarLoop]: Abstraction has 11642 states and 13319 transitions. [2025-02-05 12:04:31,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 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 12:04:31,836 INFO L276 IsEmpty]: Start isEmpty. Operand 11642 states and 13319 transitions. [2025-02-05 12:04:31,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-02-05 12:04:31,842 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:31,843 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 12:04:31,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 12:04:31,843 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:31,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:31,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1941416717, now seen corresponding path program 1 times [2025-02-05 12:04:31,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:31,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908365166] [2025-02-05 12:04:31,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:31,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:31,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-02-05 12:04:31,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-02-05 12:04:31,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:31,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:32,084 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 12:04:32,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:32,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908365166] [2025-02-05 12:04:32,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908365166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:32,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:32,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:32,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887208992] [2025-02-05 12:04:32,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:32,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:32,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:32,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:32,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:32,087 INFO L87 Difference]: Start difference. First operand 11642 states and 13319 transitions. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 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 12:04:33,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:33,698 INFO L93 Difference]: Finished difference Result 28847 states and 33336 transitions. [2025-02-05 12:04:33,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:33,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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 322 [2025-02-05 12:04:33,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:33,721 INFO L225 Difference]: With dead ends: 28847 [2025-02-05 12:04:33,722 INFO L226 Difference]: Without dead ends: 16782 [2025-02-05 12:04:33,733 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 12:04:33,735 INFO L435 NwaCegarLoop]: 841 mSDtfsCounter, 382 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1290 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 1538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 1290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:33,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 915 Invalid, 1538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 1290 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:04:33,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16782 states. [2025-02-05 12:04:34,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16782 to 16349. [2025-02-05 12:04:34,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16349 states, 16348 states have (on average 1.1292512845608025) internal successors, (18461), 16348 states have internal predecessors, (18461), 0 states have call successors, (0), 0 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 12:04:34,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16349 states to 16349 states and 18461 transitions. [2025-02-05 12:04:34,075 INFO L78 Accepts]: Start accepts. Automaton has 16349 states and 18461 transitions. Word has length 322 [2025-02-05 12:04:34,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:34,075 INFO L471 AbstractCegarLoop]: Abstraction has 16349 states and 18461 transitions. [2025-02-05 12:04:34,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 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 12:04:34,076 INFO L276 IsEmpty]: Start isEmpty. Operand 16349 states and 18461 transitions. [2025-02-05 12:04:34,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-02-05 12:04:34,079 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:34,079 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 12:04:34,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 12:04:34,080 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:34,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:34,082 INFO L85 PathProgramCache]: Analyzing trace with hash -712640351, now seen corresponding path program 1 times [2025-02-05 12:04:34,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:34,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969812300] [2025-02-05 12:04:34,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:34,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:34,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-02-05 12:04:34,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-02-05 12:04:34,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:34,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:34,481 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 12:04:34,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:34,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969812300] [2025-02-05 12:04:34,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969812300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:34,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:34,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:34,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712254983] [2025-02-05 12:04:34,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:34,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:34,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:34,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:34,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:34,484 INFO L87 Difference]: Start difference. First operand 16349 states and 18461 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 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 12:04:36,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:36,059 INFO L93 Difference]: Finished difference Result 39113 states and 44253 transitions. [2025-02-05 12:04:36,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:36,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 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 329 [2025-02-05 12:04:36,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:36,083 INFO L225 Difference]: With dead ends: 39113 [2025-02-05 12:04:36,083 INFO L226 Difference]: Without dead ends: 22333 [2025-02-05 12:04:36,097 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 12:04:36,098 INFO L435 NwaCegarLoop]: 716 mSDtfsCounter, 393 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 1579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:36,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 772 Invalid, 1579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:04:36,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22333 states. [2025-02-05 12:04:36,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22333 to 19346. [2025-02-05 12:04:36,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19346 states, 19345 states have (on average 1.1327991729128974) internal successors, (21914), 19345 states have internal predecessors, (21914), 0 states have call successors, (0), 0 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 12:04:36,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19346 states to 19346 states and 21914 transitions. [2025-02-05 12:04:36,520 INFO L78 Accepts]: Start accepts. Automaton has 19346 states and 21914 transitions. Word has length 329 [2025-02-05 12:04:36,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:36,521 INFO L471 AbstractCegarLoop]: Abstraction has 19346 states and 21914 transitions. [2025-02-05 12:04:36,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 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 12:04:36,521 INFO L276 IsEmpty]: Start isEmpty. Operand 19346 states and 21914 transitions. [2025-02-05 12:04:36,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-02-05 12:04:36,559 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:36,559 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:36,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 12:04:36,560 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:36,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:36,560 INFO L85 PathProgramCache]: Analyzing trace with hash -690835645, now seen corresponding path program 1 times [2025-02-05 12:04:36,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:36,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500630537] [2025-02-05 12:04:36,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:36,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:36,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-02-05 12:04:36,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-02-05 12:04:36,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:36,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:36,869 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-02-05 12:04:36,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:36,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500630537] [2025-02-05 12:04:36,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500630537] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:36,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:36,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:36,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071758272] [2025-02-05 12:04:36,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:36,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:36,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:36,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:36,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:36,873 INFO L87 Difference]: Start difference. First operand 19346 states and 21914 transitions. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 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 12:04:38,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:38,403 INFO L93 Difference]: Finished difference Result 45075 states and 51541 transitions. [2025-02-05 12:04:38,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:38,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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 403 [2025-02-05 12:04:38,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:38,434 INFO L225 Difference]: With dead ends: 45075 [2025-02-05 12:04:38,435 INFO L226 Difference]: Without dead ends: 25306 [2025-02-05 12:04:38,449 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 12:04:38,451 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 341 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:38,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 791 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 12:04:38,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25306 states. [2025-02-05 12:04:38,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25306 to 19320. [2025-02-05 12:04:38,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19320 states, 19319 states have (on average 1.132512034784409) internal successors, (21879), 19319 states have internal predecessors, (21879), 0 states have call successors, (0), 0 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 12:04:38,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19320 states to 19320 states and 21879 transitions. [2025-02-05 12:04:38,642 INFO L78 Accepts]: Start accepts. Automaton has 19320 states and 21879 transitions. Word has length 403 [2025-02-05 12:04:38,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:38,643 INFO L471 AbstractCegarLoop]: Abstraction has 19320 states and 21879 transitions. [2025-02-05 12:04:38,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 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 12:04:38,644 INFO L276 IsEmpty]: Start isEmpty. Operand 19320 states and 21879 transitions. [2025-02-05 12:04:38,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2025-02-05 12:04:38,647 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:38,648 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-02-05 12:04:38,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 12:04:38,648 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:38,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:38,648 INFO L85 PathProgramCache]: Analyzing trace with hash 874822156, now seen corresponding path program 1 times [2025-02-05 12:04:38,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:38,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008300629] [2025-02-05 12:04:38,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:38,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:38,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-02-05 12:04:38,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-02-05 12:04:38,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:38,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:38,929 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 443 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2025-02-05 12:04:38,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:38,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008300629] [2025-02-05 12:04:38,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008300629] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:38,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:38,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:38,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118882988] [2025-02-05 12:04:38,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:38,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:38,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:38,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:38,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:38,932 INFO L87 Difference]: Start difference. First operand 19320 states and 21879 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 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 12:04:40,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:40,541 INFO L93 Difference]: Finished difference Result 47156 states and 53418 transitions. [2025-02-05 12:04:40,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:40,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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 404 [2025-02-05 12:04:40,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:40,577 INFO L225 Difference]: With dead ends: 47156 [2025-02-05 12:04:40,577 INFO L226 Difference]: Without dead ends: 26977 [2025-02-05 12:04:40,590 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 12:04:40,590 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 446 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:40,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 663 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 1217 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:04:40,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26977 states. [2025-02-05 12:04:40,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26977 to 24414. [2025-02-05 12:04:40,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24414 states, 24413 states have (on average 1.1234997747101954) internal successors, (27428), 24413 states have internal predecessors, (27428), 0 states have call successors, (0), 0 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 12:04:40,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24414 states to 24414 states and 27428 transitions. [2025-02-05 12:04:40,801 INFO L78 Accepts]: Start accepts. Automaton has 24414 states and 27428 transitions. Word has length 404 [2025-02-05 12:04:40,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:40,801 INFO L471 AbstractCegarLoop]: Abstraction has 24414 states and 27428 transitions. [2025-02-05 12:04:40,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 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 12:04:40,802 INFO L276 IsEmpty]: Start isEmpty. Operand 24414 states and 27428 transitions. [2025-02-05 12:04:40,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-02-05 12:04:40,806 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:40,806 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:40,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 12:04:40,806 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:40,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:40,807 INFO L85 PathProgramCache]: Analyzing trace with hash 811050599, now seen corresponding path program 1 times [2025-02-05 12:04:40,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:40,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661270950] [2025-02-05 12:04:40,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:40,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:40,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-02-05 12:04:40,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-02-05 12:04:40,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:40,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:41,425 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 522 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 12:04:41,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:41,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661270950] [2025-02-05 12:04:41,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661270950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:41,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:41,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:04:41,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290499309] [2025-02-05 12:04:41,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:41,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:04:41,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:41,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:04:41,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:04:41,427 INFO L87 Difference]: Start difference. First operand 24414 states and 27428 transitions. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 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 12:04:43,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:43,874 INFO L93 Difference]: Finished difference Result 62487 states and 70116 transitions. [2025-02-05 12:04:43,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:04:43,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 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 408 [2025-02-05 12:04:43,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:43,911 INFO L225 Difference]: With dead ends: 62487 [2025-02-05 12:04:43,912 INFO L226 Difference]: Without dead ends: 38075 [2025-02-05 12:04:43,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:04:43,933 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 826 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 2377 mSolverCounterSat, 485 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 2862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 485 IncrementalHoareTripleChecker+Valid, 2377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:43,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 211 Invalid, 2862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [485 Valid, 2377 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 12:04:43,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38075 states. [2025-02-05 12:04:44,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38075 to 34226. [2025-02-05 12:04:44,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34226 states, 34225 states have (on average 1.1238860482103725) internal successors, (38465), 34225 states have internal predecessors, (38465), 0 states have call successors, (0), 0 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 12:04:44,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34226 states to 34226 states and 38465 transitions. [2025-02-05 12:04:44,385 INFO L78 Accepts]: Start accepts. Automaton has 34226 states and 38465 transitions. Word has length 408 [2025-02-05 12:04:44,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:44,386 INFO L471 AbstractCegarLoop]: Abstraction has 34226 states and 38465 transitions. [2025-02-05 12:04:44,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 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 12:04:44,386 INFO L276 IsEmpty]: Start isEmpty. Operand 34226 states and 38465 transitions. [2025-02-05 12:04:44,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2025-02-05 12:04:44,393 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:44,393 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-02-05 12:04:44,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 12:04:44,393 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:44,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:44,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1464025927, now seen corresponding path program 1 times [2025-02-05 12:04:44,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:44,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440335833] [2025-02-05 12:04:44,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:44,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:44,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-02-05 12:04:44,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-02-05 12:04:44,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:44,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:44,722 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-02-05 12:04:44,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:44,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440335833] [2025-02-05 12:04:44,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440335833] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:44,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:44,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:44,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851787478] [2025-02-05 12:04:44,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:44,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:44,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:44,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:44,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:44,725 INFO L87 Difference]: Start difference. First operand 34226 states and 38465 transitions. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 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 12:04:46,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:46,390 INFO L93 Difference]: Finished difference Result 77395 states and 87186 transitions. [2025-02-05 12:04:46,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:46,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 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 427 [2025-02-05 12:04:46,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:46,462 INFO L225 Difference]: With dead ends: 77395 [2025-02-05 12:04:46,463 INFO L226 Difference]: Without dead ends: 43171 [2025-02-05 12:04:46,487 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 12:04:46,488 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 393 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:46,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 335 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 12:04:46,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43171 states. [2025-02-05 12:04:46,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43171 to 42736. [2025-02-05 12:04:46,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42736 states, 42735 states have (on average 1.1186381186381187) internal successors, (47805), 42735 states have internal predecessors, (47805), 0 states have call successors, (0), 0 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 12:04:46,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42736 states to 42736 states and 47805 transitions. [2025-02-05 12:04:47,001 INFO L78 Accepts]: Start accepts. Automaton has 42736 states and 47805 transitions. Word has length 427 [2025-02-05 12:04:47,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:47,001 INFO L471 AbstractCegarLoop]: Abstraction has 42736 states and 47805 transitions. [2025-02-05 12:04:47,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 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 12:04:47,002 INFO L276 IsEmpty]: Start isEmpty. Operand 42736 states and 47805 transitions. [2025-02-05 12:04:47,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-02-05 12:04:47,013 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:47,013 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:04:47,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 12:04:47,014 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:47,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:47,017 INFO L85 PathProgramCache]: Analyzing trace with hash -325549135, now seen corresponding path program 1 times [2025-02-05 12:04:47,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:47,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096833536] [2025-02-05 12:04:47,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:47,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:47,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-02-05 12:04:47,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-02-05 12:04:47,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:47,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:47,414 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 460 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-02-05 12:04:47,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:47,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096833536] [2025-02-05 12:04:47,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096833536] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:47,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:47,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:47,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151118606] [2025-02-05 12:04:47,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:47,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:47,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:47,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:47,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:47,416 INFO L87 Difference]: Start difference. First operand 42736 states and 47805 transitions. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 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 12:04:49,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:49,094 INFO L93 Difference]: Finished difference Result 98672 states and 109854 transitions. [2025-02-05 12:04:49,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:49,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 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 428 [2025-02-05 12:04:49,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:49,177 INFO L225 Difference]: With dead ends: 98672 [2025-02-05 12:04:49,178 INFO L226 Difference]: Without dead ends: 55086 [2025-02-05 12:04:49,215 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 12:04:49,216 INFO L435 NwaCegarLoop]: 771 mSDtfsCounter, 372 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1321 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:49,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 826 Invalid, 1486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1321 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 12:04:49,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55086 states. [2025-02-05 12:04:49,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55086 to 52941. [2025-02-05 12:04:49,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52941 states, 52940 states have (on average 1.1039478655081223) internal successors, (58443), 52940 states have internal predecessors, (58443), 0 states have call successors, (0), 0 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 12:04:50,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52941 states to 52941 states and 58443 transitions. [2025-02-05 12:04:50,064 INFO L78 Accepts]: Start accepts. Automaton has 52941 states and 58443 transitions. Word has length 428 [2025-02-05 12:04:50,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:50,068 INFO L471 AbstractCegarLoop]: Abstraction has 52941 states and 58443 transitions. [2025-02-05 12:04:50,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 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 12:04:50,068 INFO L276 IsEmpty]: Start isEmpty. Operand 52941 states and 58443 transitions. [2025-02-05 12:04:50,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2025-02-05 12:04:50,076 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:50,076 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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 12:04:50,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 12:04:50,077 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:50,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:50,078 INFO L85 PathProgramCache]: Analyzing trace with hash 587520287, now seen corresponding path program 1 times [2025-02-05 12:04:50,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:50,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088600466] [2025-02-05 12:04:50,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:50,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:50,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 451 statements into 1 equivalence classes. [2025-02-05 12:04:50,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 451 of 451 statements. [2025-02-05 12:04:50,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:50,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:50,555 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 468 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-02-05 12:04:50,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:50,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088600466] [2025-02-05 12:04:50,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088600466] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:50,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:50,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:50,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842930877] [2025-02-05 12:04:50,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:50,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:50,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:50,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:50,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:50,556 INFO L87 Difference]: Start difference. First operand 52941 states and 58443 transitions. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 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 12:04:52,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:52,397 INFO L93 Difference]: Finished difference Result 113563 states and 125554 transitions. [2025-02-05 12:04:52,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:52,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 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 451 [2025-02-05 12:04:52,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:52,479 INFO L225 Difference]: With dead ends: 113563 [2025-02-05 12:04:52,479 INFO L226 Difference]: Without dead ends: 60195 [2025-02-05 12:04:52,514 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 12:04:52,515 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 428 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:52,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 266 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:04:52,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60195 states. [2025-02-05 12:04:53,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60195 to 58471. [2025-02-05 12:04:53,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58471 states, 58470 states have (on average 1.104361210877373) internal successors, (64572), 58470 states have internal predecessors, (64572), 0 states have call successors, (0), 0 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 12:04:53,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58471 states to 58471 states and 64572 transitions. [2025-02-05 12:04:53,155 INFO L78 Accepts]: Start accepts. Automaton has 58471 states and 64572 transitions. Word has length 451 [2025-02-05 12:04:53,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:53,155 INFO L471 AbstractCegarLoop]: Abstraction has 58471 states and 64572 transitions. [2025-02-05 12:04:53,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 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 12:04:53,156 INFO L276 IsEmpty]: Start isEmpty. Operand 58471 states and 64572 transitions. [2025-02-05 12:04:53,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2025-02-05 12:04:53,160 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:53,161 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:53,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 12:04:53,161 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:53,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:53,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1416619832, now seen corresponding path program 1 times [2025-02-05 12:04:53,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:53,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179499526] [2025-02-05 12:04:53,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:53,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:53,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 451 statements into 1 equivalence classes. [2025-02-05 12:04:53,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 451 of 451 statements. [2025-02-05 12:04:53,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:53,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:53,316 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2025-02-05 12:04:53,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:53,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179499526] [2025-02-05 12:04:53,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179499526] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:53,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:53,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:53,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601449431] [2025-02-05 12:04:53,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:53,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:53,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:53,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:53,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:53,318 INFO L87 Difference]: Start difference. First operand 58471 states and 64572 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 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 12:04:55,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:55,112 INFO L93 Difference]: Finished difference Result 139069 states and 153533 transitions. [2025-02-05 12:04:55,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:55,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 451 [2025-02-05 12:04:55,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:55,202 INFO L225 Difference]: With dead ends: 139069 [2025-02-05 12:04:55,202 INFO L226 Difference]: Without dead ends: 80600 [2025-02-05 12:04:55,244 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 12:04:55,244 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 475 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:55,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 281 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:04:55,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80600 states. [2025-02-05 12:04:56,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80600 to 78444. [2025-02-05 12:04:56,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78444 states, 78443 states have (on average 1.0981604477136264) internal successors, (86143), 78443 states have internal predecessors, (86143), 0 states have call successors, (0), 0 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 12:04:56,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78444 states to 78444 states and 86143 transitions. [2025-02-05 12:04:56,284 INFO L78 Accepts]: Start accepts. Automaton has 78444 states and 86143 transitions. Word has length 451 [2025-02-05 12:04:56,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:56,284 INFO L471 AbstractCegarLoop]: Abstraction has 78444 states and 86143 transitions. [2025-02-05 12:04:56,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 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 12:04:56,285 INFO L276 IsEmpty]: Start isEmpty. Operand 78444 states and 86143 transitions. [2025-02-05 12:04:56,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2025-02-05 12:04:56,289 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:56,289 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:56,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 12:04:56,290 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:56,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:56,290 INFO L85 PathProgramCache]: Analyzing trace with hash -157273983, now seen corresponding path program 1 times [2025-02-05 12:04:56,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:56,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963803198] [2025-02-05 12:04:56,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:56,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:56,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 451 statements into 1 equivalence classes. [2025-02-05 12:04:56,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 451 of 451 statements. [2025-02-05 12:04:56,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:56,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:56,763 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-02-05 12:04:56,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:56,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963803198] [2025-02-05 12:04:56,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963803198] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:56,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:56,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:56,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805802235] [2025-02-05 12:04:56,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:56,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:56,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:56,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:56,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:56,765 INFO L87 Difference]: Start difference. First operand 78444 states and 86143 transitions. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 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 12:04:58,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:58,709 INFO L93 Difference]: Finished difference Result 172219 states and 188927 transitions. [2025-02-05 12:04:58,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:58,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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 451 [2025-02-05 12:04:58,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:58,862 INFO L225 Difference]: With dead ends: 172219 [2025-02-05 12:04:58,862 INFO L226 Difference]: Without dead ends: 93349 [2025-02-05 12:04:58,929 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 12:04:58,929 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 293 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:58,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 814 Invalid, 1462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:04:59,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93349 states. [2025-02-05 12:05:00,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93349 to 92055. [2025-02-05 12:05:00,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92055 states, 92054 states have (on average 1.0885893062767507) internal successors, (100209), 92054 states have internal predecessors, (100209), 0 states have call successors, (0), 0 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 12:05:00,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92055 states to 92055 states and 100209 transitions. [2025-02-05 12:05:00,357 INFO L78 Accepts]: Start accepts. Automaton has 92055 states and 100209 transitions. Word has length 451 [2025-02-05 12:05:00,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:00,357 INFO L471 AbstractCegarLoop]: Abstraction has 92055 states and 100209 transitions. [2025-02-05 12:05:00,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 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 12:05:00,362 INFO L276 IsEmpty]: Start isEmpty. Operand 92055 states and 100209 transitions. [2025-02-05 12:05:00,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-02-05 12:05:00,371 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:00,375 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:05:00,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 12:05:00,376 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:00,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:00,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1032846720, now seen corresponding path program 1 times [2025-02-05 12:05:00,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:00,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297050488] [2025-02-05 12:05:00,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:00,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:00,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-02-05 12:05:00,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-02-05 12:05:00,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:00,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:01,451 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 12:05:01,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:01,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297050488] [2025-02-05 12:05:01,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297050488] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:01,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:01,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:05:01,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548275032] [2025-02-05 12:05:01,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:01,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:05:01,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:01,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:05:01,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:01,454 INFO L87 Difference]: Start difference. First operand 92055 states and 100209 transitions. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 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 12:05:03,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:03,510 INFO L93 Difference]: Finished difference Result 194757 states and 211861 transitions. [2025-02-05 12:05:03,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:05:03,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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 454 [2025-02-05 12:05:03,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:03,685 INFO L225 Difference]: With dead ends: 194757 [2025-02-05 12:05:03,685 INFO L226 Difference]: Without dead ends: 102279 [2025-02-05 12:05:03,747 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 12:05:03,748 INFO L435 NwaCegarLoop]: 728 mSDtfsCounter, 247 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:03,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 790 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:05:03,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102279 states. [2025-02-05 12:05:04,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102279 to 97591. [2025-02-05 12:05:05,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97591 states, 97590 states have (on average 1.0835229019366739) internal successors, (105741), 97590 states have internal predecessors, (105741), 0 states have call successors, (0), 0 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 12:05:05,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97591 states to 97591 states and 105741 transitions. [2025-02-05 12:05:05,139 INFO L78 Accepts]: Start accepts. Automaton has 97591 states and 105741 transitions. Word has length 454 [2025-02-05 12:05:05,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:05,140 INFO L471 AbstractCegarLoop]: Abstraction has 97591 states and 105741 transitions. [2025-02-05 12:05:05,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 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 12:05:05,140 INFO L276 IsEmpty]: Start isEmpty. Operand 97591 states and 105741 transitions. [2025-02-05 12:05:05,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-02-05 12:05:05,146 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:05,147 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:05:05,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 12:05:05,147 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:05,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:05,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1914271108, now seen corresponding path program 1 times [2025-02-05 12:05:05,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:05,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592280287] [2025-02-05 12:05:05,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:05,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:05,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-02-05 12:05:05,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-02-05 12:05:05,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:05,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:05,620 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-05 12:05:05,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:05,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592280287] [2025-02-05 12:05:05,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592280287] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:05,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:05,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:05:05,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473867248] [2025-02-05 12:05:05,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:05,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:05:05,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:05,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:05:05,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:05,623 INFO L87 Difference]: Start difference. First operand 97591 states and 105741 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 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 12:05:08,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:08,454 INFO L93 Difference]: Finished difference Result 207541 states and 225049 transitions. [2025-02-05 12:05:08,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:05:08,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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 499 [2025-02-05 12:05:08,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:08,638 INFO L225 Difference]: With dead ends: 207541 [2025-02-05 12:05:08,639 INFO L226 Difference]: Without dead ends: 109514 [2025-02-05 12:05:08,691 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 12:05:08,692 INFO L435 NwaCegarLoop]: 658 mSDtfsCounter, 489 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:08,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 698 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 12:05:08,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109514 states. [2025-02-05 12:05:10,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109514 to 105662. [2025-02-05 12:05:10,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105662 states, 105661 states have (on average 1.0785720369862106) internal successors, (113963), 105661 states have internal predecessors, (113963), 0 states have call successors, (0), 0 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 12:05:10,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105662 states to 105662 states and 113963 transitions. [2025-02-05 12:05:10,320 INFO L78 Accepts]: Start accepts. Automaton has 105662 states and 113963 transitions. Word has length 499 [2025-02-05 12:05:10,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:10,321 INFO L471 AbstractCegarLoop]: Abstraction has 105662 states and 113963 transitions. [2025-02-05 12:05:10,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 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 12:05:10,321 INFO L276 IsEmpty]: Start isEmpty. Operand 105662 states and 113963 transitions. [2025-02-05 12:05:10,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2025-02-05 12:05:10,335 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:10,335 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:05:10,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 12:05:10,335 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:10,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:10,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1992369795, now seen corresponding path program 1 times [2025-02-05 12:05:10,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:10,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890750007] [2025-02-05 12:05:10,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:10,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:10,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 563 statements into 1 equivalence classes. [2025-02-05 12:05:10,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 563 of 563 statements. [2025-02-05 12:05:10,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:10,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:11,007 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 394 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2025-02-05 12:05:11,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:11,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890750007] [2025-02-05 12:05:11,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890750007] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:11,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:11,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 12:05:11,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613650328] [2025-02-05 12:05:11,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:11,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 12:05:11,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:11,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 12:05:11,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 12:05:11,009 INFO L87 Difference]: Start difference. First operand 105662 states and 113963 transitions. Second operand has 5 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 0 states have call successors, (0), 0 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 12:05:14,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:14,769 INFO L93 Difference]: Finished difference Result 244109 states and 263029 transitions. [2025-02-05 12:05:14,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 12:05:14,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 0 states have call successors, (0), 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 563 [2025-02-05 12:05:14,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:15,000 INFO L225 Difference]: With dead ends: 244109 [2025-02-05 12:05:15,000 INFO L226 Difference]: Without dead ends: 137596 [2025-02-05 12:05:15,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 12:05:15,057 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 1267 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 3227 mSolverCounterSat, 571 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1267 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 3798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 571 IncrementalHoareTripleChecker+Valid, 3227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:15,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1267 Valid, 227 Invalid, 3798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [571 Valid, 3227 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 12:05:15,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137596 states. [2025-02-05 12:05:16,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137596 to 120559. [2025-02-05 12:05:16,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120559 states, 120558 states have (on average 1.0706713780918728) internal successors, (129078), 120558 states have internal predecessors, (129078), 0 states have call successors, (0), 0 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 12:05:17,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120559 states to 120559 states and 129078 transitions. [2025-02-05 12:05:17,157 INFO L78 Accepts]: Start accepts. Automaton has 120559 states and 129078 transitions. Word has length 563 [2025-02-05 12:05:17,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:17,158 INFO L471 AbstractCegarLoop]: Abstraction has 120559 states and 129078 transitions. [2025-02-05 12:05:17,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 0 states have call successors, (0), 0 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 12:05:17,158 INFO L276 IsEmpty]: Start isEmpty. Operand 120559 states and 129078 transitions. [2025-02-05 12:05:17,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2025-02-05 12:05:17,173 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:17,173 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:05:17,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 12:05:17,173 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:17,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:17,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1755751970, now seen corresponding path program 1 times [2025-02-05 12:05:17,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:17,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615324166] [2025-02-05 12:05:17,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:17,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:17,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 563 statements into 1 equivalence classes. [2025-02-05 12:05:17,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 563 of 563 statements. [2025-02-05 12:05:17,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:17,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:17,630 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 394 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2025-02-05 12:05:17,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:17,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615324166] [2025-02-05 12:05:17,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615324166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:17,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:17,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 12:05:17,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557772703] [2025-02-05 12:05:17,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:17,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 12:05:17,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:17,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 12:05:17,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 12:05:17,635 INFO L87 Difference]: Start difference. First operand 120559 states and 129078 transitions. Second operand has 5 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 0 states have call successors, (0), 0 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 12:05:21,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:21,689 INFO L93 Difference]: Finished difference Result 274762 states and 294268 transitions. [2025-02-05 12:05:21,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 12:05:21,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 0 states have call successors, (0), 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 563 [2025-02-05 12:05:21,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:21,953 INFO L225 Difference]: With dead ends: 274762 [2025-02-05 12:05:21,953 INFO L226 Difference]: Without dead ends: 152930 [2025-02-05 12:05:22,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 12:05:22,009 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 1655 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 2758 mSolverCounterSat, 575 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1655 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 3333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 575 IncrementalHoareTripleChecker+Valid, 2758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:22,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1655 Valid, 178 Invalid, 3333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [575 Valid, 2758 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-02-05 12:05:22,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152930 states. [2025-02-05 12:05:23,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152930 to 127795. [2025-02-05 12:05:23,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127795 states, 127794 states have (on average 1.0691973019077579) internal successors, (136637), 127794 states have internal predecessors, (136637), 0 states have call successors, (0), 0 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 12:05:23,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127795 states to 127795 states and 136637 transitions. [2025-02-05 12:05:23,953 INFO L78 Accepts]: Start accepts. Automaton has 127795 states and 136637 transitions. Word has length 563 [2025-02-05 12:05:23,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:23,954 INFO L471 AbstractCegarLoop]: Abstraction has 127795 states and 136637 transitions. [2025-02-05 12:05:23,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 0 states have call successors, (0), 0 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 12:05:23,954 INFO L276 IsEmpty]: Start isEmpty. Operand 127795 states and 136637 transitions. [2025-02-05 12:05:23,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2025-02-05 12:05:23,963 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:23,964 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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 12:05:23,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 12:05:23,964 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:23,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:23,965 INFO L85 PathProgramCache]: Analyzing trace with hash -208327491, now seen corresponding path program 1 times [2025-02-05 12:05:23,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:23,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622519948] [2025-02-05 12:05:23,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:23,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:24,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 568 statements into 1 equivalence classes. [2025-02-05 12:05:24,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 568 of 568 statements. [2025-02-05 12:05:24,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:24,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:24,790 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 399 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-02-05 12:05:24,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:24,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622519948] [2025-02-05 12:05:24,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622519948] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:24,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:24,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:05:24,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986489834] [2025-02-05 12:05:24,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:24,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:05:24,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:24,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:05:24,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:05:24,797 INFO L87 Difference]: Start difference. First operand 127795 states and 136637 transitions. Second operand has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 0 states have call successors, (0), 0 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 12:05:27,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:27,815 INFO L93 Difference]: Finished difference Result 267935 states and 286154 transitions. [2025-02-05 12:05:27,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:05:27,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 0 states have call successors, (0), 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 568 [2025-02-05 12:05:27,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:27,991 INFO L225 Difference]: With dead ends: 267935 [2025-02-05 12:05:27,991 INFO L226 Difference]: Without dead ends: 140142 [2025-02-05 12:05:28,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:05:28,070 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 726 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 2791 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 3095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 2791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:28,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 338 Invalid, 3095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 2791 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 12:05:28,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140142 states. [2025-02-05 12:05:29,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140142 to 136733. [2025-02-05 12:05:29,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136733 states, 136732 states have (on average 1.0627870578942749) internal successors, (145317), 136732 states have internal predecessors, (145317), 0 states have call successors, (0), 0 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 12:05:29,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136733 states to 136733 states and 145317 transitions. [2025-02-05 12:05:29,708 INFO L78 Accepts]: Start accepts. Automaton has 136733 states and 145317 transitions. Word has length 568 [2025-02-05 12:05:29,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:29,708 INFO L471 AbstractCegarLoop]: Abstraction has 136733 states and 145317 transitions. [2025-02-05 12:05:29,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 0 states have call successors, (0), 0 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 12:05:29,709 INFO L276 IsEmpty]: Start isEmpty. Operand 136733 states and 145317 transitions. [2025-02-05 12:05:29,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-02-05 12:05:29,717 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:29,718 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:05:29,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 12:05:29,718 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:29,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:29,718 INFO L85 PathProgramCache]: Analyzing trace with hash -380652595, now seen corresponding path program 1 times [2025-02-05 12:05:29,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:29,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550560270] [2025-02-05 12:05:29,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:29,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:29,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-02-05 12:05:29,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-02-05 12:05:29,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:29,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat