./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label07.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label07.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 c6eeba0e1c333b0671bbfcf3662adf7139859c1a965a716dd9b28c849af19818 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:40:36,477 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:40:36,527 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:40:36,532 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:40:36,533 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:40:36,553 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:40:36,555 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:40:36,555 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:40:36,555 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:40:36,555 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:40:36,556 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:40:36,556 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:40:36,556 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:40:36,556 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:40:36,556 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:40:36,557 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:40:36,557 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:40:36,557 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:40:36,557 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:40:36,557 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:40:36,557 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:40:36,557 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:40:36,557 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:40:36,557 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:40:36,557 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:40:36,557 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:40:36,557 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:40:36,557 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:40:36,557 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:40:36,557 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:40:36,557 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:40:36,557 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:40:36,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:40:36,557 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:40:36,557 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:40:36,557 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:40:36,557 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:40:36,557 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:40:36,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:40:36,558 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:40:36,558 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:40:36,558 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:40:36,558 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:40:36,558 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 -> c6eeba0e1c333b0671bbfcf3662adf7139859c1a965a716dd9b28c849af19818 [2025-03-03 10:40:36,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:40:36,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:40:36,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:40:36,781 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:40:36,781 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:40:36,782 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label07.c [2025-03-03 10:40:37,907 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78c1ca9c5/9a890e2ab158436da7212eb547994596/FLAG373075aff [2025-03-03 10:40:38,295 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:40:38,296 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label07.c [2025-03-03 10:40:38,325 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78c1ca9c5/9a890e2ab158436da7212eb547994596/FLAG373075aff [2025-03-03 10:40:38,468 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78c1ca9c5/9a890e2ab158436da7212eb547994596 [2025-03-03 10:40:38,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:40:38,471 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:40:38,472 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:40:38,472 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:40:38,475 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:40:38,476 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:40:38" (1/1) ... [2025-03-03 10:40:38,477 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22bab34d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:38, skipping insertion in model container [2025-03-03 10:40:38,477 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:40:38" (1/1) ... [2025-03-03 10:40:38,565 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:40:38,764 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label07.c[3249,3262] [2025-03-03 10:40:39,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:40:39,319 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:40:39,333 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label07.c[3249,3262] [2025-03-03 10:40:39,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:40:39,644 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:40:39,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:39 WrapperNode [2025-03-03 10:40:39,645 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:40:39,646 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:40:39,647 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:40:39,647 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:40:39,650 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:40:39" (1/1) ... [2025-03-03 10:40:39,699 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:40:39" (1/1) ... [2025-03-03 10:40:39,993 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-03 10:40:39,994 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:40:39,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:40:39,994 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:40:39,994 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:40:40,001 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:39" (1/1) ... [2025-03-03 10:40:40,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:39" (1/1) ... [2025-03-03 10:40:40,067 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:39" (1/1) ... [2025-03-03 10:40:40,317 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:40:40,318 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:39" (1/1) ... [2025-03-03 10:40:40,318 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:39" (1/1) ... [2025-03-03 10:40:40,412 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:39" (1/1) ... [2025-03-03 10:40:40,428 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:39" (1/1) ... [2025-03-03 10:40:40,447 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:39" (1/1) ... [2025-03-03 10:40:40,466 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:39" (1/1) ... [2025-03-03 10:40:40,502 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:40:40,502 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:40:40,502 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:40:40,502 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:40:40,503 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:39" (1/1) ... [2025-03-03 10:40:40,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:40:40,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:40:40,526 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:40:40,530 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:40:40,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:40:40,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:40:40,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:40:40,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:40:40,593 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:40:40,594 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:40:44,590 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-03 10:40:44,590 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-03 10:40:44,590 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-03 10:40:44,765 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-03 10:40:44,765 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:40:44,794 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:40:44,797 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:40:44,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:40:44 BoogieIcfgContainer [2025-03-03 10:40:44,798 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:40:44,799 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:40:44,799 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:40:44,803 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:40:44,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:40:38" (1/3) ... [2025-03-03 10:40:44,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a2ae420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:40:44, skipping insertion in model container [2025-03-03 10:40:44,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:39" (2/3) ... [2025-03-03 10:40:44,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a2ae420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:40:44, skipping insertion in model container [2025-03-03 10:40:44,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:40:44" (3/3) ... [2025-03-03 10:40:44,804 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label07.c [2025-03-03 10:40:44,816 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:40:44,818 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label07.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:40:44,889 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:40:44,897 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;@56bf92e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:40:44,897 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:40:44,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:44,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-03 10:40:44,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:40:44,906 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:40:44,906 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:40:44,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:40:44,909 INFO L85 PathProgramCache]: Analyzing trace with hash -337160076, now seen corresponding path program 1 times [2025-03-03 10:40:44,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:40:44,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91058256] [2025-03-03 10:40:44,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:44,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:40:44,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-03 10:40:44,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 10:40:44,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:44,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:45,136 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:40:45,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:45,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91058256] [2025-03-03 10:40:45,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91058256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:40:45,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:40:45,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:40:45,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095080406] [2025-03-03 10:40:45,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:40:45,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:40:45,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:40:45,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:40:45,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:45,168 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:40:48,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:40:48,344 INFO L93 Difference]: Finished difference Result 3147 states and 5803 transitions. [2025-03-03 10:40:48,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:40:48,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2025-03-03 10:40:48,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:40:48,358 INFO L225 Difference]: With dead ends: 3147 [2025-03-03 10:40:48,358 INFO L226 Difference]: Without dead ends: 1964 [2025-03-03 10:40:48,362 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:40:48,363 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 1158 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 3298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:40:48,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1158 Valid, 987 Invalid, 3298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-03 10:40:48,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2025-03-03 10:40:48,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1951. [2025-03-03 10:40:48,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1951 states, 1950 states have (on average 1.6538461538461537) internal successors, (3225), 1950 states have internal predecessors, (3225), 0 states have call successors, (0), 0 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:40:48,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1951 states and 3225 transitions. [2025-03-03 10:40:48,455 INFO L78 Accepts]: Start accepts. Automaton has 1951 states and 3225 transitions. Word has length 21 [2025-03-03 10:40:48,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:40:48,456 INFO L471 AbstractCegarLoop]: Abstraction has 1951 states and 3225 transitions. [2025-03-03 10:40:48,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:40:48,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 3225 transitions. [2025-03-03 10:40:48,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 10:40:48,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:40:48,458 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 10:40:48,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:40:48,458 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:40:48,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:40:48,459 INFO L85 PathProgramCache]: Analyzing trace with hash -303417075, now seen corresponding path program 1 times [2025-03-03 10:40:48,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:40:48,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615100075] [2025-03-03 10:40:48,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:48,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:40:48,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 10:40:48,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 10:40:48,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:48,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:48,678 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:40:48,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:48,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615100075] [2025-03-03 10:40:48,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615100075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:40:48,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:40:48,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:40:48,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221784295] [2025-03-03 10:40:48,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:40:48,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:40:48,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:40:48,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:40:48,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:48,683 INFO L87 Difference]: Start difference. First operand 1951 states and 3225 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:40:51,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:40:51,892 INFO L93 Difference]: Finished difference Result 5540 states and 9221 transitions. [2025-03-03 10:40:51,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:40:51,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-03-03 10:40:51,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:40:51,904 INFO L225 Difference]: With dead ends: 5540 [2025-03-03 10:40:51,904 INFO L226 Difference]: Without dead ends: 3591 [2025-03-03 10:40:51,908 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:40:51,909 INFO L435 NwaCegarLoop]: 872 mSDtfsCounter, 923 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2591 mSolverCounterSat, 750 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 3341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 750 IncrementalHoareTripleChecker+Valid, 2591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:40:51,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 1008 Invalid, 3341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [750 Valid, 2591 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-03 10:40:51,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3591 states. [2025-03-03 10:40:51,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3591 to 3581. [2025-03-03 10:40:51,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3581 states, 3580 states have (on average 1.5050279329608938) internal successors, (5388), 3580 states have internal predecessors, (5388), 0 states have call successors, (0), 0 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:40:51,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3581 states to 3581 states and 5388 transitions. [2025-03-03 10:40:51,966 INFO L78 Accepts]: Start accepts. Automaton has 3581 states and 5388 transitions. Word has length 92 [2025-03-03 10:40:51,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:40:51,967 INFO L471 AbstractCegarLoop]: Abstraction has 3581 states and 5388 transitions. [2025-03-03 10:40:51,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:40:51,967 INFO L276 IsEmpty]: Start isEmpty. Operand 3581 states and 5388 transitions. [2025-03-03 10:40:51,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 10:40:51,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:40:51,969 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 10:40:51,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:40:51,969 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:40:51,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:40:51,970 INFO L85 PathProgramCache]: Analyzing trace with hash -950558604, now seen corresponding path program 1 times [2025-03-03 10:40:51,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:40:51,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820043462] [2025-03-03 10:40:51,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:51,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:40:51,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 10:40:52,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 10:40:52,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:52,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:52,140 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:40:52,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:52,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820043462] [2025-03-03 10:40:52,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820043462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:40:52,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:40:52,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:40:52,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674567336] [2025-03-03 10:40:52,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:40:52,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:40:52,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:40:52,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:40:52,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:52,143 INFO L87 Difference]: Start difference. First operand 3581 states and 5388 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 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:40:54,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:40:54,960 INFO L93 Difference]: Finished difference Result 10352 states and 15625 transitions. [2025-03-03 10:40:54,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:40:54,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2025-03-03 10:40:54,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:40:54,981 INFO L225 Difference]: With dead ends: 10352 [2025-03-03 10:40:54,981 INFO L226 Difference]: Without dead ends: 6773 [2025-03-03 10:40:54,985 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:40:54,988 INFO L435 NwaCegarLoop]: 1020 mSDtfsCounter, 785 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2491 mSolverCounterSat, 786 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 3277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 786 IncrementalHoareTripleChecker+Valid, 2491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:40:54,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 1171 Invalid, 3277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [786 Valid, 2491 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 10:40:54,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6773 states. [2025-03-03 10:40:55,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6773 to 6749. [2025-03-03 10:40:55,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6749 states, 6748 states have (on average 1.3252815649081209) internal successors, (8943), 6748 states have internal predecessors, (8943), 0 states have call successors, (0), 0 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:40:55,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6749 states to 6749 states and 8943 transitions. [2025-03-03 10:40:55,079 INFO L78 Accepts]: Start accepts. Automaton has 6749 states and 8943 transitions. Word has length 106 [2025-03-03 10:40:55,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:40:55,079 INFO L471 AbstractCegarLoop]: Abstraction has 6749 states and 8943 transitions. [2025-03-03 10:40:55,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 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:40:55,080 INFO L276 IsEmpty]: Start isEmpty. Operand 6749 states and 8943 transitions. [2025-03-03 10:40:55,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 10:40:55,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:40:55,082 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:40:55,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:40:55,083 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:40:55,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:40:55,083 INFO L85 PathProgramCache]: Analyzing trace with hash -828031833, now seen corresponding path program 1 times [2025-03-03 10:40:55,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:40:55,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68036622] [2025-03-03 10:40:55,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:55,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:40:55,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 10:40:55,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 10:40:55,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:55,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:55,244 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:40:55,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:55,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68036622] [2025-03-03 10:40:55,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68036622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:40:55,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:40:55,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:40:55,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696095779] [2025-03-03 10:40:55,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:40:55,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:40:55,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:40:55,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:40:55,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:55,245 INFO L87 Difference]: Start difference. First operand 6749 states and 8943 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 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:40:58,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:40:58,107 INFO L93 Difference]: Finished difference Result 19871 states and 26319 transitions. [2025-03-03 10:40:58,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:40:58,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 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 135 [2025-03-03 10:40:58,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:40:58,140 INFO L225 Difference]: With dead ends: 19871 [2025-03-03 10:40:58,142 INFO L226 Difference]: Without dead ends: 13124 [2025-03-03 10:40:58,151 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:40:58,154 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 899 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 2877 mSolverCounterSat, 555 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 3432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 555 IncrementalHoareTripleChecker+Valid, 2877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:40:58,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 611 Invalid, 3432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [555 Valid, 2877 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-03 10:40:58,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13124 states. [2025-03-03 10:40:58,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13124 to 13114. [2025-03-03 10:40:58,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13114 states, 13113 states have (on average 1.2755281018836269) internal successors, (16726), 13113 states have internal predecessors, (16726), 0 states have call successors, (0), 0 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:40:58,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13114 states to 13114 states and 16726 transitions. [2025-03-03 10:40:58,399 INFO L78 Accepts]: Start accepts. Automaton has 13114 states and 16726 transitions. Word has length 135 [2025-03-03 10:40:58,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:40:58,400 INFO L471 AbstractCegarLoop]: Abstraction has 13114 states and 16726 transitions. [2025-03-03 10:40:58,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 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:40:58,404 INFO L276 IsEmpty]: Start isEmpty. Operand 13114 states and 16726 transitions. [2025-03-03 10:40:58,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-03 10:40:58,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:40:58,406 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:58,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:40:58,407 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:40:58,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:40:58,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1740479659, now seen corresponding path program 1 times [2025-03-03 10:40:58,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:40:58,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233726] [2025-03-03 10:40:58,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:58,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:40:58,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-03 10:40:58,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-03 10:40:58,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:58,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:58,819 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-03 10:40:58,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:58,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233726] [2025-03-03 10:40:58,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:40:58,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:40:58,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:40:58,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307007830] [2025-03-03 10:40:58,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:40:58,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:40:58,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:40:58,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:40:58,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:58,822 INFO L87 Difference]: Start difference. First operand 13114 states and 16726 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 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:41:01,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:41:01,325 INFO L93 Difference]: Finished difference Result 36461 states and 47023 transitions. [2025-03-03 10:41:01,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:41:01,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 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 218 [2025-03-03 10:41:01,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:41:01,368 INFO L225 Difference]: With dead ends: 36461 [2025-03-03 10:41:01,368 INFO L226 Difference]: Without dead ends: 24136 [2025-03-03 10:41:01,376 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:41:01,377 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 849 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 875 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 3205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 875 IncrementalHoareTripleChecker+Valid, 2330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:41:01,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 1033 Invalid, 3205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [875 Valid, 2330 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:41:01,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24136 states. [2025-03-03 10:41:01,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24136 to 24130. [2025-03-03 10:41:01,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24130 states, 24129 states have (on average 1.2020804840648183) internal successors, (29005), 24129 states have internal predecessors, (29005), 0 states have call successors, (0), 0 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:41:01,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24130 states to 24130 states and 29005 transitions. [2025-03-03 10:41:01,633 INFO L78 Accepts]: Start accepts. Automaton has 24130 states and 29005 transitions. Word has length 218 [2025-03-03 10:41:01,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:41:01,633 INFO L471 AbstractCegarLoop]: Abstraction has 24130 states and 29005 transitions. [2025-03-03 10:41:01,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 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:41:01,634 INFO L276 IsEmpty]: Start isEmpty. Operand 24130 states and 29005 transitions. [2025-03-03 10:41:01,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-03 10:41:01,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:41:01,639 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:41:01,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:41:01,640 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:41:01,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:41:01,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1922843453, now seen corresponding path program 1 times [2025-03-03 10:41:01,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:41:01,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930528878] [2025-03-03 10:41:01,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:01,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:41:01,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-03 10:41:01,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-03 10:41:01,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:01,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:01,882 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 10:41:01,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:41:01,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930528878] [2025-03-03 10:41:01,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930528878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:41:01,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:41:01,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:41:01,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988735731] [2025-03-03 10:41:01,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:41:01,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:41:01,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:41:01,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:41:01,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:41:01,886 INFO L87 Difference]: Start difference. First operand 24130 states and 29005 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 2 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:04,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:41:04,038 INFO L93 Difference]: Finished difference Result 43520 states and 52823 transitions. [2025-03-03 10:41:04,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:41:04,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 2 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 222 [2025-03-03 10:41:04,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:41:04,066 INFO L225 Difference]: With dead ends: 43520 [2025-03-03 10:41:04,067 INFO L226 Difference]: Without dead ends: 24131 [2025-03-03 10:41:04,084 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:41:04,085 INFO L435 NwaCegarLoop]: 1078 mSDtfsCounter, 676 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 2525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:41:04,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 1213 Invalid, 2525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:41:04,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24131 states. [2025-03-03 10:41:04,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24131 to 24130. [2025-03-03 10:41:04,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24130 states, 24129 states have (on average 1.2018732645364498) internal successors, (29000), 24129 states have internal predecessors, (29000), 0 states have call successors, (0), 0 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:41:04,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24130 states to 24130 states and 29000 transitions. [2025-03-03 10:41:04,406 INFO L78 Accepts]: Start accepts. Automaton has 24130 states and 29000 transitions. Word has length 222 [2025-03-03 10:41:04,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:41:04,406 INFO L471 AbstractCegarLoop]: Abstraction has 24130 states and 29000 transitions. [2025-03-03 10:41:04,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 2 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:04,406 INFO L276 IsEmpty]: Start isEmpty. Operand 24130 states and 29000 transitions. [2025-03-03 10:41:04,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-03 10:41:04,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:41:04,411 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:41:04,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:41:04,411 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:41:04,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:41:04,412 INFO L85 PathProgramCache]: Analyzing trace with hash -2048777647, now seen corresponding path program 1 times [2025-03-03 10:41:04,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:41:04,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136690060] [2025-03-03 10:41:04,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:04,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:41:04,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-03 10:41:04,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-03 10:41:04,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:04,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:04,655 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:41:04,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:41:04,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136690060] [2025-03-03 10:41:04,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136690060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:41:04,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:41:04,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:41:04,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803876278] [2025-03-03 10:41:04,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:41:04,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:41:04,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:41:04,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:41:04,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:41:04,661 INFO L87 Difference]: Start difference. First operand 24130 states and 29000 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 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:41:07,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:41:07,084 INFO L93 Difference]: Finished difference Result 47314 states and 56987 transitions. [2025-03-03 10:41:07,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:41:07,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 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 235 [2025-03-03 10:41:07,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:41:07,114 INFO L225 Difference]: With dead ends: 47314 [2025-03-03 10:41:07,114 INFO L226 Difference]: Without dead ends: 23973 [2025-03-03 10:41:07,130 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:41:07,131 INFO L435 NwaCegarLoop]: 1520 mSDtfsCounter, 1037 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2354 mSolverCounterSat, 596 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 1657 SdHoareTripleChecker+Invalid, 2950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 596 IncrementalHoareTripleChecker+Valid, 2354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:41:07,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 1657 Invalid, 2950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [596 Valid, 2354 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:41:07,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23973 states. [2025-03-03 10:41:07,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23973 to 23968. [2025-03-03 10:41:07,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23968 states, 23967 states have (on average 1.1344348479158843) internal successors, (27189), 23967 states have internal predecessors, (27189), 0 states have call successors, (0), 0 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:41:07,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23968 states to 23968 states and 27189 transitions. [2025-03-03 10:41:07,470 INFO L78 Accepts]: Start accepts. Automaton has 23968 states and 27189 transitions. Word has length 235 [2025-03-03 10:41:07,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:41:07,470 INFO L471 AbstractCegarLoop]: Abstraction has 23968 states and 27189 transitions. [2025-03-03 10:41:07,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 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:41:07,471 INFO L276 IsEmpty]: Start isEmpty. Operand 23968 states and 27189 transitions. [2025-03-03 10:41:07,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-03-03 10:41:07,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:41:07,474 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:41:07,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:41:07,474 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:41:07,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:41:07,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1434939271, now seen corresponding path program 1 times [2025-03-03 10:41:07,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:41:07,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046084030] [2025-03-03 10:41:07,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:07,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:41:07,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-03 10:41:07,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-03 10:41:07,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:07,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:07,768 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-03-03 10:41:07,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:41:07,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046084030] [2025-03-03 10:41:07,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046084030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:41:07,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:41:07,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:41:07,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439544812] [2025-03-03 10:41:07,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:41:07,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:41:07,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:41:07,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:41:07,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:41:07,770 INFO L87 Difference]: Start difference. First operand 23968 states and 27189 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 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:41:10,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:41:10,237 INFO L93 Difference]: Finished difference Result 47147 states and 53579 transitions. [2025-03-03 10:41:10,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:41:10,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 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 254 [2025-03-03 10:41:10,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:41:10,262 INFO L225 Difference]: With dead ends: 47147 [2025-03-03 10:41:10,262 INFO L226 Difference]: Without dead ends: 23968 [2025-03-03 10:41:10,277 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:41:10,278 INFO L435 NwaCegarLoop]: 1056 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2493 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 2497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:41:10,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1185 Invalid, 2497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2493 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:41:10,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23968 states. [2025-03-03 10:41:10,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23968 to 23968. [2025-03-03 10:41:10,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23968 states, 23967 states have (on average 1.1342262277297952) internal successors, (27184), 23967 states have internal predecessors, (27184), 0 states have call successors, (0), 0 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:41:10,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23968 states to 23968 states and 27184 transitions. [2025-03-03 10:41:10,562 INFO L78 Accepts]: Start accepts. Automaton has 23968 states and 27184 transitions. Word has length 254 [2025-03-03 10:41:10,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:41:10,563 INFO L471 AbstractCegarLoop]: Abstraction has 23968 states and 27184 transitions. [2025-03-03 10:41:10,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 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:41:10,565 INFO L276 IsEmpty]: Start isEmpty. Operand 23968 states and 27184 transitions. [2025-03-03 10:41:10,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-03-03 10:41:10,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:41:10,568 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:41:10,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:41:10,568 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:41:10,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:41:10,569 INFO L85 PathProgramCache]: Analyzing trace with hash 704041883, now seen corresponding path program 1 times [2025-03-03 10:41:10,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:41:10,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837140068] [2025-03-03 10:41:10,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:10,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:41:10,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-03 10:41:10,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-03 10:41:10,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:10,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:10,810 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 10:41:10,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:41:10,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837140068] [2025-03-03 10:41:10,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837140068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:41:10,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:41:10,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:41:10,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690995470] [2025-03-03 10:41:10,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:41:10,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:41:10,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:41:10,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:41:10,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:41:10,813 INFO L87 Difference]: Start difference. First operand 23968 states and 27184 transitions. Second operand has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 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:41:15,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:41:15,974 INFO L93 Difference]: Finished difference Result 85141 states and 97158 transitions. [2025-03-03 10:41:15,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:41:15,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 261 [2025-03-03 10:41:15,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:41:16,035 INFO L225 Difference]: With dead ends: 85141 [2025-03-03 10:41:16,036 INFO L226 Difference]: Without dead ends: 61962 [2025-03-03 10:41:16,050 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:41:16,050 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 1738 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 6752 mSolverCounterSat, 1058 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1738 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 7810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1058 IncrementalHoareTripleChecker+Valid, 6752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:41:16,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1738 Valid, 868 Invalid, 7810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1058 Valid, 6752 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-03-03 10:41:16,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61962 states. [2025-03-03 10:41:16,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61962 to 59472. [2025-03-03 10:41:16,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59472 states, 59471 states have (on average 1.1241781708731986) internal successors, (66856), 59471 states have internal predecessors, (66856), 0 states have call successors, (0), 0 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:41:16,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59472 states to 59472 states and 66856 transitions. [2025-03-03 10:41:16,509 INFO L78 Accepts]: Start accepts. Automaton has 59472 states and 66856 transitions. Word has length 261 [2025-03-03 10:41:16,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:41:16,509 INFO L471 AbstractCegarLoop]: Abstraction has 59472 states and 66856 transitions. [2025-03-03 10:41:16,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 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:41:16,509 INFO L276 IsEmpty]: Start isEmpty. Operand 59472 states and 66856 transitions. [2025-03-03 10:41:16,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-03-03 10:41:16,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:41:16,513 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:41:16,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:41:16,513 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:41:16,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:41:16,517 INFO L85 PathProgramCache]: Analyzing trace with hash 301369793, now seen corresponding path program 1 times [2025-03-03 10:41:16,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:41:16,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194469622] [2025-03-03 10:41:16,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:16,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:41:16,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-03-03 10:41:16,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-03-03 10:41:16,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:16,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:16,809 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 10:41:16,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:41:16,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194469622] [2025-03-03 10:41:16,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194469622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:41:16,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:41:16,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:41:16,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808302502] [2025-03-03 10:41:16,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:41:16,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:41:16,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:41:16,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:41:16,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:41:16,811 INFO L87 Difference]: Start difference. First operand 59472 states and 66856 transitions. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 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:41:19,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:41:19,683 INFO L93 Difference]: Finished difference Result 144134 states and 163914 transitions. [2025-03-03 10:41:19,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:41:19,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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 319 [2025-03-03 10:41:19,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:41:19,763 INFO L225 Difference]: With dead ends: 144134 [2025-03-03 10:41:19,763 INFO L226 Difference]: Without dead ends: 85451 [2025-03-03 10:41:19,789 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:41:19,790 INFO L435 NwaCegarLoop]: 922 mSDtfsCounter, 783 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 2433 mSolverCounterSat, 868 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 3301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 868 IncrementalHoareTripleChecker+Valid, 2433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:41:19,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 1037 Invalid, 3301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [868 Valid, 2433 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:41:19,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85451 states. [2025-03-03 10:41:20,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85451 to 83866. [2025-03-03 10:41:20,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83866 states, 83865 states have (on average 1.1146962380015502) internal successors, (93484), 83865 states have internal predecessors, (93484), 0 states have call successors, (0), 0 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:41:20,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83866 states to 83866 states and 93484 transitions. [2025-03-03 10:41:20,562 INFO L78 Accepts]: Start accepts. Automaton has 83866 states and 93484 transitions. Word has length 319 [2025-03-03 10:41:20,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:41:20,562 INFO L471 AbstractCegarLoop]: Abstraction has 83866 states and 93484 transitions. [2025-03-03 10:41:20,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 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:41:20,562 INFO L276 IsEmpty]: Start isEmpty. Operand 83866 states and 93484 transitions. [2025-03-03 10:41:20,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-03-03 10:41:20,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:41:20,566 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:41:20,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:41:20,566 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:41:20,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:41:20,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1018782692, now seen corresponding path program 1 times [2025-03-03 10:41:20,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:41:20,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898569075] [2025-03-03 10:41:20,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:20,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:41:20,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-03-03 10:41:20,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-03-03 10:41:20,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:20,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:20,785 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 10:41:20,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:41:20,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898569075] [2025-03-03 10:41:20,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898569075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:41:20,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:41:20,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:41:20,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082350081] [2025-03-03 10:41:20,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:41:20,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:41:20,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:41:20,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:41:20,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:41:20,786 INFO L87 Difference]: Start difference. First operand 83866 states and 93484 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 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:41:23,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:41:23,774 INFO L93 Difference]: Finished difference Result 168552 states and 187810 transitions. [2025-03-03 10:41:23,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:41:23,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 347 [2025-03-03 10:41:23,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:41:23,874 INFO L225 Difference]: With dead ends: 168552 [2025-03-03 10:41:23,874 INFO L226 Difference]: Without dead ends: 83109 [2025-03-03 10:41:23,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:41:23,929 INFO L435 NwaCegarLoop]: 1827 mSDtfsCounter, 746 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 2589 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 1967 SdHoareTripleChecker+Invalid, 2892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 2589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:41:23,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 1967 Invalid, 2892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 2589 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:41:23,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83109 states. [2025-03-03 10:41:24,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83109 to 79922. [2025-03-03 10:41:24,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79922 states, 79921 states have (on average 1.1056167965866293) internal successors, (88362), 79921 states have internal predecessors, (88362), 0 states have call successors, (0), 0 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:41:24,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79922 states to 79922 states and 88362 transitions. [2025-03-03 10:41:24,850 INFO L78 Accepts]: Start accepts. Automaton has 79922 states and 88362 transitions. Word has length 347 [2025-03-03 10:41:24,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:41:24,850 INFO L471 AbstractCegarLoop]: Abstraction has 79922 states and 88362 transitions. [2025-03-03 10:41:24,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 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:41:24,850 INFO L276 IsEmpty]: Start isEmpty. Operand 79922 states and 88362 transitions. [2025-03-03 10:41:24,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-03-03 10:41:24,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:41:24,854 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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:41:24,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:41:24,854 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:41:24,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:41:24,855 INFO L85 PathProgramCache]: Analyzing trace with hash -202476859, now seen corresponding path program 1 times [2025-03-03 10:41:24,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:41:24,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469719081] [2025-03-03 10:41:24,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:24,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:41:24,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-03-03 10:41:24,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-03-03 10:41:24,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:24,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:25,673 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 260 proven. 113 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 10:41:25,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:41:25,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469719081] [2025-03-03 10:41:25,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469719081] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:41:25,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820395908] [2025-03-03 10:41:25,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:25,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:41:25,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:41:25,676 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:41:25,677 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:41:25,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-03-03 10:41:25,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-03-03 10:41:25,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:25,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:25,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:41:25,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:41:25,950 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-03-03 10:41:25,950 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:41:25,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820395908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:41:25,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:41:25,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-03 10:41:25,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046920036] [2025-03-03 10:41:25,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:41:25,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:41:25,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:41:25,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:41:25,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:41:25,951 INFO L87 Difference]: Start difference. First operand 79922 states and 88362 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 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:41:28,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:41:28,337 INFO L93 Difference]: Finished difference Result 159053 states and 175929 transitions. [2025-03-03 10:41:28,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:41:28,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 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 376 [2025-03-03 10:41:28,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:41:28,435 INFO L225 Difference]: With dead ends: 159053 [2025-03-03 10:41:28,435 INFO L226 Difference]: Without dead ends: 79920 [2025-03-03 10:41:28,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:41:28,481 INFO L435 NwaCegarLoop]: 1344 mSDtfsCounter, 1084 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2451 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:41:28,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1084 Valid, 1423 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2451 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:41:28,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79920 states. [2025-03-03 10:41:29,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79920 to 79919. [2025-03-03 10:41:29,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79919 states, 79918 states have (on average 1.0802822893465802) internal successors, (86334), 79918 states have internal predecessors, (86334), 0 states have call successors, (0), 0 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:41:29,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79919 states to 79919 states and 86334 transitions. [2025-03-03 10:41:29,446 INFO L78 Accepts]: Start accepts. Automaton has 79919 states and 86334 transitions. Word has length 376 [2025-03-03 10:41:29,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:41:29,447 INFO L471 AbstractCegarLoop]: Abstraction has 79919 states and 86334 transitions. [2025-03-03 10:41:29,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 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:41:29,447 INFO L276 IsEmpty]: Start isEmpty. Operand 79919 states and 86334 transitions. [2025-03-03 10:41:29,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-03-03 10:41:29,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:41:29,452 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:41:29,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 10:41:29,652 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,SelfDestructingSolverStorable11 [2025-03-03 10:41:29,653 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:41:29,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:41:29,653 INFO L85 PathProgramCache]: Analyzing trace with hash 565099845, now seen corresponding path program 1 times [2025-03-03 10:41:29,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:41:29,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368880208] [2025-03-03 10:41:29,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:29,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:41:29,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-03-03 10:41:29,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-03-03 10:41:29,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:29,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:29,978 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-03-03 10:41:29,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:41:29,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368880208] [2025-03-03 10:41:29,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368880208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:41:29,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:41:29,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:41:29,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676728470] [2025-03-03 10:41:29,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:41:29,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:41:29,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:41:29,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:41:29,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:41:29,980 INFO L87 Difference]: Start difference. First operand 79919 states and 86334 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:32,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:41:32,761 INFO L93 Difference]: Finished difference Result 185027 states and 201730 transitions. [2025-03-03 10:41:32,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:41:32,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 377 [2025-03-03 10:41:32,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:41:32,884 INFO L225 Difference]: With dead ends: 185027 [2025-03-03 10:41:32,884 INFO L226 Difference]: Without dead ends: 105897 [2025-03-03 10:41:32,921 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:41:32,921 INFO L435 NwaCegarLoop]: 821 mSDtfsCounter, 876 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2418 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 3338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 920 IncrementalHoareTripleChecker+Valid, 2418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:41:32,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 903 Invalid, 3338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 2418 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:41:32,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105897 states. [2025-03-03 10:41:33,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105897 to 104304. [2025-03-03 10:41:33,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104304 states, 104303 states have (on average 1.0859131568603013) internal successors, (113264), 104303 states have internal predecessors, (113264), 0 states have call successors, (0), 0 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:41:33,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104304 states to 104304 states and 113264 transitions. [2025-03-03 10:41:33,991 INFO L78 Accepts]: Start accepts. Automaton has 104304 states and 113264 transitions. Word has length 377 [2025-03-03 10:41:33,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:41:33,992 INFO L471 AbstractCegarLoop]: Abstraction has 104304 states and 113264 transitions. [2025-03-03 10:41:33,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:33,992 INFO L276 IsEmpty]: Start isEmpty. Operand 104304 states and 113264 transitions. [2025-03-03 10:41:34,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2025-03-03 10:41:34,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:41:34,141 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:34,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:41:34,142 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:41:34,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:41:34,142 INFO L85 PathProgramCache]: Analyzing trace with hash -695691540, now seen corresponding path program 1 times [2025-03-03 10:41:34,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:41:34,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192721653] [2025-03-03 10:41:34,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:34,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:41:34,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-03-03 10:41:34,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-03-03 10:41:34,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:34,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:34,461 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 10:41:34,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:41:34,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192721653] [2025-03-03 10:41:34,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192721653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:41:34,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:41:34,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:41:34,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811173277] [2025-03-03 10:41:34,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:41:34,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:41:34,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:41:34,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:41:34,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:41:34,464 INFO L87 Difference]: Start difference. First operand 104304 states and 113264 transitions. Second operand has 4 states, 4 states have (on average 98.0) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 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:41:38,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:41:38,122 INFO L93 Difference]: Finished difference Result 203879 states and 221787 transitions. [2025-03-03 10:41:38,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:41:38,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 98.0) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 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 410 [2025-03-03 10:41:38,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:41:38,274 INFO L225 Difference]: With dead ends: 203879 [2025-03-03 10:41:38,274 INFO L226 Difference]: Without dead ends: 111386 [2025-03-03 10:41:38,341 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:41:38,342 INFO L435 NwaCegarLoop]: 804 mSDtfsCounter, 1569 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 4068 mSolverCounterSat, 455 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1569 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 4523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 455 IncrementalHoareTripleChecker+Valid, 4068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:41:38,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1569 Valid, 999 Invalid, 4523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [455 Valid, 4068 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-03 10:41:38,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111386 states. [2025-03-03 10:41:39,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111386 to 107450. [2025-03-03 10:41:39,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107450 states, 107449 states have (on average 1.0778601941386146) internal successors, (115815), 107449 states have internal predecessors, (115815), 0 states have call successors, (0), 0 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:41:39,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107450 states to 107450 states and 115815 transitions. [2025-03-03 10:41:39,603 INFO L78 Accepts]: Start accepts. Automaton has 107450 states and 115815 transitions. Word has length 410 [2025-03-03 10:41:39,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:41:39,604 INFO L471 AbstractCegarLoop]: Abstraction has 107450 states and 115815 transitions. [2025-03-03 10:41:39,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.0) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 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:41:39,604 INFO L276 IsEmpty]: Start isEmpty. Operand 107450 states and 115815 transitions. [2025-03-03 10:41:39,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-03-03 10:41:39,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:41:39,611 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:41:39,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:41:39,611 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:41:39,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:41:39,612 INFO L85 PathProgramCache]: Analyzing trace with hash 19371381, now seen corresponding path program 1 times [2025-03-03 10:41:39,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:41:39,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061001979] [2025-03-03 10:41:39,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:39,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:41:39,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-03 10:41:39,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-03 10:41:39,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:39,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:39,894 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 388 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-03 10:41:39,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:41:39,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061001979] [2025-03-03 10:41:39,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061001979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:41:39,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:41:39,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:41:39,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117956344] [2025-03-03 10:41:39,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:41:39,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:41:39,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:41:39,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:41:39,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:41:39,896 INFO L87 Difference]: Start difference. First operand 107450 states and 115815 transitions. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:42,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:41:42,818 INFO L93 Difference]: Finished difference Result 240097 states and 260427 transitions. [2025-03-03 10:41:42,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:41:42,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 469 [2025-03-03 10:41:42,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:41:42,984 INFO L225 Difference]: With dead ends: 240097 [2025-03-03 10:41:42,984 INFO L226 Difference]: Without dead ends: 132649 [2025-03-03 10:41:43,061 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:41:43,061 INFO L435 NwaCegarLoop]: 1740 mSDtfsCounter, 721 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2487 mSolverCounterSat, 654 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 3141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 654 IncrementalHoareTripleChecker+Valid, 2487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:41:43,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 1882 Invalid, 3141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [654 Valid, 2487 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:41:43,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132649 states. [2025-03-03 10:41:44,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132649 to 130272. [2025-03-03 10:41:44,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130272 states, 130271 states have (on average 1.0689409001235886) internal successors, (139252), 130271 states have internal predecessors, (139252), 0 states have call successors, (0), 0 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:41:44,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130272 states to 130272 states and 139252 transitions. [2025-03-03 10:41:44,344 INFO L78 Accepts]: Start accepts. Automaton has 130272 states and 139252 transitions. Word has length 469 [2025-03-03 10:41:44,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:41:44,345 INFO L471 AbstractCegarLoop]: Abstraction has 130272 states and 139252 transitions. [2025-03-03 10:41:44,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:44,345 INFO L276 IsEmpty]: Start isEmpty. Operand 130272 states and 139252 transitions. [2025-03-03 10:41:44,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-03-03 10:41:44,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:41:44,352 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:44,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:41:44,352 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:41:44,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:41:44,353 INFO L85 PathProgramCache]: Analyzing trace with hash 691700349, now seen corresponding path program 1 times [2025-03-03 10:41:44,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:41:44,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357280820] [2025-03-03 10:41:44,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:44,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:41:44,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-03-03 10:41:44,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-03-03 10:41:44,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:44,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:44,862 INFO L134 CoverageAnalysis]: Checked inductivity of 629 backedges. 522 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-03 10:41:44,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:41:44,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357280820] [2025-03-03 10:41:44,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357280820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:41:44,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:41:44,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:41:44,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909418595] [2025-03-03 10:41:44,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:41:44,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:41:44,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:41:44,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:41:44,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:41:44,863 INFO L87 Difference]: Start difference. First operand 130272 states and 139252 transitions. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:48,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:41:48,121 INFO L93 Difference]: Finished difference Result 261347 states and 279240 transitions. [2025-03-03 10:41:48,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:41:48,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 470 [2025-03-03 10:41:48,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:41:48,270 INFO L225 Difference]: With dead ends: 261347 [2025-03-03 10:41:48,270 INFO L226 Difference]: Without dead ends: 131075 [2025-03-03 10:41:48,334 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:41:48,334 INFO L435 NwaCegarLoop]: 1642 mSDtfsCounter, 723 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2444 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 2835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 2444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:41:48,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 1779 Invalid, 2835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 2444 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 10:41:48,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131075 states. [2025-03-03 10:41:49,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131075 to 127907. [2025-03-03 10:41:49,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127907 states, 127906 states have (on average 1.0576751677012806) internal successors, (135283), 127906 states have internal predecessors, (135283), 0 states have call successors, (0), 0 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:41:49,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127907 states to 127907 states and 135283 transitions. [2025-03-03 10:41:49,433 INFO L78 Accepts]: Start accepts. Automaton has 127907 states and 135283 transitions. Word has length 470 [2025-03-03 10:41:49,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:41:49,434 INFO L471 AbstractCegarLoop]: Abstraction has 127907 states and 135283 transitions. [2025-03-03 10:41:49,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:49,434 INFO L276 IsEmpty]: Start isEmpty. Operand 127907 states and 135283 transitions. [2025-03-03 10:41:49,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2025-03-03 10:41:49,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:41:49,445 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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, 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, 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:41:49,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:41:49,445 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:41:49,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:41:49,446 INFO L85 PathProgramCache]: Analyzing trace with hash -680065000, now seen corresponding path program 1 times [2025-03-03 10:41:49,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:41:49,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715975263] [2025-03-03 10:41:49,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:49,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:41:49,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 601 statements into 1 equivalence classes. [2025-03-03 10:41:49,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 601 of 601 statements. [2025-03-03 10:41:49,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:49,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:49,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1059 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2025-03-03 10:41:49,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:41:49,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715975263] [2025-03-03 10:41:49,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715975263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:41:49,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:41:49,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:41:49,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307855073] [2025-03-03 10:41:49,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:41:49,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:41:49,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:41:49,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:41:49,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:41:49,723 INFO L87 Difference]: Start difference. First operand 127907 states and 135283 transitions. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 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:41:52,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:41:52,669 INFO L93 Difference]: Finished difference Result 289676 states and 307864 transitions. [2025-03-03 10:41:52,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:41:52,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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 601 [2025-03-03 10:41:52,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:41:52,864 INFO L225 Difference]: With dead ends: 289676 [2025-03-03 10:41:52,864 INFO L226 Difference]: Without dead ends: 171990 [2025-03-03 10:41:52,942 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:41:52,943 INFO L435 NwaCegarLoop]: 706 mSDtfsCounter, 924 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 2348 mSolverCounterSat, 812 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 3160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 812 IncrementalHoareTripleChecker+Valid, 2348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:41:52,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 804 Invalid, 3160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [812 Valid, 2348 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:41:53,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171990 states. [2025-03-03 10:41:53,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171990 to 127889. [2025-03-03 10:41:54,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127889 states, 127888 states have (on average 1.054579006630802) internal successors, (134868), 127888 states have internal predecessors, (134868), 0 states have call successors, (0), 0 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:41:54,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127889 states to 127889 states and 134868 transitions. [2025-03-03 10:41:54,186 INFO L78 Accepts]: Start accepts. Automaton has 127889 states and 134868 transitions. Word has length 601 [2025-03-03 10:41:54,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:41:54,186 INFO L471 AbstractCegarLoop]: Abstraction has 127889 states and 134868 transitions. [2025-03-03 10:41:54,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 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:41:54,186 INFO L276 IsEmpty]: Start isEmpty. Operand 127889 states and 134868 transitions. [2025-03-03 10:41:54,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2025-03-03 10:41:54,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:41:54,197 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:54,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:41:54,198 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:41:54,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:41:54,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1520310599, now seen corresponding path program 1 times [2025-03-03 10:41:54,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:41:54,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982663632] [2025-03-03 10:41:54,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:54,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:41:54,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes. [2025-03-03 10:41:54,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-03-03 10:41:54,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:54,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:54,707 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 599 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2025-03-03 10:41:54,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:41:54,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982663632] [2025-03-03 10:41:54,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982663632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:41:54,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:41:54,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:41:54,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183838672] [2025-03-03 10:41:54,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:41:54,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:41:54,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:41:54,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:41:54,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:41:54,709 INFO L87 Difference]: Start difference. First operand 127889 states and 134868 transitions. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 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:41:57,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:41:57,533 INFO L93 Difference]: Finished difference Result 299097 states and 316611 transitions. [2025-03-03 10:41:57,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:41:57,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 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 607 [2025-03-03 10:41:57,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:41:57,721 INFO L225 Difference]: With dead ends: 299097 [2025-03-03 10:41:57,721 INFO L226 Difference]: Without dead ends: 171997 [2025-03-03 10:41:57,800 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:41:57,801 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 1007 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2378 mSolverCounterSat, 805 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 3183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 805 IncrementalHoareTripleChecker+Valid, 2378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:41:57,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1007 Valid, 606 Invalid, 3183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [805 Valid, 2378 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:41:57,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171997 states. [2025-03-03 10:41:58,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171997 to 171206. [2025-03-03 10:41:59,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171206 states, 171205 states have (on average 1.0549049385239917) internal successors, (180605), 171205 states have internal predecessors, (180605), 0 states have call successors, (0), 0 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:41:59,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171206 states to 171206 states and 180605 transitions. [2025-03-03 10:41:59,186 INFO L78 Accepts]: Start accepts. Automaton has 171206 states and 180605 transitions. Word has length 607 [2025-03-03 10:41:59,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:41:59,186 INFO L471 AbstractCegarLoop]: Abstraction has 171206 states and 180605 transitions. [2025-03-03 10:41:59,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 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:41:59,186 INFO L276 IsEmpty]: Start isEmpty. Operand 171206 states and 180605 transitions. [2025-03-03 10:41:59,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2025-03-03 10:41:59,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:41:59,200 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:41:59,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 10:41:59,201 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:41:59,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:41:59,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1095363656, now seen corresponding path program 1 times [2025-03-03 10:41:59,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:41:59,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765543135] [2025-03-03 10:41:59,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:59,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:41:59,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 656 statements into 1 equivalence classes. [2025-03-03 10:41:59,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 656 of 656 statements. [2025-03-03 10:41:59,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:59,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:59,426 INFO L134 CoverageAnalysis]: Checked inductivity of 966 backedges. 675 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-03 10:41:59,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:41:59,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765543135] [2025-03-03 10:41:59,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765543135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:41:59,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:41:59,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:41:59,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202431200] [2025-03-03 10:41:59,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:41:59,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:41:59,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:41:59,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:41:59,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:41:59,427 INFO L87 Difference]: Start difference. First operand 171206 states and 180605 transitions. Second operand has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 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:42:02,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:02,261 INFO L93 Difference]: Finished difference Result 342415 states and 361250 transitions. [2025-03-03 10:42:02,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:02,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 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 656 [2025-03-03 10:42:02,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:02,434 INFO L225 Difference]: With dead ends: 342415 [2025-03-03 10:42:02,434 INFO L226 Difference]: Without dead ends: 171998 [2025-03-03 10:42:02,497 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:42:02,497 INFO L435 NwaCegarLoop]: 1675 mSDtfsCounter, 721 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 2401 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 1800 SdHoareTripleChecker+Invalid, 2406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:02,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 1800 Invalid, 2406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2401 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:42:02,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171998 states.