./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label00.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label00.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 958778a599a0592241cec2803e04add83a2302d606be24f73b4e8727645b338d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:48:46,868 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:48:46,934 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:48:46,939 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:48:46,939 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:48:46,956 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:48:46,957 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:48:46,957 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:48:46,957 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:48:46,957 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:48:46,957 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:48:46,958 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:48:46,958 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:48:46,958 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:48:46,958 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:48:46,958 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:48:46,958 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:48:46,958 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:48:46,958 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:48:46,958 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:48:46,959 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:48:46,959 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:48:46,959 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:48:46,959 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:48:46,959 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:48:46,959 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:48:46,959 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:48:46,959 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:48:46,959 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:48:46,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:48:46,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:48:46,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:48:46,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:48:46,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:48:46,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:48:46,960 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:48:46,960 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:48:46,960 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:48:46,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:48:46,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:48:46,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:48:46,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:48:46,960 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:48:46,960 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 958778a599a0592241cec2803e04add83a2302d606be24f73b4e8727645b338d [2025-02-05 17:48:47,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:48:47,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:48:47,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:48:47,205 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:48:47,205 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:48:47,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label00.c [2025-02-05 17:48:48,378 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3fac81751/abfa4032e7e343e4bfc2cc1feee4f2aa/FLAG01a7733b0 [2025-02-05 17:48:48,908 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:48:48,908 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label00.c [2025-02-05 17:48:48,971 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3fac81751/abfa4032e7e343e4bfc2cc1feee4f2aa/FLAG01a7733b0 [2025-02-05 17:48:48,985 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3fac81751/abfa4032e7e343e4bfc2cc1feee4f2aa [2025-02-05 17:48:48,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:48:48,988 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:48:48,989 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:48:48,989 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:48:48,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:48:48,992 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:48:48" (1/1) ... [2025-02-05 17:48:48,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23c10bb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:48:48, skipping insertion in model container [2025-02-05 17:48:48,994 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:48:48" (1/1) ... [2025-02-05 17:48:49,070 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:48:49,321 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label00.c[20454,20467] [2025-02-05 17:48:49,359 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label00.c[22329,22342] [2025-02-05 17:48:49,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:48:49,803 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:48:49,844 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label00.c[20454,20467] [2025-02-05 17:48:49,846 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label00.c[22329,22342] [2025-02-05 17:48:50,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:48:50,099 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:48:50,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:48:50 WrapperNode [2025-02-05 17:48:50,100 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:48:50,101 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:48:50,101 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:48:50,102 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:48:50,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:48:50" (1/1) ... [2025-02-05 17:48:50,151 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:48:50" (1/1) ... [2025-02-05 17:48:50,374 INFO L138 Inliner]: procedures = 39, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5213 [2025-02-05 17:48:50,374 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:48:50,375 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:48:50,375 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:48:50,375 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:48:50,381 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:48:50" (1/1) ... [2025-02-05 17:48:50,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:48:50" (1/1) ... [2025-02-05 17:48:50,416 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:48:50" (1/1) ... [2025-02-05 17:48:50,592 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 17:48:50,593 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:48:50" (1/1) ... [2025-02-05 17:48:50,593 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:48:50" (1/1) ... [2025-02-05 17:48:50,680 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:48:50" (1/1) ... [2025-02-05 17:48:50,700 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:48:50" (1/1) ... [2025-02-05 17:48:50,720 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:48:50" (1/1) ... [2025-02-05 17:48:50,737 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:48:50" (1/1) ... [2025-02-05 17:48:50,811 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:48:50,812 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:48:50,812 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:48:50,813 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:48:50,813 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:48:50" (1/1) ... [2025-02-05 17:48:50,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:48:50,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:48:50,839 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 17:48:50,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 17:48:50,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:48:50,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:48:50,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:48:50,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:48:50,961 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:48:50,963 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:48:54,253 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5256: havoc calculate_output3_#t~ret47#1; [2025-02-05 17:48:54,254 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2287: havoc calculate_output_#t~ret45#1; [2025-02-05 17:48:54,254 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3766: havoc calculate_output2_#t~ret46#1; [2025-02-05 17:48:54,395 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2025-02-05 17:48:54,396 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:48:54,429 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:48:54,432 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:48:54,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:48:54 BoogieIcfgContainer [2025-02-05 17:48:54,433 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:48:54,435 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:48:54,437 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:48:54,441 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:48:54,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:48:48" (1/3) ... [2025-02-05 17:48:54,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1fdf75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:48:54, skipping insertion in model container [2025-02-05 17:48:54,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:48:50" (2/3) ... [2025-02-05 17:48:54,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1fdf75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:48:54, skipping insertion in model container [2025-02-05 17:48:54,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:48:54" (3/3) ... [2025-02-05 17:48:54,443 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label00.c [2025-02-05 17:48:54,454 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:48:54,459 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label00.c that has 1 procedures, 931 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-05 17:48:54,529 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:48:54,536 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@411514f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:48:54,537 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:48:54,542 INFO L276 IsEmpty]: Start isEmpty. Operand has 931 states, 928 states have (on average 1.9019396551724137) internal successors, (1765), 930 states have internal predecessors, (1765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:54,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-05 17:48:54,546 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:48:54,546 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:48:54,546 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:48:54,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:48:54,550 INFO L85 PathProgramCache]: Analyzing trace with hash 907496396, now seen corresponding path program 1 times [2025-02-05 17:48:54,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:48:54,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937664869] [2025-02-05 17:48:54,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:48:54,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:48:54,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-05 17:48:54,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 17:48:54,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:48:54,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:48:54,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:48:54,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:48:54,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937664869] [2025-02-05 17:48:54,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937664869] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:48:54,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:48:54,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 17:48:54,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117073193] [2025-02-05 17:48:54,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:48:54,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:48:54,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:48:54,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:48:54,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:48:54,853 INFO L87 Difference]: Start difference. First operand has 931 states, 928 states have (on average 1.9019396551724137) internal successors, (1765), 930 states have internal predecessors, (1765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:57,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:48:57,659 INFO L93 Difference]: Finished difference Result 2560 states and 4922 transitions. [2025-02-05 17:48:57,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:48:57,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2025-02-05 17:48:57,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:48:57,675 INFO L225 Difference]: With dead ends: 2560 [2025-02-05 17:48:57,675 INFO L226 Difference]: Without dead ends: 1617 [2025-02-05 17:48:57,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:48:57,680 INFO L435 NwaCegarLoop]: 668 mSDtfsCounter, 1015 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:48:57,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 679 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 17:48:57,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2025-02-05 17:48:57,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2025-02-05 17:48:57,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1615 states have (on average 1.648297213622291) internal successors, (2662), 1616 states have internal predecessors, (2662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:57,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2662 transitions. [2025-02-05 17:48:57,762 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2662 transitions. Word has length 16 [2025-02-05 17:48:57,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:48:57,762 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2662 transitions. [2025-02-05 17:48:57,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:57,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2662 transitions. [2025-02-05 17:48:57,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-05 17:48:57,764 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:48:57,764 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:48:57,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:48:57,764 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:48:57,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:48:57,765 INFO L85 PathProgramCache]: Analyzing trace with hash 546257197, now seen corresponding path program 1 times [2025-02-05 17:48:57,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:48:57,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266627063] [2025-02-05 17:48:57,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:48:57,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:48:57,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-05 17:48:57,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-05 17:48:57,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:48:57,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:48:57,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:48:57,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:48:57,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266627063] [2025-02-05 17:48:57,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266627063] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:48:57,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:48:57,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:48:57,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826782245] [2025-02-05 17:48:57,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:48:57,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:48:57,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:48:57,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:48:57,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:48:57,953 INFO L87 Difference]: Start difference. First operand 1617 states and 2662 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:58,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:48:58,029 INFO L93 Difference]: Finished difference Result 1677 states and 2756 transitions. [2025-02-05 17:48:58,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:48:58,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-02-05 17:48:58,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:48:58,035 INFO L225 Difference]: With dead ends: 1677 [2025-02-05 17:48:58,035 INFO L226 Difference]: Without dead ends: 1617 [2025-02-05 17:48:58,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:48:58,037 INFO L435 NwaCegarLoop]: 1633 mSDtfsCounter, 0 mSDsluCounter, 4844 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6477 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:48:58,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6477 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:48:58,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2025-02-05 17:48:58,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2025-02-05 17:48:58,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1615 states have (on average 1.6173374613003095) internal successors, (2612), 1616 states have internal predecessors, (2612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:58,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2612 transitions. [2025-02-05 17:48:58,081 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2612 transitions. Word has length 28 [2025-02-05 17:48:58,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:48:58,081 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2612 transitions. [2025-02-05 17:48:58,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:58,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2612 transitions. [2025-02-05 17:48:58,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 17:48:58,086 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:48:58,086 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:48:58,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:48:58,086 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:48:58,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:48:58,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1657211218, now seen corresponding path program 1 times [2025-02-05 17:48:58,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:48:58,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548406010] [2025-02-05 17:48:58,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:48:58,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:48:58,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 17:48:58,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 17:48:58,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:48:58,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:48:58,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:48:58,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:48:58,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548406010] [2025-02-05 17:48:58,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548406010] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:48:58,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:48:58,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 17:48:58,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896794592] [2025-02-05 17:48:58,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:48:58,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 17:48:58,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:48:58,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 17:48:58,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:48:58,390 INFO L87 Difference]: Start difference. First operand 1617 states and 2612 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:58,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:48:58,709 INFO L93 Difference]: Finished difference Result 2401 states and 3872 transitions. [2025-02-05 17:48:58,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 17:48:58,712 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2025-02-05 17:48:58,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:48:58,721 INFO L225 Difference]: With dead ends: 2401 [2025-02-05 17:48:58,721 INFO L226 Difference]: Without dead ends: 2345 [2025-02-05 17:48:58,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2025-02-05 17:48:58,723 INFO L435 NwaCegarLoop]: 1579 mSDtfsCounter, 11538 mSDsluCounter, 3104 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11538 SdHoareTripleChecker+Valid, 4683 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:48:58,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11538 Valid, 4683 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:48:58,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2345 states. [2025-02-05 17:48:58,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2345 to 1671. [2025-02-05 17:48:58,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1669 states have (on average 1.6171360095865788) internal successors, (2699), 1670 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:58,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2699 transitions. [2025-02-05 17:48:58,756 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2699 transitions. Word has length 77 [2025-02-05 17:48:58,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:48:58,756 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2699 transitions. [2025-02-05 17:48:58,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:58,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2699 transitions. [2025-02-05 17:48:58,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 17:48:58,758 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:48:58,759 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:48:58,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:48:58,759 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:48:58,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:48:58,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1973239561, now seen corresponding path program 1 times [2025-02-05 17:48:58,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:48:58,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056449097] [2025-02-05 17:48:58,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:48:58,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:48:58,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 17:48:58,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 17:48:58,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:48:58,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:48:58,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:48:58,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:48:58,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056449097] [2025-02-05 17:48:58,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056449097] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:48:58,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:48:58,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:48:58,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208377126] [2025-02-05 17:48:58,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:48:58,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:48:58,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:48:58,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:48:58,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:48:58,882 INFO L87 Difference]: Start difference. First operand 1671 states and 2699 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:58,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:48:58,915 INFO L93 Difference]: Finished difference Result 1880 states and 3034 transitions. [2025-02-05 17:48:58,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:48:58,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-02-05 17:48:58,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:48:58,921 INFO L225 Difference]: With dead ends: 1880 [2025-02-05 17:48:58,921 INFO L226 Difference]: Without dead ends: 1770 [2025-02-05 17:48:58,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:48:58,924 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 1500 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1500 SdHoareTripleChecker+Valid, 1664 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:48:58,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1500 Valid, 1664 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:48:58,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2025-02-05 17:48:58,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1766. [2025-02-05 17:48:58,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1764 states have (on average 1.6150793650793651) internal successors, (2849), 1765 states have internal predecessors, (2849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:58,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2849 transitions. [2025-02-05 17:48:58,953 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2849 transitions. Word has length 79 [2025-02-05 17:48:58,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:48:58,953 INFO L471 AbstractCegarLoop]: Abstraction has 1766 states and 2849 transitions. [2025-02-05 17:48:58,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:58,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2849 transitions. [2025-02-05 17:48:58,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 17:48:58,954 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:48:58,954 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:48:58,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:48:58,955 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:48:58,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:48:58,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2005562796, now seen corresponding path program 1 times [2025-02-05 17:48:58,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:48:58,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472215369] [2025-02-05 17:48:58,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:48:58,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:48:58,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 17:48:58,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 17:48:58,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:48:58,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:48:59,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:48:59,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:48:59,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472215369] [2025-02-05 17:48:59,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472215369] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:48:59,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:48:59,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 17:48:59,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019832603] [2025-02-05 17:48:59,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:48:59,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 17:48:59,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:48:59,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 17:48:59,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:48:59,374 INFO L87 Difference]: Start difference. First operand 1766 states and 2849 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:59,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:48:59,631 INFO L93 Difference]: Finished difference Result 1973 states and 3177 transitions. [2025-02-05 17:48:59,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:48:59,631 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-02-05 17:48:59,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:48:59,637 INFO L225 Difference]: With dead ends: 1973 [2025-02-05 17:48:59,637 INFO L226 Difference]: Without dead ends: 1768 [2025-02-05 17:48:59,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-02-05 17:48:59,639 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 1562 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1562 SdHoareTripleChecker+Valid, 2193 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:48:59,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1562 Valid, 2193 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:48:59,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2025-02-05 17:48:59,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1766. [2025-02-05 17:48:59,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1764 states have (on average 1.6139455782312926) internal successors, (2847), 1765 states have internal predecessors, (2847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:59,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2847 transitions. [2025-02-05 17:48:59,666 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2847 transitions. Word has length 79 [2025-02-05 17:48:59,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:48:59,667 INFO L471 AbstractCegarLoop]: Abstraction has 1766 states and 2847 transitions. [2025-02-05 17:48:59,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:59,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2847 transitions. [2025-02-05 17:48:59,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 17:48:59,668 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:48:59,668 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:48:59,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:48:59,668 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:48:59,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:48:59,669 INFO L85 PathProgramCache]: Analyzing trace with hash 2073442266, now seen corresponding path program 1 times [2025-02-05 17:48:59,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:48:59,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559610956] [2025-02-05 17:48:59,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:48:59,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:48:59,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 17:48:59,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 17:48:59,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:48:59,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:48:59,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:48:59,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:48:59,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559610956] [2025-02-05 17:48:59,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559610956] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:48:59,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:48:59,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:48:59,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106527763] [2025-02-05 17:48:59,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:48:59,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:48:59,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:48:59,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:48:59,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:48:59,895 INFO L87 Difference]: Start difference. First operand 1766 states and 2847 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:59,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:48:59,948 INFO L93 Difference]: Finished difference Result 1774 states and 2856 transitions. [2025-02-05 17:48:59,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 17:48:59,949 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-02-05 17:48:59,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:48:59,955 INFO L225 Difference]: With dead ends: 1774 [2025-02-05 17:48:59,955 INFO L226 Difference]: Without dead ends: 1772 [2025-02-05 17:48:59,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:48:59,957 INFO L435 NwaCegarLoop]: 1579 mSDtfsCounter, 0 mSDsluCounter, 9461 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11040 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:48:59,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11040 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:48:59,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772 states. [2025-02-05 17:48:59,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1772 to 1772. [2025-02-05 17:48:59,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1772 states, 1770 states have (on average 1.6112994350282486) internal successors, (2852), 1771 states have internal predecessors, (2852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:59,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2852 transitions. [2025-02-05 17:48:59,984 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2852 transitions. Word has length 80 [2025-02-05 17:48:59,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:48:59,985 INFO L471 AbstractCegarLoop]: Abstraction has 1772 states and 2852 transitions. [2025-02-05 17:48:59,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:48:59,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2852 transitions. [2025-02-05 17:48:59,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 17:48:59,986 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:48:59,986 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:48:59,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:48:59,986 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:48:59,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:48:59,987 INFO L85 PathProgramCache]: Analyzing trace with hash -607984566, now seen corresponding path program 1 times [2025-02-05 17:48:59,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:48:59,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470267343] [2025-02-05 17:48:59,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:48:59,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:48:59,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 17:49:00,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 17:49:00,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:49:00,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:49:00,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:49:00,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:49:00,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470267343] [2025-02-05 17:49:00,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470267343] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:49:00,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:49:00,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:49:00,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304399722] [2025-02-05 17:49:00,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:49:00,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:49:00,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:49:00,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:49:00,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:49:00,039 INFO L87 Difference]: Start difference. First operand 1772 states and 2852 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:00,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:49:00,063 INFO L93 Difference]: Finished difference Result 2178 states and 3484 transitions. [2025-02-05 17:49:00,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:49:00,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-02-05 17:49:00,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:49:00,068 INFO L225 Difference]: With dead ends: 2178 [2025-02-05 17:49:00,068 INFO L226 Difference]: Without dead ends: 1967 [2025-02-05 17:49:00,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:49:00,069 INFO L435 NwaCegarLoop]: 1652 mSDtfsCounter, 1517 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 1747 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:49:00,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 1747 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:49:00,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1967 states. [2025-02-05 17:49:00,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1967 to 1965. [2025-02-05 17:49:00,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1965 states, 1963 states have (on average 1.6041772796739684) internal successors, (3149), 1964 states have internal predecessors, (3149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:00,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 3149 transitions. [2025-02-05 17:49:00,097 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 3149 transitions. Word has length 81 [2025-02-05 17:49:00,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:49:00,097 INFO L471 AbstractCegarLoop]: Abstraction has 1965 states and 3149 transitions. [2025-02-05 17:49:00,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:00,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 3149 transitions. [2025-02-05 17:49:00,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 17:49:00,099 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:49:00,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:49:00,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:49:00,099 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:49:00,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:49:00,100 INFO L85 PathProgramCache]: Analyzing trace with hash -762353398, now seen corresponding path program 1 times [2025-02-05 17:49:00,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:49:00,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076371888] [2025-02-05 17:49:00,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:49:00,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:49:00,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 17:49:00,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 17:49:00,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:49:00,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:49:00,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:49:00,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:49:00,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076371888] [2025-02-05 17:49:00,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076371888] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:49:00,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:49:00,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:49:00,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530358453] [2025-02-05 17:49:00,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:49:00,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:49:00,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:49:00,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:49:00,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:49:00,154 INFO L87 Difference]: Start difference. First operand 1965 states and 3149 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:00,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:49:00,181 INFO L93 Difference]: Finished difference Result 2741 states and 4347 transitions. [2025-02-05 17:49:00,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:49:00,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-02-05 17:49:00,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:49:00,188 INFO L225 Difference]: With dead ends: 2741 [2025-02-05 17:49:00,188 INFO L226 Difference]: Without dead ends: 2337 [2025-02-05 17:49:00,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:49:00,189 INFO L435 NwaCegarLoop]: 1650 mSDtfsCounter, 1515 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 1749 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:49:00,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 1749 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:49:00,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2025-02-05 17:49:00,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2335. [2025-02-05 17:49:00,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2335 states, 2333 states have (on average 1.5906558079725674) internal successors, (3711), 2334 states have internal predecessors, (3711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:00,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 3711 transitions. [2025-02-05 17:49:00,223 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 3711 transitions. Word has length 81 [2025-02-05 17:49:00,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:49:00,224 INFO L471 AbstractCegarLoop]: Abstraction has 2335 states and 3711 transitions. [2025-02-05 17:49:00,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:00,224 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 3711 transitions. [2025-02-05 17:49:00,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 17:49:00,225 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:49:00,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:49:00,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:49:00,225 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:49:00,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:49:00,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1741283894, now seen corresponding path program 1 times [2025-02-05 17:49:00,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:49:00,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500817401] [2025-02-05 17:49:00,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:49:00,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:49:00,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 17:49:00,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 17:49:00,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:49:00,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:49:00,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:49:00,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:49:00,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500817401] [2025-02-05 17:49:00,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500817401] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:49:00,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:49:00,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:49:00,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997677495] [2025-02-05 17:49:00,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:49:00,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:49:00,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:49:00,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:49:00,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:49:00,281 INFO L87 Difference]: Start difference. First operand 2335 states and 3711 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:00,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:49:00,314 INFO L93 Difference]: Finished difference Result 3819 states and 5977 transitions. [2025-02-05 17:49:00,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:49:00,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-02-05 17:49:00,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:49:00,322 INFO L225 Difference]: With dead ends: 3819 [2025-02-05 17:49:00,322 INFO L226 Difference]: Without dead ends: 3045 [2025-02-05 17:49:00,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:49:00,326 INFO L435 NwaCegarLoop]: 1648 mSDtfsCounter, 1513 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 1751 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:49:00,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1513 Valid, 1751 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:49:00,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3045 states. [2025-02-05 17:49:00,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3045 to 3043. [2025-02-05 17:49:00,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3043 states, 3041 states have (on average 1.568891811903979) internal successors, (4771), 3042 states have internal predecessors, (4771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:00,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 3043 states and 4771 transitions. [2025-02-05 17:49:00,450 INFO L78 Accepts]: Start accepts. Automaton has 3043 states and 4771 transitions. Word has length 81 [2025-02-05 17:49:00,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:49:00,451 INFO L471 AbstractCegarLoop]: Abstraction has 3043 states and 4771 transitions. [2025-02-05 17:49:00,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:00,451 INFO L276 IsEmpty]: Start isEmpty. Operand 3043 states and 4771 transitions. [2025-02-05 17:49:00,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 17:49:00,452 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:49:00,452 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:49:00,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:49:00,452 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:49:00,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:49:00,453 INFO L85 PathProgramCache]: Analyzing trace with hash 2105737866, now seen corresponding path program 1 times [2025-02-05 17:49:00,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:49:00,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031980512] [2025-02-05 17:49:00,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:49:00,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:49:00,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 17:49:00,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 17:49:00,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:49:00,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:49:00,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:49:00,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:49:00,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031980512] [2025-02-05 17:49:00,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031980512] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:49:00,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:49:00,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:49:00,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069456698] [2025-02-05 17:49:00,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:49:00,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:49:00,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:49:00,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:49:00,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:49:00,515 INFO L87 Difference]: Start difference. First operand 3043 states and 4771 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:00,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:49:00,580 INFO L93 Difference]: Finished difference Result 5879 states and 9045 transitions. [2025-02-05 17:49:00,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:49:00,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-02-05 17:49:00,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:49:00,592 INFO L225 Difference]: With dead ends: 5879 [2025-02-05 17:49:00,592 INFO L226 Difference]: Without dead ends: 4397 [2025-02-05 17:49:00,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:49:00,596 INFO L435 NwaCegarLoop]: 1646 mSDtfsCounter, 1511 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1511 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:49:00,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1511 Valid, 1753 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:49:00,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4397 states. [2025-02-05 17:49:00,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4397 to 4395. [2025-02-05 17:49:00,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4395 states, 4393 states have (on average 1.539494650580469) internal successors, (6763), 4394 states have internal predecessors, (6763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:00,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4395 states to 4395 states and 6763 transitions. [2025-02-05 17:49:00,708 INFO L78 Accepts]: Start accepts. Automaton has 4395 states and 6763 transitions. Word has length 81 [2025-02-05 17:49:00,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:49:00,709 INFO L471 AbstractCegarLoop]: Abstraction has 4395 states and 6763 transitions. [2025-02-05 17:49:00,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:00,709 INFO L276 IsEmpty]: Start isEmpty. Operand 4395 states and 6763 transitions. [2025-02-05 17:49:00,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 17:49:00,710 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:49:00,710 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:49:00,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:49:00,710 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:49:00,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:49:00,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1774053558, now seen corresponding path program 1 times [2025-02-05 17:49:00,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:49:00,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027823033] [2025-02-05 17:49:00,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:49:00,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:49:00,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 17:49:00,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 17:49:00,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:49:00,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:49:00,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:49:00,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:49:00,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027823033] [2025-02-05 17:49:00,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027823033] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:49:00,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:49:00,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:49:00,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705228190] [2025-02-05 17:49:00,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:49:00,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:49:00,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:49:00,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:49:00,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:49:00,769 INFO L87 Difference]: Start difference. First operand 4395 states and 6763 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:00,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:49:00,857 INFO L93 Difference]: Finished difference Result 9807 states and 14797 transitions. [2025-02-05 17:49:00,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:49:00,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-02-05 17:49:00,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:49:00,881 INFO L225 Difference]: With dead ends: 9807 [2025-02-05 17:49:00,881 INFO L226 Difference]: Without dead ends: 6973 [2025-02-05 17:49:00,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:49:00,887 INFO L435 NwaCegarLoop]: 1644 mSDtfsCounter, 1509 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1509 SdHoareTripleChecker+Valid, 1755 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:49:00,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1509 Valid, 1755 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:49:00,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6973 states. [2025-02-05 17:49:00,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6973 to 6971. [2025-02-05 17:49:01,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6971 states, 6969 states have (on average 1.5053809728798966) internal successors, (10491), 6970 states have internal predecessors, (10491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:01,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6971 states to 6971 states and 10491 transitions. [2025-02-05 17:49:01,029 INFO L78 Accepts]: Start accepts. Automaton has 6971 states and 10491 transitions. Word has length 81 [2025-02-05 17:49:01,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:49:01,030 INFO L471 AbstractCegarLoop]: Abstraction has 6971 states and 10491 transitions. [2025-02-05 17:49:01,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:01,030 INFO L276 IsEmpty]: Start isEmpty. Operand 6971 states and 10491 transitions. [2025-02-05 17:49:01,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 17:49:01,031 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:49:01,031 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:49:01,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:49:01,031 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:49:01,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:49:01,031 INFO L85 PathProgramCache]: Analyzing trace with hash 2034195466, now seen corresponding path program 1 times [2025-02-05 17:49:01,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:49:01,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369697482] [2025-02-05 17:49:01,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:49:01,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:49:01,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 17:49:01,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 17:49:01,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:49:01,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:49:01,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:49:01,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:49:01,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369697482] [2025-02-05 17:49:01,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369697482] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:49:01,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:49:01,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:49:01,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036347839] [2025-02-05 17:49:01,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:49:01,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:49:01,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:49:01,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:49:01,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:49:01,079 INFO L87 Difference]: Start difference. First operand 6971 states and 10491 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:01,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:49:01,220 INFO L93 Difference]: Finished difference Result 17279 states and 25533 transitions. [2025-02-05 17:49:01,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:49:01,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-02-05 17:49:01,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:49:01,241 INFO L225 Difference]: With dead ends: 17279 [2025-02-05 17:49:01,242 INFO L226 Difference]: Without dead ends: 11869 [2025-02-05 17:49:01,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:49:01,252 INFO L435 NwaCegarLoop]: 1642 mSDtfsCounter, 1507 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1757 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:49:01,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 1757 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:49:01,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11869 states. [2025-02-05 17:49:01,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11869 to 11867. [2025-02-05 17:49:01,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11867 states, 11865 states have (on average 1.4694479561736198) internal successors, (17435), 11866 states have internal predecessors, (17435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:01,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11867 states to 11867 states and 17435 transitions. [2025-02-05 17:49:01,576 INFO L78 Accepts]: Start accepts. Automaton has 11867 states and 17435 transitions. Word has length 81 [2025-02-05 17:49:01,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:49:01,576 INFO L471 AbstractCegarLoop]: Abstraction has 11867 states and 17435 transitions. [2025-02-05 17:49:01,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:01,577 INFO L276 IsEmpty]: Start isEmpty. Operand 11867 states and 17435 transitions. [2025-02-05 17:49:01,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 17:49:01,578 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:49:01,578 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:49:01,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:49:01,578 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:49:01,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:49:01,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1506966134, now seen corresponding path program 1 times [2025-02-05 17:49:01,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:49:01,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651746246] [2025-02-05 17:49:01,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:49:01,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:49:01,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 17:49:01,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 17:49:01,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:49:01,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:49:01,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:49:01,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:49:01,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651746246] [2025-02-05 17:49:01,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651746246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:49:01,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:49:01,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:49:01,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955739459] [2025-02-05 17:49:01,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:49:01,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:49:01,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:49:01,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:49:01,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:49:01,623 INFO L87 Difference]: Start difference. First operand 11867 states and 17435 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:01,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:49:01,774 INFO L93 Difference]: Finished difference Result 22626 states and 33185 transitions. [2025-02-05 17:49:01,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:49:01,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-02-05 17:49:01,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:49:01,803 INFO L225 Difference]: With dead ends: 22626 [2025-02-05 17:49:01,803 INFO L226 Difference]: Without dead ends: 16863 [2025-02-05 17:49:01,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:49:01,815 INFO L435 NwaCegarLoop]: 1657 mSDtfsCounter, 1516 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 1748 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:49:01,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 1748 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:49:01,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16863 states. [2025-02-05 17:49:02,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16863 to 16861. [2025-02-05 17:49:02,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16861 states, 16859 states have (on average 1.455661664392906) internal successors, (24541), 16860 states have internal predecessors, (24541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:02,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16861 states to 16861 states and 24541 transitions. [2025-02-05 17:49:02,151 INFO L78 Accepts]: Start accepts. Automaton has 16861 states and 24541 transitions. Word has length 83 [2025-02-05 17:49:02,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:49:02,152 INFO L471 AbstractCegarLoop]: Abstraction has 16861 states and 24541 transitions. [2025-02-05 17:49:02,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:02,152 INFO L276 IsEmpty]: Start isEmpty. Operand 16861 states and 24541 transitions. [2025-02-05 17:49:02,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 17:49:02,152 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:49:02,153 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:49:02,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:49:02,153 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:49:02,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:49:02,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1527401258, now seen corresponding path program 1 times [2025-02-05 17:49:02,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:49:02,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815997658] [2025-02-05 17:49:02,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:49:02,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:49:02,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 17:49:02,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 17:49:02,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:49:02,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:49:02,205 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:49:02,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:49:02,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815997658] [2025-02-05 17:49:02,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815997658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:49:02,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:49:02,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:49:02,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167991302] [2025-02-05 17:49:02,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:49:02,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:49:02,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:49:02,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:49:02,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:49:02,207 INFO L87 Difference]: Start difference. First operand 16861 states and 24541 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:04,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:49:04,895 INFO L93 Difference]: Finished difference Result 19867 states and 29468 transitions. [2025-02-05 17:49:04,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:49:04,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-02-05 17:49:04,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:49:04,925 INFO L225 Difference]: With dead ends: 19867 [2025-02-05 17:49:04,926 INFO L226 Difference]: Without dead ends: 18363 [2025-02-05 17:49:04,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:49:04,935 INFO L435 NwaCegarLoop]: 1295 mSDtfsCounter, 753 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 2412 mSolverCounterSat, 681 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 3093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 681 IncrementalHoareTripleChecker+Valid, 2412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:49:04,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 1449 Invalid, 3093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [681 Valid, 2412 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 17:49:04,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18363 states. [2025-02-05 17:49:05,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18363 to 18363. [2025-02-05 17:49:05,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18363 states, 18361 states have (on average 1.45400577310604) internal successors, (26697), 18362 states have internal predecessors, (26697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:05,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18363 states to 18363 states and 26697 transitions. [2025-02-05 17:49:05,292 INFO L78 Accepts]: Start accepts. Automaton has 18363 states and 26697 transitions. Word has length 87 [2025-02-05 17:49:05,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:49:05,292 INFO L471 AbstractCegarLoop]: Abstraction has 18363 states and 26697 transitions. [2025-02-05 17:49:05,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:05,292 INFO L276 IsEmpty]: Start isEmpty. Operand 18363 states and 26697 transitions. [2025-02-05 17:49:05,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:49:05,293 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:49:05,293 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:49:05,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:49:05,293 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:49:05,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:49:05,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1902277340, now seen corresponding path program 1 times [2025-02-05 17:49:05,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:49:05,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168817453] [2025-02-05 17:49:05,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:49:05,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:49:05,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:49:05,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:49:05,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:49:05,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:49:05,339 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:49:05,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:49:05,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168817453] [2025-02-05 17:49:05,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168817453] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:49:05,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:49:05,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 17:49:05,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351498271] [2025-02-05 17:49:05,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:49:05,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:49:05,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:49:05,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:49:05,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:49:05,341 INFO L87 Difference]: Start difference. First operand 18363 states and 26697 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:08,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:49:08,011 INFO L93 Difference]: Finished difference Result 24373 states and 35936 transitions. [2025-02-05 17:49:08,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:49:08,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2025-02-05 17:49:08,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:49:08,080 INFO L225 Difference]: With dead ends: 24373 [2025-02-05 17:49:08,084 INFO L226 Difference]: Without dead ends: 21367 [2025-02-05 17:49:08,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:49:08,093 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 920 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 935 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:49:08,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [920 Valid, 593 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [935 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 17:49:08,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21367 states. [2025-02-05 17:49:08,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21367 to 21367. [2025-02-05 17:49:08,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21367 states, 21365 states have (on average 1.419424292066464) internal successors, (30326), 21366 states have internal predecessors, (30326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:08,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21367 states to 21367 states and 30326 transitions. [2025-02-05 17:49:08,505 INFO L78 Accepts]: Start accepts. Automaton has 21367 states and 30326 transitions. Word has length 90 [2025-02-05 17:49:08,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:49:08,505 INFO L471 AbstractCegarLoop]: Abstraction has 21367 states and 30326 transitions. [2025-02-05 17:49:08,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:08,505 INFO L276 IsEmpty]: Start isEmpty. Operand 21367 states and 30326 transitions. [2025-02-05 17:49:08,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 17:49:08,507 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:49:08,507 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:49:08,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:49:08,507 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:49:08,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:49:08,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1319872829, now seen corresponding path program 1 times [2025-02-05 17:49:08,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:49:08,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551539961] [2025-02-05 17:49:08,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:49:08,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:49:08,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 17:49:08,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 17:49:08,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:49:08,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:49:08,678 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:49:08,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:49:08,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551539961] [2025-02-05 17:49:08,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551539961] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:49:08,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:49:08,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:49:08,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635302173] [2025-02-05 17:49:08,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:49:08,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:49:08,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:49:08,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:49:08,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:49:08,681 INFO L87 Difference]: Start difference. First operand 21367 states and 30326 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:11,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:49:11,187 INFO L93 Difference]: Finished difference Result 28128 states and 39446 transitions. [2025-02-05 17:49:11,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:49:11,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-02-05 17:49:11,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:49:11,285 INFO L225 Difference]: With dead ends: 28128 [2025-02-05 17:49:11,285 INFO L226 Difference]: Without dead ends: 22118 [2025-02-05 17:49:11,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:49:11,291 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 1030 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 3152 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1030 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 3265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 3152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:49:11,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1030 Valid, 1461 Invalid, 3265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 3152 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 17:49:11,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22118 states. [2025-02-05 17:49:11,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22118 to 22118. [2025-02-05 17:49:11,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22118 states, 22116 states have (on average 1.4054530656538253) internal successors, (31083), 22117 states have internal predecessors, (31083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:11,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22118 states to 22118 states and 31083 transitions. [2025-02-05 17:49:11,600 INFO L78 Accepts]: Start accepts. Automaton has 22118 states and 31083 transitions. Word has length 97 [2025-02-05 17:49:11,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:49:11,600 INFO L471 AbstractCegarLoop]: Abstraction has 22118 states and 31083 transitions. [2025-02-05 17:49:11,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:11,601 INFO L276 IsEmpty]: Start isEmpty. Operand 22118 states and 31083 transitions. [2025-02-05 17:49:11,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 17:49:11,604 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:49:11,604 INFO L218 NwaCegarLoop]: trace histogram [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-02-05 17:49:11,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 17:49:11,605 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:49:11,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:49:11,606 INFO L85 PathProgramCache]: Analyzing trace with hash 113999974, now seen corresponding path program 1 times [2025-02-05 17:49:11,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:49:11,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002678965] [2025-02-05 17:49:11,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:49:11,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:49:11,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 17:49:11,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 17:49:11,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:49:11,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:49:11,791 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 17:49:11,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:49:11,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002678965] [2025-02-05 17:49:11,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002678965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:49:11,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:49:11,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 17:49:11,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521849743] [2025-02-05 17:49:11,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:49:11,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 17:49:11,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:49:11,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 17:49:11,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:49:11,793 INFO L87 Difference]: Start difference. First operand 22118 states and 31083 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:12,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:49:12,949 INFO L93 Difference]: Finished difference Result 132342 states and 189555 transitions. [2025-02-05 17:49:12,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:49:12,950 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 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 104 [2025-02-05 17:49:12,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:49:13,098 INFO L225 Difference]: With dead ends: 132342 [2025-02-05 17:49:13,098 INFO L226 Difference]: Without dead ends: 117044 [2025-02-05 17:49:13,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-02-05 17:49:13,136 INFO L435 NwaCegarLoop]: 1678 mSDtfsCounter, 9830 mSDsluCounter, 2923 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9830 SdHoareTripleChecker+Valid, 4601 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:49:13,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9830 Valid, 4601 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:49:13,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117044 states. [2025-02-05 17:49:14,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117044 to 37414. [2025-02-05 17:49:14,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37414 states, 37412 states have (on average 1.4141719234470222) internal successors, (52907), 37413 states have internal predecessors, (52907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:14,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37414 states to 37414 states and 52907 transitions. [2025-02-05 17:49:14,158 INFO L78 Accepts]: Start accepts. Automaton has 37414 states and 52907 transitions. Word has length 104 [2025-02-05 17:49:14,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:49:14,158 INFO L471 AbstractCegarLoop]: Abstraction has 37414 states and 52907 transitions. [2025-02-05 17:49:14,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:14,158 INFO L276 IsEmpty]: Start isEmpty. Operand 37414 states and 52907 transitions. [2025-02-05 17:49:14,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 17:49:14,162 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:49:14,162 INFO L218 NwaCegarLoop]: trace histogram [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-02-05 17:49:14,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 17:49:14,163 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:49:14,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:49:14,163 INFO L85 PathProgramCache]: Analyzing trace with hash -40368858, now seen corresponding path program 1 times [2025-02-05 17:49:14,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:49:14,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967289195] [2025-02-05 17:49:14,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:49:14,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:49:14,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 17:49:14,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 17:49:14,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:49:14,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:49:14,380 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 17:49:14,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:49:14,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967289195] [2025-02-05 17:49:14,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967289195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:49:14,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:49:14,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 17:49:14,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992704814] [2025-02-05 17:49:14,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:49:14,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 17:49:14,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:49:14,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 17:49:14,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:49:14,381 INFO L87 Difference]: Start difference. First operand 37414 states and 52907 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:16,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:49:16,793 INFO L93 Difference]: Finished difference Result 147638 states and 211379 transitions. [2025-02-05 17:49:16,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:49:16,793 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 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 104 [2025-02-05 17:49:16,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:49:16,942 INFO L225 Difference]: With dead ends: 147638 [2025-02-05 17:49:16,942 INFO L226 Difference]: Without dead ends: 132340 [2025-02-05 17:49:16,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-02-05 17:49:16,972 INFO L435 NwaCegarLoop]: 1675 mSDtfsCounter, 9851 mSDsluCounter, 2822 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9851 SdHoareTripleChecker+Valid, 4497 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:49:16,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9851 Valid, 4497 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:49:17,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132340 states. [2025-02-05 17:49:18,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132340 to 60390. [2025-02-05 17:49:18,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60390 states, 60388 states have (on average 1.4155626945750812) internal successors, (85483), 60389 states have internal predecessors, (85483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:18,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60390 states to 60390 states and 85483 transitions. [2025-02-05 17:49:18,565 INFO L78 Accepts]: Start accepts. Automaton has 60390 states and 85483 transitions. Word has length 104 [2025-02-05 17:49:18,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:49:18,566 INFO L471 AbstractCegarLoop]: Abstraction has 60390 states and 85483 transitions. [2025-02-05 17:49:18,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:18,566 INFO L276 IsEmpty]: Start isEmpty. Operand 60390 states and 85483 transitions. [2025-02-05 17:49:18,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 17:49:18,571 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:49:18,571 INFO L218 NwaCegarLoop]: trace histogram [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-02-05 17:49:18,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 17:49:18,571 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:49:18,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:49:18,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1019299354, now seen corresponding path program 1 times [2025-02-05 17:49:18,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:49:18,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885144029] [2025-02-05 17:49:18,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:49:18,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:49:18,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 17:49:18,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 17:49:18,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:49:18,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:49:18,701 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 17:49:18,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:49:18,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885144029] [2025-02-05 17:49:18,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885144029] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:49:18,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:49:18,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 17:49:18,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517641972] [2025-02-05 17:49:18,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:49:18,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 17:49:18,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:49:18,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 17:49:18,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:49:18,702 INFO L87 Difference]: Start difference. First operand 60390 states and 85483 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:21,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:49:21,378 INFO L93 Difference]: Finished difference Result 162934 states and 233203 transitions. [2025-02-05 17:49:21,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:49:21,378 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 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 104 [2025-02-05 17:49:21,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:49:21,559 INFO L225 Difference]: With dead ends: 162934 [2025-02-05 17:49:21,559 INFO L226 Difference]: Without dead ends: 147636 [2025-02-05 17:49:21,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-02-05 17:49:21,598 INFO L435 NwaCegarLoop]: 1672 mSDtfsCounter, 9896 mSDsluCounter, 2718 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9896 SdHoareTripleChecker+Valid, 4390 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:49:21,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9896 Valid, 4390 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:49:21,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147636 states. [2025-02-05 17:49:23,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147636 to 75686. [2025-02-05 17:49:23,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75686 states, 75684 states have (on average 1.4178293959093071) internal successors, (107307), 75685 states have internal predecessors, (107307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:23,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75686 states to 75686 states and 107307 transitions. [2025-02-05 17:49:23,655 INFO L78 Accepts]: Start accepts. Automaton has 75686 states and 107307 transitions. Word has length 104 [2025-02-05 17:49:23,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:49:23,655 INFO L471 AbstractCegarLoop]: Abstraction has 75686 states and 107307 transitions. [2025-02-05 17:49:23,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:23,655 INFO L276 IsEmpty]: Start isEmpty. Operand 75686 states and 107307 transitions. [2025-02-05 17:49:23,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 17:49:23,660 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:49:23,660 INFO L218 NwaCegarLoop]: trace histogram [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-02-05 17:49:23,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 17:49:23,660 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:49:23,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:49:23,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1467244890, now seen corresponding path program 1 times [2025-02-05 17:49:23,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:49:23,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686525590] [2025-02-05 17:49:23,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:49:23,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:49:23,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 17:49:23,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 17:49:23,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:49:23,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:49:23,786 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 17:49:23,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:49:23,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686525590] [2025-02-05 17:49:23,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686525590] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:49:23,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:49:23,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 17:49:23,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772312643] [2025-02-05 17:49:23,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:49:23,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 17:49:23,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:49:23,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 17:49:23,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:49:23,787 INFO L87 Difference]: Start difference. First operand 75686 states and 107307 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:27,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:49:27,187 INFO L93 Difference]: Finished difference Result 178230 states and 255027 transitions. [2025-02-05 17:49:27,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:49:27,188 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 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 104 [2025-02-05 17:49:27,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:49:27,397 INFO L225 Difference]: With dead ends: 178230 [2025-02-05 17:49:27,397 INFO L226 Difference]: Without dead ends: 162932 [2025-02-05 17:49:27,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-02-05 17:49:27,448 INFO L435 NwaCegarLoop]: 1669 mSDtfsCounter, 9942 mSDsluCounter, 2714 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9942 SdHoareTripleChecker+Valid, 4383 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:49:27,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9942 Valid, 4383 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:49:27,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162932 states. [2025-02-05 17:49:29,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162932 to 90982. [2025-02-05 17:49:29,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90982 states, 90980 states have (on average 1.4193339195427566) internal successors, (129131), 90981 states have internal predecessors, (129131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:29,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90982 states to 90982 states and 129131 transitions. [2025-02-05 17:49:29,819 INFO L78 Accepts]: Start accepts. Automaton has 90982 states and 129131 transitions. Word has length 104 [2025-02-05 17:49:29,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:49:29,819 INFO L471 AbstractCegarLoop]: Abstraction has 90982 states and 129131 transitions. [2025-02-05 17:49:29,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:29,819 INFO L276 IsEmpty]: Start isEmpty. Operand 90982 states and 129131 transitions. [2025-02-05 17:49:29,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 17:49:29,824 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:49:29,824 INFO L218 NwaCegarLoop]: trace histogram [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-02-05 17:49:29,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 17:49:29,825 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:49:29,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:49:29,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1052069018, now seen corresponding path program 1 times [2025-02-05 17:49:29,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:49:29,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631830585] [2025-02-05 17:49:29,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:49:29,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:49:29,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 17:49:29,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 17:49:29,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:49:29,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:49:29,953 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 17:49:29,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:49:29,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631830585] [2025-02-05 17:49:29,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631830585] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:49:29,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:49:29,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 17:49:29,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109528985] [2025-02-05 17:49:29,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:49:29,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 17:49:29,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:49:29,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 17:49:29,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:49:29,955 INFO L87 Difference]: Start difference. First operand 90982 states and 129131 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:33,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:49:33,797 INFO L93 Difference]: Finished difference Result 193526 states and 276851 transitions. [2025-02-05 17:49:33,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:49:33,798 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 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 104 [2025-02-05 17:49:33,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:49:34,025 INFO L225 Difference]: With dead ends: 193526 [2025-02-05 17:49:34,026 INFO L226 Difference]: Without dead ends: 178228 [2025-02-05 17:49:34,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-02-05 17:49:34,087 INFO L435 NwaCegarLoop]: 1666 mSDtfsCounter, 10005 mSDsluCounter, 2723 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10005 SdHoareTripleChecker+Valid, 4389 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:49:34,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10005 Valid, 4389 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:49:34,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178228 states. [2025-02-05 17:49:36,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178228 to 106278. [2025-02-05 17:49:36,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106278 states, 106276 states have (on average 1.4204053596296435) internal successors, (150955), 106277 states have internal predecessors, (150955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:37,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106278 states to 106278 states and 150955 transitions. [2025-02-05 17:49:37,062 INFO L78 Accepts]: Start accepts. Automaton has 106278 states and 150955 transitions. Word has length 104 [2025-02-05 17:49:37,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:49:37,062 INFO L471 AbstractCegarLoop]: Abstraction has 106278 states and 150955 transitions. [2025-02-05 17:49:37,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:37,063 INFO L276 IsEmpty]: Start isEmpty. Operand 106278 states and 150955 transitions. [2025-02-05 17:49:37,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 17:49:37,067 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:49:37,068 INFO L218 NwaCegarLoop]: trace histogram [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-02-05 17:49:37,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 17:49:37,068 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:49:37,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:49:37,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1538787290, now seen corresponding path program 1 times [2025-02-05 17:49:37,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:49:37,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085666338] [2025-02-05 17:49:37,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:49:37,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:49:37,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 17:49:37,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 17:49:37,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:49:37,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:49:37,193 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 17:49:37,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:49:37,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085666338] [2025-02-05 17:49:37,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085666338] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:49:37,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:49:37,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 17:49:37,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276171398] [2025-02-05 17:49:37,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:49:37,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 17:49:37,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:49:37,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 17:49:37,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:49:37,195 INFO L87 Difference]: Start difference. First operand 106278 states and 150955 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:40,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:49:40,552 INFO L93 Difference]: Finished difference Result 208822 states and 298675 transitions. [2025-02-05 17:49:40,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:49:40,552 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 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 104 [2025-02-05 17:49:40,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:49:40,811 INFO L225 Difference]: With dead ends: 208822 [2025-02-05 17:49:40,811 INFO L226 Difference]: Without dead ends: 193524 [2025-02-05 17:49:40,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-02-05 17:49:40,861 INFO L435 NwaCegarLoop]: 1674 mSDtfsCounter, 9851 mSDsluCounter, 2884 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9851 SdHoareTripleChecker+Valid, 4558 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:49:40,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9851 Valid, 4558 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:49:40,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193524 states. [2025-02-05 17:49:43,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193524 to 121574. [2025-02-05 17:49:43,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121574 states, 121572 states have (on average 1.4212071858651663) internal successors, (172779), 121573 states have internal predecessors, (172779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:44,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121574 states to 121574 states and 172779 transitions. [2025-02-05 17:49:44,322 INFO L78 Accepts]: Start accepts. Automaton has 121574 states and 172779 transitions. Word has length 104 [2025-02-05 17:49:44,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:49:44,323 INFO L471 AbstractCegarLoop]: Abstraction has 121574 states and 172779 transitions. [2025-02-05 17:49:44,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:49:44,323 INFO L276 IsEmpty]: Start isEmpty. Operand 121574 states and 172779 transitions. [2025-02-05 17:49:44,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-05 17:49:44,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:49:44,330 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 17:49:44,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 17:49:44,330 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:49:44,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:49:44,331 INFO L85 PathProgramCache]: Analyzing trace with hash -962498204, now seen corresponding path program 1 times [2025-02-05 17:49:44,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:49:44,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623515210] [2025-02-05 17:49:44,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:49:44,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:49:44,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 17:49:44,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 17:49:44,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:49:44,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:49:44,433 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:49:44,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:49:44,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623515210] [2025-02-05 17:49:44,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623515210] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:49:44,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:49:44,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:49:44,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757322453] [2025-02-05 17:49:44,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:49:44,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:49:44,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:49:44,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:49:44,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:49:44,435 INFO L87 Difference]: Start difference. First operand 121574 states and 172779 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 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)