./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label32.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label32.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 758b6bdd5f0153469513ef6931f2486fab3d5fd3aa9f01cac0e5fdb67f3e5b48 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:19:02,775 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:19:02,826 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:19:02,831 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:19:02,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:19:02,857 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:19:02,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:19:02,859 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:19:02,859 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:19:02,859 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:19:02,859 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:19:02,860 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:19:02,860 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:19:02,860 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:19:02,860 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:19:02,860 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:19:02,860 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:19:02,861 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:19:02,861 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:19:02,861 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:19:02,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:19:02,861 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:19:02,861 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:19:02,861 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:19:02,861 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:19:02,861 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:19:02,862 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:19:02,862 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:19:02,862 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:19:02,862 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:19:02,862 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:19:02,862 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:19:02,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:19:02,862 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:19:02,863 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:19:02,863 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:19:02,863 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:19:02,863 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:19:02,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:19:02,863 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:19:02,863 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:19:02,863 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:19:02,863 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:19:02,863 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 758b6bdd5f0153469513ef6931f2486fab3d5fd3aa9f01cac0e5fdb67f3e5b48 [2025-03-16 15:19:03,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:19:03,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:19:03,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:19:03,089 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:19:03,089 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:19:03,090 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label32.c [2025-03-16 15:19:04,214 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a9b43c8e/2f932af6542b476e9cb4d7562c6fb68c/FLAGb8649dade [2025-03-16 15:19:04,541 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:19:04,542 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label32.c [2025-03-16 15:19:04,564 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a9b43c8e/2f932af6542b476e9cb4d7562c6fb68c/FLAGb8649dade [2025-03-16 15:19:04,783 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a9b43c8e/2f932af6542b476e9cb4d7562c6fb68c [2025-03-16 15:19:04,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:19:04,786 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:19:04,787 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:19:04,787 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:19:04,789 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:19:04,790 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:19:04" (1/1) ... [2025-03-16 15:19:04,790 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@110580f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:19:04, skipping insertion in model container [2025-03-16 15:19:04,790 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:19:04" (1/1) ... [2025-03-16 15:19:04,834 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:19:04,978 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label32.c[7145,7158] [2025-03-16 15:19:05,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:19:05,268 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:19:05,289 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label32.c[7145,7158] [2025-03-16 15:19:05,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:19:05,489 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:19:05,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:19:05 WrapperNode [2025-03-16 15:19:05,490 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:19:05,491 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:19:05,491 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:19:05,491 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:19:05,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:19:05" (1/1) ... [2025-03-16 15:19:05,531 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:19:05" (1/1) ... [2025-03-16 15:19:05,733 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-03-16 15:19:05,733 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:19:05,734 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:19:05,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:19:05,734 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:19:05,741 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:19:05" (1/1) ... [2025-03-16 15:19:05,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:19:05" (1/1) ... [2025-03-16 15:19:05,776 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:19:05" (1/1) ... [2025-03-16 15:19:05,905 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 15:19:05,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:19:05" (1/1) ... [2025-03-16 15:19:05,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:19:05" (1/1) ... [2025-03-16 15:19:05,973 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:19:05" (1/1) ... [2025-03-16 15:19:05,988 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:19:05" (1/1) ... [2025-03-16 15:19:06,008 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:19:05" (1/1) ... [2025-03-16 15:19:06,021 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:19:05" (1/1) ... [2025-03-16 15:19:06,059 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:19:06,059 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:19:06,060 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:19:06,060 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:19:06,061 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:19:05" (1/1) ... [2025-03-16 15:19:06,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:19:06,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:19:06,085 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 15:19:06,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 15:19:06,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:19:06,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:19:06,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:19:06,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:19:06,161 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:19:06,162 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:19:08,742 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-03-16 15:19:08,828 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-03-16 15:19:08,828 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:19:08,852 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:19:08,857 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:19:08,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:19:08 BoogieIcfgContainer [2025-03-16 15:19:08,857 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:19:08,858 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:19:08,859 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:19:08,862 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:19:08,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:19:04" (1/3) ... [2025-03-16 15:19:08,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@293d8fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:19:08, skipping insertion in model container [2025-03-16 15:19:08,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:19:05" (2/3) ... [2025-03-16 15:19:08,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@293d8fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:19:08, skipping insertion in model container [2025-03-16 15:19:08,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:19:08" (3/3) ... [2025-03-16 15:19:08,864 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label32.c [2025-03-16 15:19:08,874 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:19:08,875 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label32.c that has 1 procedures, 529 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:19:08,934 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:19:08,942 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;@76f71918, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:19:08,943 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:19:08,949 INFO L276 IsEmpty]: Start isEmpty. Operand has 529 states, 527 states have (on average 1.8975332068311195) internal successors, (1000), 528 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:08,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 15:19:08,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:08,955 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:08,955 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:08,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:08,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1228142651, now seen corresponding path program 1 times [2025-03-16 15:19:08,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:08,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320511262] [2025-03-16 15:19:08,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:08,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:09,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 15:19:09,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 15:19:09,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:09,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:09,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:19:09,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:09,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320511262] [2025-03-16 15:19:09,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320511262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:09,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:09,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:19:09,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108642055] [2025-03-16 15:19:09,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:09,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:19:09,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:09,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:19:09,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:19:09,118 INFO L87 Difference]: Start difference. First operand has 529 states, 527 states have (on average 1.8975332068311195) internal successors, (1000), 528 states have internal predecessors, (1000), 0 states have call successors, (0), 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 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:09,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:09,181 INFO L93 Difference]: Finished difference Result 1057 states and 1999 transitions. [2025-03-16 15:19:09,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:19:09,182 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-03-16 15:19:09,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:09,192 INFO L225 Difference]: With dead ends: 1057 [2025-03-16 15:19:09,192 INFO L226 Difference]: Without dead ends: 526 [2025-03-16 15:19:09,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:19:09,200 INFO L435 NwaCegarLoop]: 938 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:09,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:19:09,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-03-16 15:19:09,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2025-03-16 15:19:09,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.7809523809523808) internal successors, (935), 525 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:09,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2025-03-16 15:19:09,255 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 47 [2025-03-16 15:19:09,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:09,255 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2025-03-16 15:19:09,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:09,255 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2025-03-16 15:19:09,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 15:19:09,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:09,256 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:09,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:19:09,256 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:09,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:09,257 INFO L85 PathProgramCache]: Analyzing trace with hash -244336341, now seen corresponding path program 1 times [2025-03-16 15:19:09,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:09,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874941175] [2025-03-16 15:19:09,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:09,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:09,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 15:19:09,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 15:19:09,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:09,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:09,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:19:09,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:09,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874941175] [2025-03-16 15:19:09,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874941175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:09,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:09,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:19:09,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986416246] [2025-03-16 15:19:09,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:09,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:09,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:09,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:09,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:09,458 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:11,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:11,354 INFO L93 Difference]: Finished difference Result 1501 states and 2698 transitions. [2025-03-16 15:19:11,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:11,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-03-16 15:19:11,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:11,359 INFO L225 Difference]: With dead ends: 1501 [2025-03-16 15:19:11,359 INFO L226 Difference]: Without dead ends: 976 [2025-03-16 15:19:11,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:11,378 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 424 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 1682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:11,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 449 Invalid, 1682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 15:19:11,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2025-03-16 15:19:11,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 970. [2025-03-16 15:19:11,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 1.5541795665634675) internal successors, (1506), 969 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:11,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1506 transitions. [2025-03-16 15:19:11,426 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1506 transitions. Word has length 47 [2025-03-16 15:19:11,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:11,426 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 1506 transitions. [2025-03-16 15:19:11,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:11,427 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1506 transitions. [2025-03-16 15:19:11,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-16 15:19:11,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:11,436 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:11,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:19:11,436 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:11,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:11,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1492116063, now seen corresponding path program 1 times [2025-03-16 15:19:11,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:11,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128014346] [2025-03-16 15:19:11,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:11,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:11,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-16 15:19:11,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-16 15:19:11,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:11,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:11,629 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:19:11,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:11,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128014346] [2025-03-16 15:19:11,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128014346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:11,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:11,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:19:11,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163800893] [2025-03-16 15:19:11,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:11,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:11,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:11,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:11,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:11,633 INFO L87 Difference]: Start difference. First operand 970 states and 1506 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 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-03-16 15:19:13,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:13,379 INFO L93 Difference]: Finished difference Result 2812 states and 4380 transitions. [2025-03-16 15:19:13,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:13,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 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 114 [2025-03-16 15:19:13,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:13,386 INFO L225 Difference]: With dead ends: 2812 [2025-03-16 15:19:13,387 INFO L226 Difference]: Without dead ends: 1843 [2025-03-16 15:19:13,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:13,391 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 405 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:13,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 579 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 15:19:13,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2025-03-16 15:19:13,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1840. [2025-03-16 15:19:13,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1839 states have (on average 1.3501903208265362) internal successors, (2483), 1839 states have internal predecessors, (2483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:13,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2483 transitions. [2025-03-16 15:19:13,432 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2483 transitions. Word has length 114 [2025-03-16 15:19:13,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:13,433 INFO L471 AbstractCegarLoop]: Abstraction has 1840 states and 2483 transitions. [2025-03-16 15:19:13,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 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-03-16 15:19:13,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2483 transitions. [2025-03-16 15:19:13,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-16 15:19:13,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:13,434 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:19:13,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:19:13,434 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:13,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:13,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1257023663, now seen corresponding path program 1 times [2025-03-16 15:19:13,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:13,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865541711] [2025-03-16 15:19:13,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:13,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:13,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-16 15:19:13,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-16 15:19:13,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:13,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:13,739 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:19:13,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:13,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865541711] [2025-03-16 15:19:13,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865541711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:13,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:13,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:13,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443169840] [2025-03-16 15:19:13,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:13,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:19:13,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:13,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:19:13,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:19:13,742 INFO L87 Difference]: Start difference. First operand 1840 states and 2483 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:16,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:16,654 INFO L93 Difference]: Finished difference Result 6766 states and 9258 transitions. [2025-03-16 15:19:16,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:19:16,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2025-03-16 15:19:16,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:16,668 INFO L225 Difference]: With dead ends: 6766 [2025-03-16 15:19:16,668 INFO L226 Difference]: Without dead ends: 4927 [2025-03-16 15:19:16,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:19:16,672 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 866 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 2790 mSolverCounterSat, 593 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 3383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 593 IncrementalHoareTripleChecker+Valid, 2790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:16,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 325 Invalid, 3383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [593 Valid, 2790 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-16 15:19:16,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4927 states. [2025-03-16 15:19:16,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4927 to 4874. [2025-03-16 15:19:16,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4874 states, 4873 states have (on average 1.2866817155756207) internal successors, (6270), 4873 states have internal predecessors, (6270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:16,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4874 states to 4874 states and 6270 transitions. [2025-03-16 15:19:16,739 INFO L78 Accepts]: Start accepts. Automaton has 4874 states and 6270 transitions. Word has length 117 [2025-03-16 15:19:16,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:16,740 INFO L471 AbstractCegarLoop]: Abstraction has 4874 states and 6270 transitions. [2025-03-16 15:19:16,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:16,740 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 6270 transitions. [2025-03-16 15:19:16,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-16 15:19:16,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:16,743 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:16,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:19:16,743 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:16,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:16,744 INFO L85 PathProgramCache]: Analyzing trace with hash -409341034, now seen corresponding path program 1 times [2025-03-16 15:19:16,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:16,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159784310] [2025-03-16 15:19:16,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:16,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:16,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-16 15:19:16,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-16 15:19:16,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:16,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:16,956 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-16 15:19:16,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:16,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159784310] [2025-03-16 15:19:16,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159784310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:16,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:16,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:19:16,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414378821] [2025-03-16 15:19:16,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:16,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:16,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:16,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:16,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:16,960 INFO L87 Difference]: Start difference. First operand 4874 states and 6270 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:18,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:18,314 INFO L93 Difference]: Finished difference Result 14435 states and 18543 transitions. [2025-03-16 15:19:18,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:18,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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 186 [2025-03-16 15:19:18,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:18,337 INFO L225 Difference]: With dead ends: 14435 [2025-03-16 15:19:18,337 INFO L226 Difference]: Without dead ends: 8276 [2025-03-16 15:19:18,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:18,347 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:18,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 589 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:19:18,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8276 states. [2025-03-16 15:19:18,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8276 to 6575. [2025-03-16 15:19:18,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6575 states, 6574 states have (on average 1.179342865835108) internal successors, (7753), 6574 states have internal predecessors, (7753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:18,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6575 states to 6575 states and 7753 transitions. [2025-03-16 15:19:18,453 INFO L78 Accepts]: Start accepts. Automaton has 6575 states and 7753 transitions. Word has length 186 [2025-03-16 15:19:18,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:18,454 INFO L471 AbstractCegarLoop]: Abstraction has 6575 states and 7753 transitions. [2025-03-16 15:19:18,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:18,454 INFO L276 IsEmpty]: Start isEmpty. Operand 6575 states and 7753 transitions. [2025-03-16 15:19:18,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-16 15:19:18,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:18,456 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:18,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:19:18,456 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:18,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:18,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1986253520, now seen corresponding path program 1 times [2025-03-16 15:19:18,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:18,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502798883] [2025-03-16 15:19:18,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:18,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:18,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-16 15:19:18,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-16 15:19:18,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:18,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:18,644 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:19:18,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:18,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502798883] [2025-03-16 15:19:18,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502798883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:18,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:18,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:18,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468602235] [2025-03-16 15:19:18,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:18,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:18,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:18,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:18,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:18,646 INFO L87 Difference]: Start difference. First operand 6575 states and 7753 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:20,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:20,214 INFO L93 Difference]: Finished difference Result 16559 states and 19930 transitions. [2025-03-16 15:19:20,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:20,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 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 199 [2025-03-16 15:19:20,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:20,236 INFO L225 Difference]: With dead ends: 16559 [2025-03-16 15:19:20,236 INFO L226 Difference]: Without dead ends: 9985 [2025-03-16 15:19:20,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:20,242 INFO L435 NwaCegarLoop]: 742 mSDtfsCounter, 496 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:20,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 799 Invalid, 1548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:19:20,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9985 states. [2025-03-16 15:19:20,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9985 to 9985. [2025-03-16 15:19:20,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9985 states, 9984 states have (on average 1.1696714743589745) internal successors, (11678), 9984 states have internal predecessors, (11678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:20,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9985 states to 9985 states and 11678 transitions. [2025-03-16 15:19:20,368 INFO L78 Accepts]: Start accepts. Automaton has 9985 states and 11678 transitions. Word has length 199 [2025-03-16 15:19:20,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:20,368 INFO L471 AbstractCegarLoop]: Abstraction has 9985 states and 11678 transitions. [2025-03-16 15:19:20,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:20,369 INFO L276 IsEmpty]: Start isEmpty. Operand 9985 states and 11678 transitions. [2025-03-16 15:19:20,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-16 15:19:20,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:20,371 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:20,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:19:20,372 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:20,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:20,372 INFO L85 PathProgramCache]: Analyzing trace with hash -540733909, now seen corresponding path program 1 times [2025-03-16 15:19:20,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:20,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25470888] [2025-03-16 15:19:20,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:20,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:20,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-16 15:19:20,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-16 15:19:20,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:20,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:20,476 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-16 15:19:20,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:20,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25470888] [2025-03-16 15:19:20,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25470888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:20,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:20,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:20,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735883698] [2025-03-16 15:19:20,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:20,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:20,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:20,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:20,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:20,479 INFO L87 Difference]: Start difference. First operand 9985 states and 11678 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:21,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:21,935 INFO L93 Difference]: Finished difference Result 25066 states and 29586 transitions. [2025-03-16 15:19:21,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:21,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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 201 [2025-03-16 15:19:21,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:21,963 INFO L225 Difference]: With dead ends: 25066 [2025-03-16 15:19:21,964 INFO L226 Difference]: Without dead ends: 15082 [2025-03-16 15:19:21,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:21,974 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 405 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 1596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:21,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 486 Invalid, 1596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:19:21,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15082 states. [2025-03-16 15:19:22,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15082 to 10383. [2025-03-16 15:19:22,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10383 states, 10382 states have (on average 1.1651897514929686) internal successors, (12097), 10382 states have internal predecessors, (12097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:22,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10383 states to 10383 states and 12097 transitions. [2025-03-16 15:19:22,162 INFO L78 Accepts]: Start accepts. Automaton has 10383 states and 12097 transitions. Word has length 201 [2025-03-16 15:19:22,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:22,162 INFO L471 AbstractCegarLoop]: Abstraction has 10383 states and 12097 transitions. [2025-03-16 15:19:22,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:22,167 INFO L276 IsEmpty]: Start isEmpty. Operand 10383 states and 12097 transitions. [2025-03-16 15:19:22,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-16 15:19:22,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:22,172 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:22,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:19:22,172 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:22,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:22,172 INFO L85 PathProgramCache]: Analyzing trace with hash -280114313, now seen corresponding path program 1 times [2025-03-16 15:19:22,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:22,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489192612] [2025-03-16 15:19:22,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:22,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:22,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-16 15:19:22,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-16 15:19:22,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:22,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:22,326 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 15:19:22,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:22,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489192612] [2025-03-16 15:19:22,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489192612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:22,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:22,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:22,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661520432] [2025-03-16 15:19:22,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:22,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:22,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:22,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:22,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:22,327 INFO L87 Difference]: Start difference. First operand 10383 states and 12097 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:23,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:23,809 INFO L93 Difference]: Finished difference Result 25873 states and 30416 transitions. [2025-03-16 15:19:23,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:23,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 214 [2025-03-16 15:19:23,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:23,834 INFO L225 Difference]: With dead ends: 25873 [2025-03-16 15:19:23,834 INFO L226 Difference]: Without dead ends: 15491 [2025-03-16 15:19:23,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:23,843 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 429 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 1648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:23,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 447 Invalid, 1648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 1345 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:19:23,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15491 states. [2025-03-16 15:19:23,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15491 to 13777. [2025-03-16 15:19:23,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13777 states, 13776 states have (on average 1.166521486643438) internal successors, (16070), 13776 states have internal predecessors, (16070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:23,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13777 states to 13777 states and 16070 transitions. [2025-03-16 15:19:23,966 INFO L78 Accepts]: Start accepts. Automaton has 13777 states and 16070 transitions. Word has length 214 [2025-03-16 15:19:23,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:23,966 INFO L471 AbstractCegarLoop]: Abstraction has 13777 states and 16070 transitions. [2025-03-16 15:19:23,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:23,966 INFO L276 IsEmpty]: Start isEmpty. Operand 13777 states and 16070 transitions. [2025-03-16 15:19:23,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-03-16 15:19:23,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:23,968 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:23,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:19:23,969 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:23,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:23,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1424565407, now seen corresponding path program 1 times [2025-03-16 15:19:23,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:23,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472141284] [2025-03-16 15:19:23,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:23,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:23,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-16 15:19:23,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-16 15:19:23,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:23,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:24,095 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 15:19:24,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:24,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472141284] [2025-03-16 15:19:24,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472141284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:24,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:24,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:24,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204092126] [2025-03-16 15:19:24,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:24,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:24,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:24,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:24,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:24,097 INFO L87 Difference]: Start difference. First operand 13777 states and 16070 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:25,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:25,642 INFO L93 Difference]: Finished difference Result 32233 states and 37931 transitions. [2025-03-16 15:19:25,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:25,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 246 [2025-03-16 15:19:25,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:25,671 INFO L225 Difference]: With dead ends: 32233 [2025-03-16 15:19:25,671 INFO L226 Difference]: Without dead ends: 18457 [2025-03-16 15:19:25,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:25,686 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 443 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 1674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:25,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 415 Invalid, 1674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:19:25,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18457 states. [2025-03-16 15:19:25,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18457 to 17175. [2025-03-16 15:19:25,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17175 states, 17174 states have (on average 1.1833585652730871) internal successors, (20323), 17174 states have internal predecessors, (20323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:25,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17175 states to 17175 states and 20323 transitions. [2025-03-16 15:19:25,952 INFO L78 Accepts]: Start accepts. Automaton has 17175 states and 20323 transitions. Word has length 246 [2025-03-16 15:19:25,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:25,953 INFO L471 AbstractCegarLoop]: Abstraction has 17175 states and 20323 transitions. [2025-03-16 15:19:25,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:25,954 INFO L276 IsEmpty]: Start isEmpty. Operand 17175 states and 20323 transitions. [2025-03-16 15:19:25,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-16 15:19:25,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:25,957 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:25,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:19:25,957 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:25,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:25,961 INFO L85 PathProgramCache]: Analyzing trace with hash 192259133, now seen corresponding path program 1 times [2025-03-16 15:19:25,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:25,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594330494] [2025-03-16 15:19:25,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:25,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:25,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-16 15:19:26,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-16 15:19:26,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:26,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:26,216 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:19:26,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:26,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594330494] [2025-03-16 15:19:26,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594330494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:26,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:26,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:26,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775348658] [2025-03-16 15:19:26,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:26,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:26,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:26,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:26,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:26,218 INFO L87 Difference]: Start difference. First operand 17175 states and 20323 transitions. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:27,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:27,691 INFO L93 Difference]: Finished difference Result 39056 states and 46414 transitions. [2025-03-16 15:19:27,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:27,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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 263 [2025-03-16 15:19:27,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:27,718 INFO L225 Difference]: With dead ends: 39056 [2025-03-16 15:19:27,718 INFO L226 Difference]: Without dead ends: 21457 [2025-03-16 15:19:27,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-03-16 15:19:27,734 INFO L435 NwaCegarLoop]: 789 mSDtfsCounter, 356 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 1580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:27,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 862 Invalid, 1580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:19:27,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21457 states. [2025-03-16 15:19:28,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21457 to 21024. [2025-03-16 15:19:28,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21024 states, 21023 states have (on average 1.1667221614422298) internal successors, (24528), 21023 states have internal predecessors, (24528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:28,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21024 states to 21024 states and 24528 transitions. [2025-03-16 15:19:28,053 INFO L78 Accepts]: Start accepts. Automaton has 21024 states and 24528 transitions. Word has length 263 [2025-03-16 15:19:28,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:28,053 INFO L471 AbstractCegarLoop]: Abstraction has 21024 states and 24528 transitions. [2025-03-16 15:19:28,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:28,053 INFO L276 IsEmpty]: Start isEmpty. Operand 21024 states and 24528 transitions. [2025-03-16 15:19:28,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-16 15:19:28,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:28,058 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:28,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:19:28,058 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:28,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:28,059 INFO L85 PathProgramCache]: Analyzing trace with hash 707587153, now seen corresponding path program 1 times [2025-03-16 15:19:28,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:28,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090745561] [2025-03-16 15:19:28,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:28,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:28,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-16 15:19:28,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-16 15:19:28,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:28,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:28,378 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 230 proven. 70 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-16 15:19:28,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:28,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090745561] [2025-03-16 15:19:28,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090745561] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:19:28,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132829718] [2025-03-16 15:19:28,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:28,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:19:28,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:19:28,380 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:19:28,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 15:19:28,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-16 15:19:28,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-16 15:19:28,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:28,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:28,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 15:19:28,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:19:28,678 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 230 proven. 70 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-16 15:19:28,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:19:28,919 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-16 15:19:28,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132829718] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:19:28,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:19:28,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-16 15:19:28,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730336509] [2025-03-16 15:19:28,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:28,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:19:28,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:28,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:19:28,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:19:28,921 INFO L87 Difference]: Start difference. First operand 21024 states and 24528 transitions. Second operand has 4 states, 4 states have (on average 56.5) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:31,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:31,660 INFO L93 Difference]: Finished difference Result 59099 states and 69387 transitions. [2025-03-16 15:19:31,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:19:31,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 271 [2025-03-16 15:19:31,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:31,781 INFO L225 Difference]: With dead ends: 59099 [2025-03-16 15:19:31,781 INFO L226 Difference]: Without dead ends: 37212 [2025-03-16 15:19:31,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 539 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:19:31,791 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 1061 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 2265 mSolverCounterSat, 1214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 3479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1214 IncrementalHoareTripleChecker+Valid, 2265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:31,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1061 Valid, 140 Invalid, 3479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1214 Valid, 2265 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 15:19:31,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37212 states. [2025-03-16 15:19:32,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37212 to 35505. [2025-03-16 15:19:32,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35505 states, 35504 states have (on average 1.159108832807571) internal successors, (41153), 35504 states have internal predecessors, (41153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:32,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35505 states to 35505 states and 41153 transitions. [2025-03-16 15:19:32,079 INFO L78 Accepts]: Start accepts. Automaton has 35505 states and 41153 transitions. Word has length 271 [2025-03-16 15:19:32,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:32,079 INFO L471 AbstractCegarLoop]: Abstraction has 35505 states and 41153 transitions. [2025-03-16 15:19:32,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:32,079 INFO L276 IsEmpty]: Start isEmpty. Operand 35505 states and 41153 transitions. [2025-03-16 15:19:32,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-03-16 15:19:32,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:32,082 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:32,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 15:19:32,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-16 15:19:32,284 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:32,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:32,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1918142128, now seen corresponding path program 1 times [2025-03-16 15:19:32,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:32,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106172321] [2025-03-16 15:19:32,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:32,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:32,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-03-16 15:19:32,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-03-16 15:19:32,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:32,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:32,496 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-03-16 15:19:32,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:32,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106172321] [2025-03-16 15:19:32,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106172321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:32,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:32,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:32,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351675037] [2025-03-16 15:19:32,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:32,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:32,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:32,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:32,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:32,499 INFO L87 Difference]: Start difference. First operand 35505 states and 41153 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:34,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:34,072 INFO L93 Difference]: Finished difference Result 78653 states and 91328 transitions. [2025-03-16 15:19:34,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:34,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 279 [2025-03-16 15:19:34,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:34,120 INFO L225 Difference]: With dead ends: 78653 [2025-03-16 15:19:34,121 INFO L226 Difference]: Without dead ends: 42722 [2025-03-16 15:19:34,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:34,149 INFO L435 NwaCegarLoop]: 783 mSDtfsCounter, 380 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:34,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 848 Invalid, 1423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:19:34,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42722 states. [2025-03-16 15:19:34,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42722 to 42722. [2025-03-16 15:19:34,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42722 states, 42721 states have (on average 1.117085274221109) internal successors, (47723), 42721 states have internal predecessors, (47723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:34,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42722 states to 42722 states and 47723 transitions. [2025-03-16 15:19:34,574 INFO L78 Accepts]: Start accepts. Automaton has 42722 states and 47723 transitions. Word has length 279 [2025-03-16 15:19:34,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:34,574 INFO L471 AbstractCegarLoop]: Abstraction has 42722 states and 47723 transitions. [2025-03-16 15:19:34,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:34,575 INFO L276 IsEmpty]: Start isEmpty. Operand 42722 states and 47723 transitions. [2025-03-16 15:19:34,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-03-16 15:19:34,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:34,578 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:34,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:19:34,579 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:34,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:34,579 INFO L85 PathProgramCache]: Analyzing trace with hash 226458037, now seen corresponding path program 1 times [2025-03-16 15:19:34,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:34,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129140813] [2025-03-16 15:19:34,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:34,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:34,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-16 15:19:34,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-16 15:19:34,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:34,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:34,966 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 371 proven. 73 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-16 15:19:34,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:34,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129140813] [2025-03-16 15:19:34,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129140813] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:19:34,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594329848] [2025-03-16 15:19:34,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:34,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:19:34,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:19:34,969 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:19:34,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 15:19:35,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-16 15:19:35,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-16 15:19:35,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:35,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:35,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 15:19:35,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:19:35,254 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 371 proven. 73 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-16 15:19:35,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:19:35,460 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 444 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-16 15:19:35,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594329848] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:19:35,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:19:35,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-16 15:19:35,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278346810] [2025-03-16 15:19:35,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:35,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:19:35,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:35,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:19:35,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:19:35,463 INFO L87 Difference]: Start difference. First operand 42722 states and 47723 transitions. Second operand has 4 states, 4 states have (on average 57.75) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:37,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:37,768 INFO L93 Difference]: Finished difference Result 101642 states and 113663 transitions. [2025-03-16 15:19:37,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:19:37,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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 345 [2025-03-16 15:19:37,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:37,824 INFO L225 Difference]: With dead ends: 101642 [2025-03-16 15:19:37,824 INFO L226 Difference]: Without dead ends: 58492 [2025-03-16 15:19:37,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 687 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:19:37,841 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 840 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 2332 mSolverCounterSat, 491 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 2823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 491 IncrementalHoareTripleChecker+Valid, 2332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:37,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 187 Invalid, 2823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [491 Valid, 2332 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 15:19:37,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58492 states. [2025-03-16 15:19:38,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58492 to 55939. [2025-03-16 15:19:38,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55939 states, 55938 states have (on average 1.121062605026994) internal successors, (62710), 55938 states have internal predecessors, (62710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:38,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55939 states to 55939 states and 62710 transitions. [2025-03-16 15:19:38,299 INFO L78 Accepts]: Start accepts. Automaton has 55939 states and 62710 transitions. Word has length 345 [2025-03-16 15:19:38,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:38,300 INFO L471 AbstractCegarLoop]: Abstraction has 55939 states and 62710 transitions. [2025-03-16 15:19:38,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:38,300 INFO L276 IsEmpty]: Start isEmpty. Operand 55939 states and 62710 transitions. [2025-03-16 15:19:38,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-03-16 15:19:38,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:38,307 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-16 15:19:38,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 15:19:38,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-16 15:19:38,511 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:38,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:38,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1537167401, now seen corresponding path program 1 times [2025-03-16 15:19:38,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:38,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398428352] [2025-03-16 15:19:38,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:38,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:38,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-03-16 15:19:38,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-03-16 15:19:38,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:38,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:38,791 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 444 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-03-16 15:19:38,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:38,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398428352] [2025-03-16 15:19:38,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398428352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:38,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:38,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:38,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440757267] [2025-03-16 15:19:38,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:38,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:38,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:38,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:38,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:38,794 INFO L87 Difference]: Start difference. First operand 55939 states and 62710 transitions. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:40,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:40,191 INFO L93 Difference]: Finished difference Result 121240 states and 135986 transitions. [2025-03-16 15:19:40,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:40,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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 442 [2025-03-16 15:19:40,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:40,259 INFO L225 Difference]: With dead ends: 121240 [2025-03-16 15:19:40,259 INFO L226 Difference]: Without dead ends: 64877 [2025-03-16 15:19:40,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:40,298 INFO L435 NwaCegarLoop]: 716 mSDtfsCounter, 339 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:40,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 772 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:19:40,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64877 states. [2025-03-16 15:19:40,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64877 to 53349. [2025-03-16 15:19:40,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53349 states, 53348 states have (on average 1.107689135487741) internal successors, (59093), 53348 states have internal predecessors, (59093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:40,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53349 states to 53349 states and 59093 transitions. [2025-03-16 15:19:40,867 INFO L78 Accepts]: Start accepts. Automaton has 53349 states and 59093 transitions. Word has length 442 [2025-03-16 15:19:40,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:40,867 INFO L471 AbstractCegarLoop]: Abstraction has 53349 states and 59093 transitions. [2025-03-16 15:19:40,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:40,867 INFO L276 IsEmpty]: Start isEmpty. Operand 53349 states and 59093 transitions. [2025-03-16 15:19:40,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-03-16 15:19:40,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:40,873 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-16 15:19:40,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:19:40,873 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:40,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:40,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1226303232, now seen corresponding path program 1 times [2025-03-16 15:19:40,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:40,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787298496] [2025-03-16 15:19:40,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:40,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:40,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-03-16 15:19:40,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-03-16 15:19:40,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:40,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:41,278 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 563 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-03-16 15:19:41,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:41,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787298496] [2025-03-16 15:19:41,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787298496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:41,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:41,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:41,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217767274] [2025-03-16 15:19:41,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:41,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:41,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:41,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:41,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:41,280 INFO L87 Difference]: Start difference. First operand 53349 states and 59093 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:42,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:42,763 INFO L93 Difference]: Finished difference Result 119900 states and 132833 transitions. [2025-03-16 15:19:42,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:42,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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 443 [2025-03-16 15:19:42,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:42,836 INFO L225 Difference]: With dead ends: 119900 [2025-03-16 15:19:42,836 INFO L226 Difference]: Without dead ends: 63989 [2025-03-16 15:19:42,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:42,875 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 437 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:42,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 657 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:19:42,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63989 states. [2025-03-16 15:19:43,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63989 to 61850. [2025-03-16 15:19:43,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61850 states, 61849 states have (on average 1.0961211984025612) internal successors, (67794), 61849 states have internal predecessors, (67794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:43,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61850 states to 61850 states and 67794 transitions. [2025-03-16 15:19:43,520 INFO L78 Accepts]: Start accepts. Automaton has 61850 states and 67794 transitions. Word has length 443 [2025-03-16 15:19:43,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:43,521 INFO L471 AbstractCegarLoop]: Abstraction has 61850 states and 67794 transitions. [2025-03-16 15:19:43,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:43,521 INFO L276 IsEmpty]: Start isEmpty. Operand 61850 states and 67794 transitions. [2025-03-16 15:19:43,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-03-16 15:19:43,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:43,528 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-16 15:19:43,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:19:43,528 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:43,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:43,528 INFO L85 PathProgramCache]: Analyzing trace with hash -477221353, now seen corresponding path program 1 times [2025-03-16 15:19:43,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:43,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106111997] [2025-03-16 15:19:43,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:43,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:43,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-03-16 15:19:43,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-03-16 15:19:43,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:43,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:43,890 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-16 15:19:43,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:43,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106111997] [2025-03-16 15:19:43,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106111997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:43,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:43,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:19:43,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794997015] [2025-03-16 15:19:43,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:43,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:19:43,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:43,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:19:43,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:19:43,891 INFO L87 Difference]: Start difference. First operand 61850 states and 67794 transitions. Second operand has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:46,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:46,187 INFO L93 Difference]: Finished difference Result 145470 states and 159570 transitions. [2025-03-16 15:19:46,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:19:46,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 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 447 [2025-03-16 15:19:46,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:46,277 INFO L225 Difference]: With dead ends: 145470 [2025-03-16 15:19:46,277 INFO L226 Difference]: Without dead ends: 83621 [2025-03-16 15:19:46,296 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-03-16 15:19:46,298 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 816 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 2339 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 2769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 2339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:46,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 218 Invalid, 2769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 2339 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 15:19:46,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83621 states. [2025-03-16 15:19:47,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83621 to 78924. [2025-03-16 15:19:47,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78924 states, 78923 states have (on average 1.097968906402443) internal successors, (86655), 78923 states have internal predecessors, (86655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:47,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78924 states to 78924 states and 86655 transitions. [2025-03-16 15:19:47,147 INFO L78 Accepts]: Start accepts. Automaton has 78924 states and 86655 transitions. Word has length 447 [2025-03-16 15:19:47,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:47,147 INFO L471 AbstractCegarLoop]: Abstraction has 78924 states and 86655 transitions. [2025-03-16 15:19:47,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:47,147 INFO L276 IsEmpty]: Start isEmpty. Operand 78924 states and 86655 transitions. [2025-03-16 15:19:47,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-03-16 15:19:47,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:47,153 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-16 15:19:47,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:19:47,153 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:47,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:47,153 INFO L85 PathProgramCache]: Analyzing trace with hash 2006048557, now seen corresponding path program 1 times [2025-03-16 15:19:47,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:47,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901281486] [2025-03-16 15:19:47,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:47,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:47,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-16 15:19:47,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-16 15:19:47,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:47,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:47,475 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 602 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-16 15:19:47,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:47,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901281486] [2025-03-16 15:19:47,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901281486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:47,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:47,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:47,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622156767] [2025-03-16 15:19:47,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:47,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:47,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:47,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:47,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:47,477 INFO L87 Difference]: Start difference. First operand 78924 states and 86655 transitions. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:49,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:49,033 INFO L93 Difference]: Finished difference Result 167640 states and 184226 transitions. [2025-03-16 15:19:49,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:49,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 466 [2025-03-16 15:19:49,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:49,142 INFO L225 Difference]: With dead ends: 167640 [2025-03-16 15:19:49,142 INFO L226 Difference]: Without dead ends: 88717 [2025-03-16 15:19:49,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:49,202 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 385 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 1420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:49,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 325 Invalid, 1420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:19:49,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88717 states. [2025-03-16 15:19:50,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88717 to 88285. [2025-03-16 15:19:50,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88285 states, 88284 states have (on average 1.095340038965158) internal successors, (96701), 88284 states have internal predecessors, (96701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:50,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88285 states to 88285 states and 96701 transitions. [2025-03-16 15:19:50,165 INFO L78 Accepts]: Start accepts. Automaton has 88285 states and 96701 transitions. Word has length 466 [2025-03-16 15:19:50,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:50,166 INFO L471 AbstractCegarLoop]: Abstraction has 88285 states and 96701 transitions. [2025-03-16 15:19:50,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:50,166 INFO L276 IsEmpty]: Start isEmpty. Operand 88285 states and 96701 transitions. [2025-03-16 15:19:50,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2025-03-16 15:19:50,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:50,173 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-16 15:19:50,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:19:50,174 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:50,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:50,174 INFO L85 PathProgramCache]: Analyzing trace with hash -331002706, now seen corresponding path program 1 times [2025-03-16 15:19:50,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:50,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676750643] [2025-03-16 15:19:50,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:50,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:50,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 490 statements into 1 equivalence classes. [2025-03-16 15:19:50,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 490 of 490 statements. [2025-03-16 15:19:50,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:50,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:50,321 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2025-03-16 15:19:50,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:50,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676750643] [2025-03-16 15:19:50,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676750643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:50,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:50,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:50,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406316441] [2025-03-16 15:19:50,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:50,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:50,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:50,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:50,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:50,323 INFO L87 Difference]: Start difference. First operand 88285 states and 96701 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:51,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:51,933 INFO L93 Difference]: Finished difference Result 190189 states and 208576 transitions. [2025-03-16 15:19:51,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:51,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 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 490 [2025-03-16 15:19:51,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:52,053 INFO L225 Difference]: With dead ends: 190189 [2025-03-16 15:19:52,053 INFO L226 Difference]: Without dead ends: 101905 [2025-03-16 15:19:52,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:52,100 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 474 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:52,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 263 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:19:52,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101905 states. [2025-03-16 15:19:53,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101905 to 101448. [2025-03-16 15:19:53,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101448 states, 101447 states have (on average 1.0927972241663135) internal successors, (110861), 101447 states have internal predecessors, (110861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:53,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101448 states to 101448 states and 110861 transitions. [2025-03-16 15:19:53,505 INFO L78 Accepts]: Start accepts. Automaton has 101448 states and 110861 transitions. Word has length 490 [2025-03-16 15:19:53,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:53,505 INFO L471 AbstractCegarLoop]: Abstraction has 101448 states and 110861 transitions. [2025-03-16 15:19:53,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:53,506 INFO L276 IsEmpty]: Start isEmpty. Operand 101448 states and 110861 transitions. [2025-03-16 15:19:53,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2025-03-16 15:19:53,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:53,513 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:19:53,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 15:19:53,513 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:53,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:53,513 INFO L85 PathProgramCache]: Analyzing trace with hash 386709810, now seen corresponding path program 1 times [2025-03-16 15:19:53,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:53,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958320377] [2025-03-16 15:19:53,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:53,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:53,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 493 statements into 1 equivalence classes. [2025-03-16 15:19:53,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 493 of 493 statements. [2025-03-16 15:19:53,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:53,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:53,646 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-16 15:19:53,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:53,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958320377] [2025-03-16 15:19:53,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958320377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:53,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:53,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:53,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133817499] [2025-03-16 15:19:53,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:53,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:53,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:53,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:53,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:53,648 INFO L87 Difference]: Start difference. First operand 101448 states and 110861 transitions. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:55,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:55,156 INFO L93 Difference]: Finished difference Result 208446 states and 227580 transitions. [2025-03-16 15:19:55,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:55,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 493 [2025-03-16 15:19:55,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:55,266 INFO L225 Difference]: With dead ends: 208446 [2025-03-16 15:19:55,266 INFO L226 Difference]: Without dead ends: 105292 [2025-03-16 15:19:55,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:55,320 INFO L435 NwaCegarLoop]: 751 mSDtfsCounter, 401 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:55,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 805 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:19:55,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105292 states. [2025-03-16 15:19:56,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105292 to 102291. [2025-03-16 15:19:56,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102291 states, 102290 states have (on average 1.0912112620979568) internal successors, (111620), 102290 states have internal predecessors, (111620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:56,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102291 states to 102291 states and 111620 transitions. [2025-03-16 15:19:56,588 INFO L78 Accepts]: Start accepts. Automaton has 102291 states and 111620 transitions. Word has length 493 [2025-03-16 15:19:56,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:56,588 INFO L471 AbstractCegarLoop]: Abstraction has 102291 states and 111620 transitions. [2025-03-16 15:19:56,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:56,589 INFO L276 IsEmpty]: Start isEmpty. Operand 102291 states and 111620 transitions. [2025-03-16 15:19:56,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2025-03-16 15:19:56,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:56,602 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:56,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 15:19:56,603 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:56,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:56,603 INFO L85 PathProgramCache]: Analyzing trace with hash 342523728, now seen corresponding path program 1 times [2025-03-16 15:19:56,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:56,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772360281] [2025-03-16 15:19:56,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:56,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:56,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 531 statements into 1 equivalence classes. [2025-03-16 15:19:56,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 531 of 531 statements. [2025-03-16 15:19:56,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:56,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:57,585 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 651 proven. 29 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-16 15:19:57,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:57,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772360281] [2025-03-16 15:19:57,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772360281] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:19:57,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923242007] [2025-03-16 15:19:57,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:57,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:19:57,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:19:57,587 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:19:57,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 15:19:57,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 531 statements into 1 equivalence classes. [2025-03-16 15:19:57,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 531 of 531 statements. [2025-03-16 15:19:57,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:57,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:57,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:19:57,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:19:58,000 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2025-03-16 15:19:58,000 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:19:58,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923242007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:58,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:19:58,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-03-16 15:19:58,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932423201] [2025-03-16 15:19:58,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:58,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:58,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:58,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:58,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:19:58,002 INFO L87 Difference]: Start difference. First operand 102291 states and 111620 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:00,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:00,215 INFO L93 Difference]: Finished difference Result 209693 states and 228649 transitions. [2025-03-16 15:20:00,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:20:00,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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 531 [2025-03-16 15:20:00,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:00,328 INFO L225 Difference]: With dead ends: 209693 [2025-03-16 15:20:00,328 INFO L226 Difference]: Without dead ends: 107401 [2025-03-16 15:20:00,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 530 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:20:00,393 INFO L435 NwaCegarLoop]: 723 mSDtfsCounter, 411 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:00,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 783 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 15:20:00,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107401 states. [2025-03-16 15:20:01,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107401 to 104420. [2025-03-16 15:20:01,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104420 states, 104419 states have (on average 1.088958905946236) internal successors, (113708), 104419 states have internal predecessors, (113708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:01,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104420 states to 104420 states and 113708 transitions. [2025-03-16 15:20:01,664 INFO L78 Accepts]: Start accepts. Automaton has 104420 states and 113708 transitions. Word has length 531 [2025-03-16 15:20:01,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:01,664 INFO L471 AbstractCegarLoop]: Abstraction has 104420 states and 113708 transitions. [2025-03-16 15:20:01,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:01,664 INFO L276 IsEmpty]: Start isEmpty. Operand 104420 states and 113708 transitions. [2025-03-16 15:20:01,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2025-03-16 15:20:01,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:01,674 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:20:01,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 15:20:01,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:20:01,877 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:01,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:01,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1114887644, now seen corresponding path program 1 times [2025-03-16 15:20:01,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:01,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947762270] [2025-03-16 15:20:01,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:01,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:01,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-03-16 15:20:01,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-03-16 15:20:01,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:01,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:02,122 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-16 15:20:02,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:02,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947762270] [2025-03-16 15:20:02,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947762270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:02,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:20:02,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:20:02,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238873156] [2025-03-16 15:20:02,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:02,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:20:02,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:02,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:20:02,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:20:02,124 INFO L87 Difference]: Start difference. First operand 104420 states and 113708 transitions. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:03,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:03,777 INFO L93 Difference]: Finished difference Result 215229 states and 234144 transitions. [2025-03-16 15:20:03,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:20:03,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 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 538 [2025-03-16 15:20:03,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:03,928 INFO L225 Difference]: With dead ends: 215229 [2025-03-16 15:20:03,928 INFO L226 Difference]: Without dead ends: 110799 [2025-03-16 15:20:04,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:20:04,002 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 446 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1231 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 1446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:04,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 658 Invalid, 1446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1231 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:20:04,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110799 states. [2025-03-16 15:20:05,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110799 to 107376. [2025-03-16 15:20:05,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107376 states, 107375 states have (on average 1.078267753201397) internal successors, (115779), 107375 states have internal predecessors, (115779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:05,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107376 states to 107376 states and 115779 transitions. [2025-03-16 15:20:05,984 INFO L78 Accepts]: Start accepts. Automaton has 107376 states and 115779 transitions. Word has length 538 [2025-03-16 15:20:05,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:05,985 INFO L471 AbstractCegarLoop]: Abstraction has 107376 states and 115779 transitions. [2025-03-16 15:20:05,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:05,985 INFO L276 IsEmpty]: Start isEmpty. Operand 107376 states and 115779 transitions. [2025-03-16 15:20:05,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2025-03-16 15:20:05,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:05,996 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:20:05,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 15:20:05,996 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:05,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:05,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1669821729, now seen corresponding path program 1 times [2025-03-16 15:20:05,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:05,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916071039] [2025-03-16 15:20:05,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:05,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:06,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-03-16 15:20:06,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-03-16 15:20:06,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:06,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:06,757 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 485 proven. 46 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-03-16 15:20:06,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:06,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916071039] [2025-03-16 15:20:06,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916071039] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:20:06,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100963572] [2025-03-16 15:20:06,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:06,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:20:06,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:20:06,760 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:20:06,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 15:20:06,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-03-16 15:20:06,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-03-16 15:20:06,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:06,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:06,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 15:20:06,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:20:08,155 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 485 proven. 46 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-03-16 15:20:08,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:20:09,159 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 531 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-03-16 15:20:09,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100963572] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:20:09,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:20:09,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 8 [2025-03-16 15:20:09,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881895534] [2025-03-16 15:20:09,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:09,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:20:09,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:09,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:20:09,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:20:09,161 INFO L87 Difference]: Start difference. First operand 107376 states and 115779 transitions. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:11,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:11,666 INFO L93 Difference]: Finished difference Result 224992 states and 242506 transitions. [2025-03-16 15:20:11,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:20:11,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 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 579 [2025-03-16 15:20:11,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:11,800 INFO L225 Difference]: With dead ends: 224992 [2025-03-16 15:20:11,801 INFO L226 Difference]: Without dead ends: 117191 [2025-03-16 15:20:11,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1161 GetRequests, 1155 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:20:11,869 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 732 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 2326 mSolverCounterSat, 465 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 2791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 465 IncrementalHoareTripleChecker+Valid, 2326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:11,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 108 Invalid, 2791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [465 Valid, 2326 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 15:20:11,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117191 states. [2025-03-16 15:20:13,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117191 to 107800. [2025-03-16 15:20:13,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107800 states, 107799 states have (on average 1.0776352285271662) internal successors, (116168), 107799 states have internal predecessors, (116168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:13,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107800 states to 107800 states and 116168 transitions. [2025-03-16 15:20:13,521 INFO L78 Accepts]: Start accepts. Automaton has 107800 states and 116168 transitions. Word has length 579 [2025-03-16 15:20:13,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:13,521 INFO L471 AbstractCegarLoop]: Abstraction has 107800 states and 116168 transitions. [2025-03-16 15:20:13,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:13,521 INFO L276 IsEmpty]: Start isEmpty. Operand 107800 states and 116168 transitions. [2025-03-16 15:20:13,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2025-03-16 15:20:13,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:13,536 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:20:13,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 15:20:13,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:20:13,741 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:13,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:13,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1480795407, now seen corresponding path program 1 times [2025-03-16 15:20:13,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:13,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045916317] [2025-03-16 15:20:13,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:13,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:13,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 622 statements into 1 equivalence classes. [2025-03-16 15:20:13,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 622 of 622 statements. [2025-03-16 15:20:13,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:13,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:14,372 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2025-03-16 15:20:14,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:14,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045916317] [2025-03-16 15:20:14,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045916317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:14,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:20:14,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:20:14,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189122439] [2025-03-16 15:20:14,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:14,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:20:14,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:14,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:20:14,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:20:14,374 INFO L87 Difference]: Start difference. First operand 107800 states and 116168 transitions. Second operand has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:16,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:16,479 INFO L93 Difference]: Finished difference Result 234374 states and 252431 transitions. [2025-03-16 15:20:16,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:20:16,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 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 622 [2025-03-16 15:20:16,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:16,621 INFO L225 Difference]: With dead ends: 234374 [2025-03-16 15:20:16,621 INFO L226 Difference]: Without dead ends: 126575 [2025-03-16 15:20:16,687 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-03-16 15:20:16,688 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 655 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 2278 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 2393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 2278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:16,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 274 Invalid, 2393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 2278 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 15:20:16,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126575 states. [2025-03-16 15:20:17,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126575 to 112914. [2025-03-16 15:20:17,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112914 states, 112913 states have (on average 1.0782815087722406) internal successors, (121752), 112913 states have internal predecessors, (121752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:18,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112914 states to 112914 states and 121752 transitions. [2025-03-16 15:20:18,145 INFO L78 Accepts]: Start accepts. Automaton has 112914 states and 121752 transitions. Word has length 622 [2025-03-16 15:20:18,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:18,145 INFO L471 AbstractCegarLoop]: Abstraction has 112914 states and 121752 transitions. [2025-03-16 15:20:18,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:18,145 INFO L276 IsEmpty]: Start isEmpty. Operand 112914 states and 121752 transitions. [2025-03-16 15:20:18,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2025-03-16 15:20:18,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:18,161 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-16 15:20:18,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 15:20:18,161 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:18,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:18,161 INFO L85 PathProgramCache]: Analyzing trace with hash -2133304515, now seen corresponding path program 1 times [2025-03-16 15:20:18,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:18,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186224935] [2025-03-16 15:20:18,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:18,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:18,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 633 statements into 1 equivalence classes. [2025-03-16 15:20:18,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 633 of 633 statements. [2025-03-16 15:20:18,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:18,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:18,317 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 447 proven. 0 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2025-03-16 15:20:18,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:18,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186224935] [2025-03-16 15:20:18,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186224935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:18,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:20:18,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:20:18,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381625409] [2025-03-16 15:20:18,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:18,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:20:18,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:18,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:20:18,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:20:18,319 INFO L87 Difference]: Start difference. First operand 112914 states and 121752 transitions. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:19,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:19,838 INFO L93 Difference]: Finished difference Result 226260 states and 244018 transitions. [2025-03-16 15:20:19,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:20:19,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 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 633 [2025-03-16 15:20:19,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:19,972 INFO L225 Difference]: With dead ends: 226260 [2025-03-16 15:20:19,972 INFO L226 Difference]: Without dead ends: 113772 [2025-03-16 15:20:20,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:20:20,033 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 491 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:20,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 641 Invalid, 1270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1105 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:20:20,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113772 states. [2025-03-16 15:20:21,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113772 to 113342. [2025-03-16 15:20:21,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113342 states, 113341 states have (on average 1.071633389506004) internal successors, (121460), 113341 states have internal predecessors, (121460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:21,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113342 states to 113342 states and 121460 transitions. [2025-03-16 15:20:21,352 INFO L78 Accepts]: Start accepts. Automaton has 113342 states and 121460 transitions. Word has length 633 [2025-03-16 15:20:21,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:21,352 INFO L471 AbstractCegarLoop]: Abstraction has 113342 states and 121460 transitions. [2025-03-16 15:20:21,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:21,353 INFO L276 IsEmpty]: Start isEmpty. Operand 113342 states and 121460 transitions. [2025-03-16 15:20:21,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 645 [2025-03-16 15:20:21,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:21,367 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:20:21,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 15:20:21,368 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:21,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:21,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1076798807, now seen corresponding path program 1 times [2025-03-16 15:20:21,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:21,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371289791] [2025-03-16 15:20:21,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:21,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms