./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label25.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label25.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 e174a47646cc352906a4c559dce6734a9432a39b7e8aac542f068ec793f56d82 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:36:23,818 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:36:23,873 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:36:23,878 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:36:23,880 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:36:23,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:36:23,902 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:36:23,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:36:23,903 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:36:23,903 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:36:23,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:36:23,903 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:36:23,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:36:23,904 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:36:23,904 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:36:23,904 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:36:23,904 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:36:23,905 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:36:23,905 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:36:23,905 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:36:23,905 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:36:23,905 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:36:23,905 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:36:23,905 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:36:23,905 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:36:23,905 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:36:23,905 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:36:23,905 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:36:23,905 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:36:23,905 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:36:23,906 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:36:23,906 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:36:23,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:36:23,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:36:23,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:36:23,906 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:36:23,906 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:36:23,906 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:36:23,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:36:23,907 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:36:23,907 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:36:23,907 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:36:23,907 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:36:23,907 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 -> e174a47646cc352906a4c559dce6734a9432a39b7e8aac542f068ec793f56d82 [2025-03-03 10:36:24,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:36:24,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:36:24,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:36:24,138 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:36:24,138 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:36:24,139 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label25.c [2025-03-03 10:36:25,211 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/914c776d1/f3bd09b85a3e4675b00b7692c7886f9b/FLAGcfb544886 [2025-03-03 10:36:25,581 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:36:25,582 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label25.c [2025-03-03 10:36:25,608 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/914c776d1/f3bd09b85a3e4675b00b7692c7886f9b/FLAGcfb544886 [2025-03-03 10:36:25,777 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/914c776d1/f3bd09b85a3e4675b00b7692c7886f9b [2025-03-03 10:36:25,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:36:25,780 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:36:25,781 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:36:25,781 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:36:25,784 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:36:25,784 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:36:25" (1/1) ... [2025-03-03 10:36:25,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2959b12a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:25, skipping insertion in model container [2025-03-03 10:36:25,785 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:36:25" (1/1) ... [2025-03-03 10:36:25,863 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:36:26,049 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/Problem12_label25.c[2447,2460] [2025-03-03 10:36:26,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:36:26,572 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:36:26,583 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/Problem12_label25.c[2447,2460] [2025-03-03 10:36:26,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:36:26,847 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:36:26,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:26 WrapperNode [2025-03-03 10:36:26,849 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:36:26,850 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:36:26,850 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:36:26,850 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:36:26,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:26" (1/1) ... [2025-03-03 10:36:26,885 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:26" (1/1) ... [2025-03-03 10:36:27,129 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-03-03 10:36:27,129 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:36:27,130 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:36:27,130 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:36:27,130 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:36:27,136 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:26" (1/1) ... [2025-03-03 10:36:27,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:26" (1/1) ... [2025-03-03 10:36:27,161 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:26" (1/1) ... [2025-03-03 10:36:27,266 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 10:36:27,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:26" (1/1) ... [2025-03-03 10:36:27,267 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:26" (1/1) ... [2025-03-03 10:36:27,345 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:26" (1/1) ... [2025-03-03 10:36:27,362 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:26" (1/1) ... [2025-03-03 10:36:27,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:26" (1/1) ... [2025-03-03 10:36:27,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:26" (1/1) ... [2025-03-03 10:36:27,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:36:27,432 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:36:27,432 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:36:27,432 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:36:27,433 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:26" (1/1) ... [2025-03-03 10:36:27,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:36:27,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:36:27,458 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 10:36:27,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 10:36:27,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:36:27,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:36:27,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:36:27,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:36:27,529 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:36:27,531 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:36:30,707 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2025-03-03 10:36:30,707 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2025-03-03 10:36:30,707 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2025-03-03 10:36:30,876 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-03-03 10:36:30,876 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:36:30,901 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:36:30,905 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:36:30,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:36:30 BoogieIcfgContainer [2025-03-03 10:36:30,907 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:36:30,909 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:36:30,909 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:36:30,913 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:36:30,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:36:25" (1/3) ... [2025-03-03 10:36:30,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518fe2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:36:30, skipping insertion in model container [2025-03-03 10:36:30,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:26" (2/3) ... [2025-03-03 10:36:30,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518fe2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:36:30, skipping insertion in model container [2025-03-03 10:36:30,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:36:30" (3/3) ... [2025-03-03 10:36:30,915 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label25.c [2025-03-03 10:36:30,928 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:36:30,929 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label25.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:36:30,997 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:36:31,006 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;@10351cbc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:36:31,007 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:36:31,013 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:31,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 10:36:31,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:31,017 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:36:31,017 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:31,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:31,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1363245088, now seen corresponding path program 1 times [2025-03-03 10:36:31,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:31,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264451588] [2025-03-03 10:36:31,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:31,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:31,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 10:36:31,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 10:36:31,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:31,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:31,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:36:31,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:31,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264451588] [2025-03-03 10:36:31,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264451588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:31,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:31,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:36:31,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883170248] [2025-03-03 10:36:31,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:31,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:31,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:31,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:31,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:31,203 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:33,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:33,944 INFO L93 Difference]: Finished difference Result 2388 states and 4626 transitions. [2025-03-03 10:36:33,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:33,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2025-03-03 10:36:33,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:33,963 INFO L225 Difference]: With dead ends: 2388 [2025-03-03 10:36:33,963 INFO L226 Difference]: Without dead ends: 1506 [2025-03-03 10:36:33,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:33,969 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 880 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 3208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 2437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:33,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 156 Invalid, 3208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 2437 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 10:36:33,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-03-03 10:36:34,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2025-03-03 10:36:34,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.8458471760797341) internal successors, (2778), 1505 states have internal predecessors, (2778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:34,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2778 transitions. [2025-03-03 10:36:34,059 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2778 transitions. Word has length 17 [2025-03-03 10:36:34,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:34,059 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2778 transitions. [2025-03-03 10:36:34,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:34,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2778 transitions. [2025-03-03 10:36:34,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 10:36:34,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:34,062 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 10:36:34,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:36:34,063 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:34,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:34,063 INFO L85 PathProgramCache]: Analyzing trace with hash 269017272, now seen corresponding path program 1 times [2025-03-03 10:36:34,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:34,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124936183] [2025-03-03 10:36:34,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:34,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:34,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 10:36:34,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 10:36:34,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:34,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:34,451 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:36:34,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:34,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124936183] [2025-03-03 10:36:34,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124936183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:34,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:34,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:36:34,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776734856] [2025-03-03 10:36:34,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:34,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:36:34,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:34,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:36:34,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:36:34,453 INFO L87 Difference]: Start difference. First operand 1506 states and 2778 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:38,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:38,731 INFO L93 Difference]: Finished difference Result 5263 states and 9668 transitions. [2025-03-03 10:36:38,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:36:38,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-03-03 10:36:38,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:38,743 INFO L225 Difference]: With dead ends: 5263 [2025-03-03 10:36:38,743 INFO L226 Difference]: Without dead ends: 3759 [2025-03-03 10:36:38,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:36:38,746 INFO L435 NwaCegarLoop]: 693 mSDtfsCounter, 2177 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 5155 mSolverCounterSat, 1148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2177 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 6303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1148 IncrementalHoareTripleChecker+Valid, 5155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:38,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2177 Valid, 710 Invalid, 6303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1148 Valid, 5155 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-03-03 10:36:38,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3759 states. [2025-03-03 10:36:38,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3759 to 3759. [2025-03-03 10:36:38,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3759 states, 3758 states have (on average 1.5721128259712613) internal successors, (5908), 3758 states have internal predecessors, (5908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:38,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 5908 transitions. [2025-03-03 10:36:38,800 INFO L78 Accepts]: Start accepts. Automaton has 3759 states and 5908 transitions. Word has length 86 [2025-03-03 10:36:38,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:38,800 INFO L471 AbstractCegarLoop]: Abstraction has 3759 states and 5908 transitions. [2025-03-03 10:36:38,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:38,800 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 5908 transitions. [2025-03-03 10:36:38,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 10:36:38,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:38,801 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 10:36:38,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:36:38,802 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:38,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:38,803 INFO L85 PathProgramCache]: Analyzing trace with hash 657085725, now seen corresponding path program 1 times [2025-03-03 10:36:38,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:38,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268253570] [2025-03-03 10:36:38,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:38,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:38,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 10:36:38,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 10:36:38,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:38,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:38,913 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:36:38,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:38,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268253570] [2025-03-03 10:36:38,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268253570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:38,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:38,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:36:38,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993578784] [2025-03-03 10:36:38,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:38,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:38,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:38,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:38,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:38,915 INFO L87 Difference]: Start difference. First operand 3759 states and 5908 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:40,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:40,888 INFO L93 Difference]: Finished difference Result 7516 states and 11814 transitions. [2025-03-03 10:36:40,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:40,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-03-03 10:36:40,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:40,900 INFO L225 Difference]: With dead ends: 7516 [2025-03-03 10:36:40,901 INFO L226 Difference]: Without dead ends: 3759 [2025-03-03 10:36:40,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:40,907 INFO L435 NwaCegarLoop]: 1186 mSDtfsCounter, 846 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2099 mSolverCounterSat, 676 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 2775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 676 IncrementalHoareTripleChecker+Valid, 2099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:40,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 1194 Invalid, 2775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [676 Valid, 2099 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:36:40,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3759 states. [2025-03-03 10:36:40,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3759 to 3759. [2025-03-03 10:36:40,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3759 states, 3758 states have (on average 1.3610963278339543) internal successors, (5115), 3758 states have internal predecessors, (5115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:40,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 5115 transitions. [2025-03-03 10:36:40,962 INFO L78 Accepts]: Start accepts. Automaton has 3759 states and 5115 transitions. Word has length 88 [2025-03-03 10:36:40,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:40,963 INFO L471 AbstractCegarLoop]: Abstraction has 3759 states and 5115 transitions. [2025-03-03 10:36:40,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:40,963 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 5115 transitions. [2025-03-03 10:36:40,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 10:36:40,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:40,968 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:36:40,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:36:40,968 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:40,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:40,969 INFO L85 PathProgramCache]: Analyzing trace with hash -202833445, now seen corresponding path program 1 times [2025-03-03 10:36:40,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:40,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485577301] [2025-03-03 10:36:40,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:40,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:40,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 10:36:40,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 10:36:40,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:40,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:41,232 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:36:41,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:41,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485577301] [2025-03-03 10:36:41,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485577301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:41,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:41,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:36:41,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951719873] [2025-03-03 10:36:41,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:41,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:36:41,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:41,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:36:41,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:36:41,234 INFO L87 Difference]: Start difference. First operand 3759 states and 5115 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:43,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:43,849 INFO L93 Difference]: Finished difference Result 9808 states and 13612 transitions. [2025-03-03 10:36:43,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:36:43,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2025-03-03 10:36:43,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:43,865 INFO L225 Difference]: With dead ends: 9808 [2025-03-03 10:36:43,865 INFO L226 Difference]: Without dead ends: 6014 [2025-03-03 10:36:43,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:36:43,870 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 690 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 3806 mSolverCounterSat, 633 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 4439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 633 IncrementalHoareTripleChecker+Valid, 3806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:43,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 713 Invalid, 4439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [633 Valid, 3806 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:36:43,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6014 states. [2025-03-03 10:36:43,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6014 to 6012. [2025-03-03 10:36:43,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6012 states, 6011 states have (on average 1.2417235069040093) internal successors, (7464), 6011 states have internal predecessors, (7464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:43,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6012 states to 6012 states and 7464 transitions. [2025-03-03 10:36:43,943 INFO L78 Accepts]: Start accepts. Automaton has 6012 states and 7464 transitions. Word has length 157 [2025-03-03 10:36:43,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:43,944 INFO L471 AbstractCegarLoop]: Abstraction has 6012 states and 7464 transitions. [2025-03-03 10:36:43,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:43,944 INFO L276 IsEmpty]: Start isEmpty. Operand 6012 states and 7464 transitions. [2025-03-03 10:36:43,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-03-03 10:36:43,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:43,947 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 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-03 10:36:43,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:36:43,947 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:43,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:43,948 INFO L85 PathProgramCache]: Analyzing trace with hash 250354255, now seen corresponding path program 1 times [2025-03-03 10:36:43,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:43,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253742272] [2025-03-03 10:36:43,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:43,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:43,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-03 10:36:43,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-03 10:36:43,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:43,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:44,142 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-03-03 10:36:44,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:44,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253742272] [2025-03-03 10:36:44,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253742272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:44,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:44,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:36:44,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710093983] [2025-03-03 10:36:44,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:44,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:44,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:44,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:44,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:44,144 INFO L87 Difference]: Start difference. First operand 6012 states and 7464 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:46,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:46,192 INFO L93 Difference]: Finished difference Result 14275 states and 17805 transitions. [2025-03-03 10:36:46,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:46,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 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 262 [2025-03-03 10:36:46,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:46,208 INFO L225 Difference]: With dead ends: 14275 [2025-03-03 10:36:46,208 INFO L226 Difference]: Without dead ends: 8265 [2025-03-03 10:36:46,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:46,212 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 697 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1973 mSolverCounterSat, 798 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 2771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 798 IncrementalHoareTripleChecker+Valid, 1973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:46,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 427 Invalid, 2771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [798 Valid, 1973 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:36:46,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8265 states. [2025-03-03 10:36:46,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8265 to 8265. [2025-03-03 10:36:46,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8265 states, 8264 states have (on average 1.134922555663117) internal successors, (9379), 8264 states have internal predecessors, (9379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:46,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8265 states to 8265 states and 9379 transitions. [2025-03-03 10:36:46,299 INFO L78 Accepts]: Start accepts. Automaton has 8265 states and 9379 transitions. Word has length 262 [2025-03-03 10:36:46,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:46,299 INFO L471 AbstractCegarLoop]: Abstraction has 8265 states and 9379 transitions. [2025-03-03 10:36:46,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:46,300 INFO L276 IsEmpty]: Start isEmpty. Operand 8265 states and 9379 transitions. [2025-03-03 10:36:46,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-03-03 10:36:46,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:46,302 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:36:46,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:36:46,303 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:46,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:46,303 INFO L85 PathProgramCache]: Analyzing trace with hash 548346171, now seen corresponding path program 1 times [2025-03-03 10:36:46,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:46,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275020123] [2025-03-03 10:36:46,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:46,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:46,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-03 10:36:46,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-03 10:36:46,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:46,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:46,615 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-03 10:36:46,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:46,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275020123] [2025-03-03 10:36:46,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275020123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:46,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:46,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:36:46,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514125788] [2025-03-03 10:36:46,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:46,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:36:46,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:46,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:36:46,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:36:46,619 INFO L87 Difference]: Start difference. First operand 8265 states and 9379 transitions. Second operand has 4 states, 4 states have (on average 59.25) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:49,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:49,115 INFO L93 Difference]: Finished difference Result 21073 states and 24295 transitions. [2025-03-03 10:36:49,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:36:49,116 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.25) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 306 [2025-03-03 10:36:49,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:49,139 INFO L225 Difference]: With dead ends: 21073 [2025-03-03 10:36:49,139 INFO L226 Difference]: Without dead ends: 12773 [2025-03-03 10:36:49,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:36:49,147 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 775 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 3718 mSolverCounterSat, 542 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 4260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 542 IncrementalHoareTripleChecker+Valid, 3718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:49,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 327 Invalid, 4260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [542 Valid, 3718 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:36:49,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12773 states. [2025-03-03 10:36:49,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12773 to 12020. [2025-03-03 10:36:49,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12020 states, 12019 states have (on average 1.1213911307097095) internal successors, (13478), 12019 states have internal predecessors, (13478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:49,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12020 states to 12020 states and 13478 transitions. [2025-03-03 10:36:49,267 INFO L78 Accepts]: Start accepts. Automaton has 12020 states and 13478 transitions. Word has length 306 [2025-03-03 10:36:49,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:49,267 INFO L471 AbstractCegarLoop]: Abstraction has 12020 states and 13478 transitions. [2025-03-03 10:36:49,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.25) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:49,268 INFO L276 IsEmpty]: Start isEmpty. Operand 12020 states and 13478 transitions. [2025-03-03 10:36:49,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-03-03 10:36:49,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:49,270 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-03 10:36:49,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:36:49,271 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:49,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:49,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1807469372, now seen corresponding path program 1 times [2025-03-03 10:36:49,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:49,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998144617] [2025-03-03 10:36:49,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:49,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:49,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-03 10:36:49,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-03 10:36:49,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:49,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:49,415 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 10:36:49,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:49,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998144617] [2025-03-03 10:36:49,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998144617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:49,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:49,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:36:49,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541281912] [2025-03-03 10:36:49,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:49,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:49,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:49,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:49,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:49,419 INFO L87 Difference]: Start difference. First operand 12020 states and 13478 transitions. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:51,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:51,735 INFO L93 Difference]: Finished difference Result 33050 states and 37374 transitions. [2025-03-03 10:36:51,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:51,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 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 312 [2025-03-03 10:36:51,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:51,766 INFO L225 Difference]: With dead ends: 33050 [2025-03-03 10:36:51,766 INFO L226 Difference]: Without dead ends: 21032 [2025-03-03 10:36:51,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:51,778 INFO L435 NwaCegarLoop]: 1333 mSDtfsCounter, 670 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2686 mSolverCounterSat, 370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 3056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 2686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:51,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 1340 Invalid, 3056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 2686 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:36:51,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21032 states. [2025-03-03 10:36:51,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21032 to 20281. [2025-03-03 10:36:51,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20281 states, 20280 states have (on average 1.1202169625246547) internal successors, (22718), 20280 states have internal predecessors, (22718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:51,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20281 states to 20281 states and 22718 transitions. [2025-03-03 10:36:51,958 INFO L78 Accepts]: Start accepts. Automaton has 20281 states and 22718 transitions. Word has length 312 [2025-03-03 10:36:51,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:51,959 INFO L471 AbstractCegarLoop]: Abstraction has 20281 states and 22718 transitions. [2025-03-03 10:36:51,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:51,959 INFO L276 IsEmpty]: Start isEmpty. Operand 20281 states and 22718 transitions. [2025-03-03 10:36:51,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-03-03 10:36:51,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:51,962 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-03 10:36:51,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:36:51,962 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:51,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:51,963 INFO L85 PathProgramCache]: Analyzing trace with hash -2129479410, now seen corresponding path program 1 times [2025-03-03 10:36:51,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:51,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807674311] [2025-03-03 10:36:51,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:51,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:52,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-03-03 10:36:52,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-03-03 10:36:52,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:52,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:52,263 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 10:36:52,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:52,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807674311] [2025-03-03 10:36:52,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807674311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:52,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:52,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:36:52,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595711186] [2025-03-03 10:36:52,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:52,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:52,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:52,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:52,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:52,265 INFO L87 Difference]: Start difference. First operand 20281 states and 22718 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:54,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:54,526 INFO L93 Difference]: Finished difference Result 55580 states and 62686 transitions. [2025-03-03 10:36:54,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:54,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 316 [2025-03-03 10:36:54,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:54,570 INFO L225 Difference]: With dead ends: 55580 [2025-03-03 10:36:54,570 INFO L226 Difference]: Without dead ends: 35301 [2025-03-03 10:36:54,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:54,590 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 723 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2207 mSolverCounterSat, 694 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 2901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 694 IncrementalHoareTripleChecker+Valid, 2207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:54,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 377 Invalid, 2901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [694 Valid, 2207 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:36:54,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35301 states. [2025-03-03 10:36:54,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35301 to 34550. [2025-03-03 10:36:54,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34550 states, 34549 states have (on average 1.1107123216301484) internal successors, (38374), 34549 states have internal predecessors, (38374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:55,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34550 states to 34550 states and 38374 transitions. [2025-03-03 10:36:55,026 INFO L78 Accepts]: Start accepts. Automaton has 34550 states and 38374 transitions. Word has length 316 [2025-03-03 10:36:55,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:55,026 INFO L471 AbstractCegarLoop]: Abstraction has 34550 states and 38374 transitions. [2025-03-03 10:36:55,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:55,026 INFO L276 IsEmpty]: Start isEmpty. Operand 34550 states and 38374 transitions. [2025-03-03 10:36:55,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-03-03 10:36:55,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:55,031 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-03 10:36:55,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:36:55,031 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:55,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:55,032 INFO L85 PathProgramCache]: Analyzing trace with hash 840828094, now seen corresponding path program 1 times [2025-03-03 10:36:55,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:55,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589202808] [2025-03-03 10:36:55,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:55,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:55,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-03 10:36:55,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-03 10:36:55,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:55,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:55,466 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-03 10:36:55,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:55,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589202808] [2025-03-03 10:36:55,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589202808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:55,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:55,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:36:55,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479626751] [2025-03-03 10:36:55,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:55,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:55,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:55,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:55,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:55,468 INFO L87 Difference]: Start difference. First operand 34550 states and 38374 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:57,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:57,662 INFO L93 Difference]: Finished difference Result 81865 states and 91998 transitions. [2025-03-03 10:36:57,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:57,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 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-03 10:36:57,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:57,712 INFO L225 Difference]: With dead ends: 81865 [2025-03-03 10:36:57,712 INFO L226 Difference]: Without dead ends: 47317 [2025-03-03 10:36:57,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:57,726 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 790 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2029 mSolverCounterSat, 974 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 3003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 974 IncrementalHoareTripleChecker+Valid, 2029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:57,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 155 Invalid, 3003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [974 Valid, 2029 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:36:57,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47317 states. [2025-03-03 10:36:58,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47317 to 46566. [2025-03-03 10:36:58,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46566 states, 46565 states have (on average 1.1208418339954902) internal successors, (52192), 46565 states have internal predecessors, (52192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:58,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46566 states to 46566 states and 52192 transitions. [2025-03-03 10:36:58,125 INFO L78 Accepts]: Start accepts. Automaton has 46566 states and 52192 transitions. Word has length 345 [2025-03-03 10:36:58,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:58,126 INFO L471 AbstractCegarLoop]: Abstraction has 46566 states and 52192 transitions. [2025-03-03 10:36:58,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:58,126 INFO L276 IsEmpty]: Start isEmpty. Operand 46566 states and 52192 transitions. [2025-03-03 10:36:58,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-03-03 10:36:58,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:58,129 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:36:58,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:36:58,129 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:58,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:58,131 INFO L85 PathProgramCache]: Analyzing trace with hash -70848418, now seen corresponding path program 1 times [2025-03-03 10:36:58,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:58,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345686583] [2025-03-03 10:36:58,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:58,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:58,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-03 10:36:58,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-03 10:36:58,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:58,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:58,294 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 10:36:58,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:58,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345686583] [2025-03-03 10:36:58,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345686583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:58,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:58,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:36:58,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277789668] [2025-03-03 10:36:58,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:58,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:58,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:58,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:58,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:58,297 INFO L87 Difference]: Start difference. First operand 46566 states and 52192 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:00,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:00,407 INFO L93 Difference]: Finished difference Result 106648 states and 119790 transitions. [2025-03-03 10:37:00,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:37:00,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 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-03 10:37:00,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:00,495 INFO L225 Difference]: With dead ends: 106648 [2025-03-03 10:37:00,495 INFO L226 Difference]: Without dead ends: 60084 [2025-03-03 10:37:00,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:00,525 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 758 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2076 mSolverCounterSat, 682 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 2758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 682 IncrementalHoareTripleChecker+Valid, 2076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:00,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 258 Invalid, 2758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [682 Valid, 2076 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:37:00,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60084 states. [2025-03-03 10:37:00,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60084 to 60084. [2025-03-03 10:37:00,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60084 states, 60083 states have (on average 1.1142752525672819) internal successors, (66949), 60083 states have internal predecessors, (66949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:00,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60084 states to 60084 states and 66949 transitions. [2025-03-03 10:37:00,991 INFO L78 Accepts]: Start accepts. Automaton has 60084 states and 66949 transitions. Word has length 345 [2025-03-03 10:37:00,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:00,991 INFO L471 AbstractCegarLoop]: Abstraction has 60084 states and 66949 transitions. [2025-03-03 10:37:00,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:00,991 INFO L276 IsEmpty]: Start isEmpty. Operand 60084 states and 66949 transitions. [2025-03-03 10:37:00,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-03-03 10:37:00,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:00,994 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:37:00,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:37:00,994 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:00,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:00,994 INFO L85 PathProgramCache]: Analyzing trace with hash -156848962, now seen corresponding path program 1 times [2025-03-03 10:37:00,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:00,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968040978] [2025-03-03 10:37:00,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:00,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:01,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-03-03 10:37:01,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-03-03 10:37:01,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:01,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:01,226 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-03-03 10:37:01,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:01,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968040978] [2025-03-03 10:37:01,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968040978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:01,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:37:01,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:37:01,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389876562] [2025-03-03 10:37:01,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:01,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:37:01,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:01,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:37:01,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:01,228 INFO L87 Difference]: Start difference. First operand 60084 states and 66949 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-03 10:37:03,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:03,405 INFO L93 Difference]: Finished difference Result 152459 states and 170850 transitions. [2025-03-03 10:37:03,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:37:03,406 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 348 [2025-03-03 10:37:03,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:03,500 INFO L225 Difference]: With dead ends: 152459 [2025-03-03 10:37:03,500 INFO L226 Difference]: Without dead ends: 87120 [2025-03-03 10:37:03,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:03,673 INFO L435 NwaCegarLoop]: 1263 mSDtfsCounter, 785 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2195 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 2613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 2195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:03,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 1271 Invalid, 2613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 2195 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 10:37:03,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87120 states. [2025-03-03 10:37:04,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87120 to 85618. [2025-03-03 10:37:04,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85618 states, 85617 states have (on average 1.1018956515645257) internal successors, (94341), 85617 states have internal predecessors, (94341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:04,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85618 states to 85618 states and 94341 transitions. [2025-03-03 10:37:04,588 INFO L78 Accepts]: Start accepts. Automaton has 85618 states and 94341 transitions. Word has length 348 [2025-03-03 10:37:04,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:04,589 INFO L471 AbstractCegarLoop]: Abstraction has 85618 states and 94341 transitions. [2025-03-03 10:37:04,589 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-03 10:37:04,589 INFO L276 IsEmpty]: Start isEmpty. Operand 85618 states and 94341 transitions. [2025-03-03 10:37:04,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-03-03 10:37:04,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:04,593 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:37:04,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:37:04,593 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:04,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:04,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1867392338, now seen corresponding path program 1 times [2025-03-03 10:37:04,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:04,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585406874] [2025-03-03 10:37:04,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:04,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:04,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-03-03 10:37:04,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-03-03 10:37:04,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:04,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:04,776 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-03 10:37:04,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:04,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585406874] [2025-03-03 10:37:04,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585406874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:04,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:37:04,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:37:04,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648644206] [2025-03-03 10:37:04,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:04,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:37:04,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:04,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:37:04,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:04,778 INFO L87 Difference]: Start difference. First operand 85618 states and 94341 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:06,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:06,993 INFO L93 Difference]: Finished difference Result 170483 states and 187924 transitions. [2025-03-03 10:37:06,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:37:06,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 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 377 [2025-03-03 10:37:06,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:07,078 INFO L225 Difference]: With dead ends: 170483 [2025-03-03 10:37:07,078 INFO L226 Difference]: Without dead ends: 85618 [2025-03-03 10:37:07,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:07,116 INFO L435 NwaCegarLoop]: 1254 mSDtfsCounter, 669 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2214 mSolverCounterSat, 429 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 2643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 429 IncrementalHoareTripleChecker+Valid, 2214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:07,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 1262 Invalid, 2643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [429 Valid, 2214 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:37:07,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85618 states. [2025-03-03 10:37:07,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85618 to 82614. [2025-03-03 10:37:07,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82614 states, 82613 states have (on average 1.07648917240628) internal successors, (88932), 82613 states have internal predecessors, (88932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:08,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82614 states to 82614 states and 88932 transitions. [2025-03-03 10:37:08,005 INFO L78 Accepts]: Start accepts. Automaton has 82614 states and 88932 transitions. Word has length 377 [2025-03-03 10:37:08,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:08,005 INFO L471 AbstractCegarLoop]: Abstraction has 82614 states and 88932 transitions. [2025-03-03 10:37:08,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:08,005 INFO L276 IsEmpty]: Start isEmpty. Operand 82614 states and 88932 transitions. [2025-03-03 10:37:08,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2025-03-03 10:37:08,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:08,010 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-03 10:37:08,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:37:08,010 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:08,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:08,011 INFO L85 PathProgramCache]: Analyzing trace with hash -815175810, now seen corresponding path program 1 times [2025-03-03 10:37:08,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:08,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184306654] [2025-03-03 10:37:08,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:08,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:08,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-03-03 10:37:08,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-03-03 10:37:08,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:08,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:08,171 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 489 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-03 10:37:08,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:08,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184306654] [2025-03-03 10:37:08,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184306654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:08,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:37:08,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:37:08,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869078867] [2025-03-03 10:37:08,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:08,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:37:08,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:08,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:37:08,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:08,173 INFO L87 Difference]: Start difference. First operand 82614 states and 88932 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-03 10:37:10,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:10,575 INFO L93 Difference]: Finished difference Result 202776 states and 218975 transitions. [2025-03-03 10:37:10,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:37:10,575 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 438 [2025-03-03 10:37:10,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:10,698 INFO L225 Difference]: With dead ends: 202776 [2025-03-03 10:37:10,698 INFO L226 Difference]: Without dead ends: 120915 [2025-03-03 10:37:10,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:10,747 INFO L435 NwaCegarLoop]: 1163 mSDtfsCounter, 685 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2378 mSolverCounterSat, 546 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 2924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 546 IncrementalHoareTripleChecker+Valid, 2378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:10,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 1171 Invalid, 2924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [546 Valid, 2378 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:37:10,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120915 states. [2025-03-03 10:37:12,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120915 to 119413. [2025-03-03 10:37:12,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119413 states, 119412 states have (on average 1.0735688205540481) internal successors, (128197), 119412 states have internal predecessors, (128197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:12,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119413 states to 119413 states and 128197 transitions. [2025-03-03 10:37:12,258 INFO L78 Accepts]: Start accepts. Automaton has 119413 states and 128197 transitions. Word has length 438 [2025-03-03 10:37:12,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:12,258 INFO L471 AbstractCegarLoop]: Abstraction has 119413 states and 128197 transitions. [2025-03-03 10:37:12,258 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-03 10:37:12,258 INFO L276 IsEmpty]: Start isEmpty. Operand 119413 states and 128197 transitions. [2025-03-03 10:37:12,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2025-03-03 10:37:12,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:12,264 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:37:12,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:37:12,264 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:12,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:12,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1454054210, now seen corresponding path program 1 times [2025-03-03 10:37:12,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:12,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603722587] [2025-03-03 10:37:12,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:12,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:12,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-03-03 10:37:12,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-03-03 10:37:12,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:12,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:12,432 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-03 10:37:12,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:12,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603722587] [2025-03-03 10:37:12,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603722587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:12,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:37:12,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:37:12,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663415013] [2025-03-03 10:37:12,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:12,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:37:12,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:12,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:37:12,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:12,434 INFO L87 Difference]: Start difference. First operand 119413 states and 128197 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:15,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:15,076 INFO L93 Difference]: Finished difference Result 244081 states and 261818 transitions. [2025-03-03 10:37:15,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:37:15,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 452 [2025-03-03 10:37:15,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:15,215 INFO L225 Difference]: With dead ends: 244081 [2025-03-03 10:37:15,215 INFO L226 Difference]: Without dead ends: 125421 [2025-03-03 10:37:15,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:15,265 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 762 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2527 mSolverCounterSat, 392 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 2919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 392 IncrementalHoareTripleChecker+Valid, 2527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:15,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 435 Invalid, 2919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [392 Valid, 2527 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:37:15,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125421 states. [2025-03-03 10:37:16,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125421 to 117911. [2025-03-03 10:37:16,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117911 states, 117910 states have (on average 1.065660249342719) internal successors, (125652), 117910 states have internal predecessors, (125652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:16,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117911 states to 117911 states and 125652 transitions. [2025-03-03 10:37:16,534 INFO L78 Accepts]: Start accepts. Automaton has 117911 states and 125652 transitions. Word has length 452 [2025-03-03 10:37:16,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:16,534 INFO L471 AbstractCegarLoop]: Abstraction has 117911 states and 125652 transitions. [2025-03-03 10:37:16,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:16,534 INFO L276 IsEmpty]: Start isEmpty. Operand 117911 states and 125652 transitions. [2025-03-03 10:37:16,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2025-03-03 10:37:16,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:16,545 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:37:16,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:37:16,545 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:16,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:16,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1726919449, now seen corresponding path program 1 times [2025-03-03 10:37:16,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:16,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900904324] [2025-03-03 10:37:16,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:16,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:16,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 512 statements into 1 equivalence classes. [2025-03-03 10:37:16,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 512 of 512 statements. [2025-03-03 10:37:16,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:16,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:16,955 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2025-03-03 10:37:16,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:16,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900904324] [2025-03-03 10:37:16,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900904324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:16,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:37:16,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:37:16,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990742514] [2025-03-03 10:37:16,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:16,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:37:16,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:16,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:37:16,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:16,957 INFO L87 Difference]: Start difference. First operand 117911 states and 125652 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:18,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:18,932 INFO L93 Difference]: Finished difference Result 236571 states and 252075 transitions. [2025-03-03 10:37:18,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:37:18,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 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 512 [2025-03-03 10:37:18,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:19,049 INFO L225 Difference]: With dead ends: 236571 [2025-03-03 10:37:19,049 INFO L226 Difference]: Without dead ends: 117911 [2025-03-03 10:37:19,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:19,109 INFO L435 NwaCegarLoop]: 1305 mSDtfsCounter, 715 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1952 mSolverCounterSat, 340 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 2292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 340 IncrementalHoareTripleChecker+Valid, 1952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:19,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 1312 Invalid, 2292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [340 Valid, 1952 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 10:37:19,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117911 states. [2025-03-03 10:37:20,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117911 to 114907. [2025-03-03 10:37:20,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114907 states, 114906 states have (on average 1.0581170696047204) internal successors, (121584), 114906 states have internal predecessors, (121584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:20,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114907 states to 114907 states and 121584 transitions. [2025-03-03 10:37:20,509 INFO L78 Accepts]: Start accepts. Automaton has 114907 states and 121584 transitions. Word has length 512 [2025-03-03 10:37:20,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:20,509 INFO L471 AbstractCegarLoop]: Abstraction has 114907 states and 121584 transitions. [2025-03-03 10:37:20,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:20,510 INFO L276 IsEmpty]: Start isEmpty. Operand 114907 states and 121584 transitions. [2025-03-03 10:37:20,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2025-03-03 10:37:20,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:20,522 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2025-03-03 10:37:20,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:37:20,522 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:20,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:20,523 INFO L85 PathProgramCache]: Analyzing trace with hash 954923866, now seen corresponding path program 1 times [2025-03-03 10:37:20,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:20,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635489932] [2025-03-03 10:37:20,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:20,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:20,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes. [2025-03-03 10:37:20,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements. [2025-03-03 10:37:20,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:20,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:20,727 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 731 proven. 0 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2025-03-03 10:37:20,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:20,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635489932] [2025-03-03 10:37:20,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635489932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:20,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:37:20,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:37:20,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820467886] [2025-03-03 10:37:20,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:20,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:37:20,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:20,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:37:20,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:20,729 INFO L87 Difference]: Start difference. First operand 114907 states and 121584 transitions. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:23,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:23,476 INFO L93 Difference]: Finished difference Result 268113 states and 284204 transitions. [2025-03-03 10:37:23,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:37:23,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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 539 [2025-03-03 10:37:23,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:23,639 INFO L225 Difference]: With dead ends: 268113 [2025-03-03 10:37:23,640 INFO L226 Difference]: Without dead ends: 153208 [2025-03-03 10:37:23,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:23,684 INFO L435 NwaCegarLoop]: 1259 mSDtfsCounter, 661 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2260 mSolverCounterSat, 484 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 2744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 484 IncrementalHoareTripleChecker+Valid, 2260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:23,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 1267 Invalid, 2744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [484 Valid, 2260 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:37:23,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153208 states. [2025-03-03 10:37:24,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153208 to 147200. [2025-03-03 10:37:25,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147200 states, 147199 states have (on average 1.051297902839014) internal successors, (154750), 147199 states have internal predecessors, (154750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:25,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147200 states to 147200 states and 154750 transitions. [2025-03-03 10:37:25,267 INFO L78 Accepts]: Start accepts. Automaton has 147200 states and 154750 transitions. Word has length 539 [2025-03-03 10:37:25,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:25,268 INFO L471 AbstractCegarLoop]: Abstraction has 147200 states and 154750 transitions. [2025-03-03 10:37:25,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:25,268 INFO L276 IsEmpty]: Start isEmpty. Operand 147200 states and 154750 transitions. [2025-03-03 10:37:25,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2025-03-03 10:37:25,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:25,278 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:37:25,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:37:25,278 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:25,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:25,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1736683100, now seen corresponding path program 1 times [2025-03-03 10:37:25,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:25,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735288933] [2025-03-03 10:37:25,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:25,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:25,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 549 statements into 1 equivalence classes. [2025-03-03 10:37:25,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 549 of 549 statements. [2025-03-03 10:37:25,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:25,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:25,991 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-03 10:37:25,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:25,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735288933] [2025-03-03 10:37:25,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735288933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:25,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:37:25,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:37:25,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881059578] [2025-03-03 10:37:25,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:25,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:37:25,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:25,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:37:25,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:37:25,993 INFO L87 Difference]: Start difference. First operand 147200 states and 154750 transitions. Second operand has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:30,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:30,219 INFO L93 Difference]: Finished difference Result 443849 states and 467286 transitions. [2025-03-03 10:37:30,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:37:30,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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 549 [2025-03-03 10:37:30,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:30,550 INFO L225 Difference]: With dead ends: 443849 [2025-03-03 10:37:30,550 INFO L226 Difference]: Without dead ends: 297402 [2025-03-03 10:37:30,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:37:30,604 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 1783 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 4540 mSolverCounterSat, 581 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1783 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 5121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 581 IncrementalHoareTripleChecker+Valid, 4540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:30,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1783 Valid, 74 Invalid, 5121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [581 Valid, 4540 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-03 10:37:30,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297402 states. [2025-03-03 10:37:33,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297402 to 275621. [2025-03-03 10:37:33,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275621 states, 275620 states have (on average 1.052913431536173) internal successors, (290204), 275620 states have internal predecessors, (290204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:34,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275621 states to 275621 states and 290204 transitions. [2025-03-03 10:37:34,069 INFO L78 Accepts]: Start accepts. Automaton has 275621 states and 290204 transitions. Word has length 549 [2025-03-03 10:37:34,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:34,070 INFO L471 AbstractCegarLoop]: Abstraction has 275621 states and 290204 transitions. [2025-03-03 10:37:34,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:34,070 INFO L276 IsEmpty]: Start isEmpty. Operand 275621 states and 290204 transitions. [2025-03-03 10:37:34,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2025-03-03 10:37:34,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:34,081 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:37:34,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:37:34,082 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:34,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:34,082 INFO L85 PathProgramCache]: Analyzing trace with hash 840433407, now seen corresponding path program 1 times [2025-03-03 10:37:34,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:34,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998312480] [2025-03-03 10:37:34,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:34,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:34,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 620 statements into 1 equivalence classes. [2025-03-03 10:37:34,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 620 of 620 statements. [2025-03-03 10:37:34,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:34,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:34,658 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 274 proven. 14 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-03-03 10:37:34,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:34,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998312480] [2025-03-03 10:37:34,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998312480] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:37:34,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866154446] [2025-03-03 10:37:34,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:34,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:37:34,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:37:34,661 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:37:34,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 10:37:34,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 620 statements into 1 equivalence classes. [2025-03-03 10:37:34,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 620 of 620 statements. [2025-03-03 10:37:34,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:34,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:34,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:37:34,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:37:34,866 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2025-03-03 10:37:34,866 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:37:34,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866154446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:34,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:37:34,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-03 10:37:34,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065111438] [2025-03-03 10:37:34,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:34,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:37:34,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:34,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:37:34,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:37:34,867 INFO L87 Difference]: Start difference. First operand 275621 states and 290204 transitions. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:37,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:37,713 INFO L93 Difference]: Finished difference Result 524204 states and 552938 transitions. [2025-03-03 10:37:37,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:37:37,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 620 [2025-03-03 10:37:37,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:38,015 INFO L225 Difference]: With dead ends: 524204 [2025-03-03 10:37:38,015 INFO L226 Difference]: Without dead ends: 295147 [2025-03-03 10:37:38,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 619 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:37:38,056 INFO L435 NwaCegarLoop]: 1112 mSDtfsCounter, 856 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2108 mSolverCounterSat, 382 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 2490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 382 IncrementalHoareTripleChecker+Valid, 2108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:38,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 1120 Invalid, 2490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [382 Valid, 2108 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 10:37:38,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295147 states. [2025-03-03 10:37:40,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295147 to 259099. [2025-03-03 10:37:40,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259099 states, 259098 states have (on average 1.0534508178372661) internal successors, (272947), 259098 states have internal predecessors, (272947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:41,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259099 states to 259099 states and 272947 transitions. [2025-03-03 10:37:41,124 INFO L78 Accepts]: Start accepts. Automaton has 259099 states and 272947 transitions. Word has length 620 [2025-03-03 10:37:41,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:41,124 INFO L471 AbstractCegarLoop]: Abstraction has 259099 states and 272947 transitions. [2025-03-03 10:37:41,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:41,124 INFO L276 IsEmpty]: Start isEmpty. Operand 259099 states and 272947 transitions. [2025-03-03 10:37:41,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 993 [2025-03-03 10:37:41,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:41,187 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:37:41,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 10:37:41,387 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,SelfDestructingSolverStorable17 [2025-03-03 10:37:41,387 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:41,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:41,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1829500187, now seen corresponding path program 1 times [2025-03-03 10:37:41,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:41,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081704696] [2025-03-03 10:37:41,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:41,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:41,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 992 statements into 1 equivalence classes. [2025-03-03 10:37:41,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 992 of 992 statements. [2025-03-03 10:37:41,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:41,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:42,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1351 backedges. 1081 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2025-03-03 10:37:42,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:42,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081704696] [2025-03-03 10:37:42,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081704696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:42,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:37:42,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:37:42,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377570618] [2025-03-03 10:37:42,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:42,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:37:42,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:42,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:37:42,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:42,257 INFO L87 Difference]: Start difference. First operand 259099 states and 272947 transitions. Second operand has 3 states, 3 states have (on average 246.66666666666666) internal successors, (740), 3 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:45,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:45,665 INFO L93 Difference]: Finished difference Result 571519 states and 601528 transitions. [2025-03-03 10:37:45,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:37:45,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 246.66666666666666) internal successors, (740), 3 states have internal predecessors, (740), 0 states have call successors, (0), 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 992 [2025-03-03 10:37:45,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:46,035 INFO L225 Difference]: With dead ends: 571519 [2025-03-03 10:37:46,035 INFO L226 Difference]: Without dead ends: 313173 [2025-03-03 10:37:46,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-03 10:37:46,149 INFO L435 NwaCegarLoop]: 1330 mSDtfsCounter, 608 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2289 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 2544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 2289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:46,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 1338 Invalid, 2544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 2289 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:37:46,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313173 states.