./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.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.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.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 7fcfcf7d93c3fc85869efa536862a56a3ba120e3589f116e608720bbd1f279d7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:35:08,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:35:08,706 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:35:08,709 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:35:08,710 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:35:08,723 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:35:08,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:35:08,724 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:35:08,724 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:35:08,724 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:35:08,724 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:35:08,724 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:35:08,724 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:35:08,724 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:35:08,725 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:35:08,725 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:35:08,725 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:35:08,725 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:35:08,725 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:35:08,725 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:35:08,725 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:35:08,725 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:35:08,725 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:35:08,725 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:35:08,726 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:35:08,726 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:35:08,726 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:35:08,726 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:35:08,726 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:35:08,726 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:35:08,726 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:35:08,726 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:35:08,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:35:08,726 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:35:08,726 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:35:08,726 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:35:08,727 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:35:08,727 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:35:08,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:35:08,727 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:35:08,727 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:35:08,727 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:35:08,727 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:35:08,727 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 -> 7fcfcf7d93c3fc85869efa536862a56a3ba120e3589f116e608720bbd1f279d7 [2025-02-05 17:35:08,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:35:08,959 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:35:08,961 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:35:08,963 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:35:08,963 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:35:08,965 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c [2025-02-05 17:35:10,344 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bda340f97/a3aec49eedb54fde917589c15fa5b59c/FLAG41bafeb0e [2025-02-05 17:35:11,088 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:35:11,089 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c [2025-02-05 17:35:11,120 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bda340f97/a3aec49eedb54fde917589c15fa5b59c/FLAG41bafeb0e [2025-02-05 17:35:11,135 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bda340f97/a3aec49eedb54fde917589c15fa5b59c [2025-02-05 17:35:11,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:35:11,139 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:35:11,141 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:35:11,142 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:35:11,145 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:35:11,145 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:35:11" (1/1) ... [2025-02-05 17:35:11,147 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63914c3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:11, skipping insertion in model container [2025-02-05 17:35:11,148 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:35:11" (1/1) ... [2025-02-05 17:35:11,266 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:35:11,529 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.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[6524,6537] [2025-02-05 17:35:11,588 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.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[12079,12092] [2025-02-05 17:35:12,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:35:12,261 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:35:12,285 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.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[6524,6537] [2025-02-05 17:35:12,290 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.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[12079,12092] [2025-02-05 17:35:12,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:35:12,561 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:35:12,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:12 WrapperNode [2025-02-05 17:35:12,563 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:35:12,564 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:35:12,564 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:35:12,565 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:35:12,568 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:35:12" (1/1) ... [2025-02-05 17:35:12,605 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:35:12" (1/1) ... [2025-02-05 17:35:12,854 INFO L138 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4975 [2025-02-05 17:35:12,854 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:35:12,855 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:35:12,855 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:35:12,856 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:35:12,862 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:12" (1/1) ... [2025-02-05 17:35:12,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:12" (1/1) ... [2025-02-05 17:35:12,924 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:12" (1/1) ... [2025-02-05 17:35:13,059 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:35:13,059 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:12" (1/1) ... [2025-02-05 17:35:13,059 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:12" (1/1) ... [2025-02-05 17:35:13,300 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:12" (1/1) ... [2025-02-05 17:35:13,311 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:12" (1/1) ... [2025-02-05 17:35:13,325 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:12" (1/1) ... [2025-02-05 17:35:13,340 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:12" (1/1) ... [2025-02-05 17:35:13,377 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:35:13,379 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:35:13,379 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:35:13,379 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:35:13,381 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:12" (1/1) ... [2025-02-05 17:35:13,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:35:13,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:35:13,406 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:35:13,412 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:35:13,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:35:13,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:35:13,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:35:13,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:35:13,497 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:35:13,498 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:35:18,450 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1986: havoc calculate_output_#t~ret29#1; [2025-02-05 17:35:18,450 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3465: havoc calculate_output2_#t~ret30#1; [2025-02-05 17:35:18,451 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4955: havoc calculate_output3_#t~ret31#1; [2025-02-05 17:35:18,622 INFO L? ?]: Removed 734 outVars from TransFormulas that were not future-live. [2025-02-05 17:35:18,622 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:35:18,649 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:35:18,650 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:35:18,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:35:18 BoogieIcfgContainer [2025-02-05 17:35:18,650 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:35:18,656 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:35:18,656 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:35:18,660 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:35:18,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:35:11" (1/3) ... [2025-02-05 17:35:18,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33f100fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:35:18, skipping insertion in model container [2025-02-05 17:35:18,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:12" (2/3) ... [2025-02-05 17:35:18,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33f100fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:35:18, skipping insertion in model container [2025-02-05 17:35:18,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:35:18" (3/3) ... [2025-02-05 17:35:18,669 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c [2025-02-05 17:35:18,690 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:35:18,696 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c that has 1 procedures, 871 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-05 17:35:18,754 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:35:18,762 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;@3bce5ba1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:35:18,763 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:35:18,772 INFO L276 IsEmpty]: Start isEmpty. Operand has 871 states, 868 states have (on average 1.9055299539170507) internal successors, (1654), 870 states have internal predecessors, (1654), 0 states have call successors, (0), 0 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:35:18,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 17:35:18,782 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:18,783 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] [2025-02-05 17:35:18,785 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:18,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:18,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1636970803, now seen corresponding path program 1 times [2025-02-05 17:35:18,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:18,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926419673] [2025-02-05 17:35:18,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:18,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:18,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 17:35:18,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 17:35:18,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:18,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:19,036 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:35:19,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:19,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926419673] [2025-02-05 17:35:19,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926419673] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:19,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:19,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 17:35:19,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609001214] [2025-02-05 17:35:19,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:19,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 17:35:19,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:19,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 17:35:19,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 17:35:19,060 INFO L87 Difference]: Start difference. First operand has 871 states, 868 states have (on average 1.9055299539170507) internal successors, (1654), 870 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 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:35:19,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:19,125 INFO L93 Difference]: Finished difference Result 1719 states and 3267 transitions. [2025-02-05 17:35:19,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 17:35:19,127 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2025-02-05 17:35:19,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:19,136 INFO L225 Difference]: With dead ends: 1719 [2025-02-05 17:35:19,137 INFO L226 Difference]: Without dead ends: 806 [2025-02-05 17:35:19,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 17:35:19,148 INFO L435 NwaCegarLoop]: 1588 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:19,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1588 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:19,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2025-02-05 17:35:19,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 806. [2025-02-05 17:35:19,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 804 states have (on average 1.8955223880597014) internal successors, (1524), 805 states have internal predecessors, (1524), 0 states have call successors, (0), 0 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:35:19,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1524 transitions. [2025-02-05 17:35:19,203 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1524 transitions. Word has length 20 [2025-02-05 17:35:19,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:19,203 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1524 transitions. [2025-02-05 17:35:19,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 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:35:19,204 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1524 transitions. [2025-02-05 17:35:19,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 17:35:19,204 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:19,204 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] [2025-02-05 17:35:19,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:35:19,205 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:19,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:19,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1131412178, now seen corresponding path program 1 times [2025-02-05 17:35:19,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:19,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65638852] [2025-02-05 17:35:19,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:19,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:19,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 17:35:19,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 17:35:19,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:19,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:19,356 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:35:19,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:19,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65638852] [2025-02-05 17:35:19,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65638852] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:19,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:19,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:35:19,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29870490] [2025-02-05 17:35:19,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:19,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:35:19,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:19,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:35:19,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:35:19,358 INFO L87 Difference]: Start difference. First operand 806 states and 1524 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 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:35:19,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:19,456 INFO L93 Difference]: Finished difference Result 840 states and 1575 transitions. [2025-02-05 17:35:19,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:35:19,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2025-02-05 17:35:19,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:19,460 INFO L225 Difference]: With dead ends: 840 [2025-02-05 17:35:19,460 INFO L226 Difference]: Without dead ends: 806 [2025-02-05 17:35:19,464 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:35:19,465 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 0 mSDsluCounter, 4545 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6067 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:19,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6067 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:19,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2025-02-05 17:35:19,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 806. [2025-02-05 17:35:19,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 804 states have (on average 1.8756218905472637) internal successors, (1508), 805 states have internal predecessors, (1508), 0 states have call successors, (0), 0 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:35:19,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1508 transitions. [2025-02-05 17:35:19,512 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1508 transitions. Word has length 20 [2025-02-05 17:35:19,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:19,512 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1508 transitions. [2025-02-05 17:35:19,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 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:35:19,513 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1508 transitions. [2025-02-05 17:35:19,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-05 17:35:19,514 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:19,514 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] [2025-02-05 17:35:19,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:35:19,514 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:19,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:19,515 INFO L85 PathProgramCache]: Analyzing trace with hash 784018818, now seen corresponding path program 1 times [2025-02-05 17:35:19,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:19,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186165960] [2025-02-05 17:35:19,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:19,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:19,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-05 17:35:19,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 17:35:19,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:19,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:19,678 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:35:19,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:19,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186165960] [2025-02-05 17:35:19,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186165960] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:19,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:19,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:35:19,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837541863] [2025-02-05 17:35:19,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:19,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:35:19,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:19,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:35:19,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:35:19,682 INFO L87 Difference]: Start difference. First operand 806 states and 1508 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 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:35:19,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:19,798 INFO L93 Difference]: Finished difference Result 986 states and 1790 transitions. [2025-02-05 17:35:19,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:35:19,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2025-02-05 17:35:19,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:19,803 INFO L225 Difference]: With dead ends: 986 [2025-02-05 17:35:19,803 INFO L226 Difference]: Without dead ends: 956 [2025-02-05 17:35:19,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:35:19,804 INFO L435 NwaCegarLoop]: 1504 mSDtfsCounter, 4589 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4589 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:19,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4589 Valid, 1865 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:35:19,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2025-02-05 17:35:19,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 834. [2025-02-05 17:35:19,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 832 states have (on average 1.8653846153846154) internal successors, (1552), 833 states have internal predecessors, (1552), 0 states have call successors, (0), 0 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:35:19,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1552 transitions. [2025-02-05 17:35:19,822 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1552 transitions. Word has length 35 [2025-02-05 17:35:19,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:19,822 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1552 transitions. [2025-02-05 17:35:19,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 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:35:19,823 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1552 transitions. [2025-02-05 17:35:19,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 17:35:19,823 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:19,824 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] [2025-02-05 17:35:19,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:35:19,824 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:19,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:19,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1351806755, now seen corresponding path program 1 times [2025-02-05 17:35:19,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:19,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15156076] [2025-02-05 17:35:19,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:19,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:19,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 17:35:19,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 17:35:19,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:19,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:19,887 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:35:19,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:19,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15156076] [2025-02-05 17:35:19,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15156076] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:19,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:19,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:35:19,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832623425] [2025-02-05 17:35:19,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:19,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:35:19,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:19,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:35:19,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:35:19,889 INFO L87 Difference]: Start difference. First operand 834 states and 1552 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 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:35:19,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:19,918 INFO L93 Difference]: Finished difference Result 939 states and 1715 transitions. [2025-02-05 17:35:19,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:35:19,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2025-02-05 17:35:19,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:19,922 INFO L225 Difference]: With dead ends: 939 [2025-02-05 17:35:19,922 INFO L226 Difference]: Without dead ends: 881 [2025-02-05 17:35:19,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:35:19,925 INFO L435 NwaCegarLoop]: 1506 mSDtfsCounter, 1466 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:19,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 1548 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:19,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-02-05 17:35:19,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 879. [2025-02-05 17:35:19,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 877 states have (on average 1.847206385404789) internal successors, (1620), 878 states have internal predecessors, (1620), 0 states have call successors, (0), 0 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:35:19,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1620 transitions. [2025-02-05 17:35:19,946 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1620 transitions. Word has length 37 [2025-02-05 17:35:19,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:19,946 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1620 transitions. [2025-02-05 17:35:19,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 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:35:19,947 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1620 transitions. [2025-02-05 17:35:19,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 17:35:19,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:19,948 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] [2025-02-05 17:35:19,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:35:19,949 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:19,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:19,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1319483520, now seen corresponding path program 1 times [2025-02-05 17:35:19,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:19,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819325344] [2025-02-05 17:35:19,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:19,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:19,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 17:35:19,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 17:35:19,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:19,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:20,092 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:35:20,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:20,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819325344] [2025-02-05 17:35:20,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819325344] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:20,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:20,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:35:20,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18871456] [2025-02-05 17:35:20,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:20,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:35:20,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:20,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:35:20,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:35:20,094 INFO L87 Difference]: Start difference. First operand 879 states and 1620 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 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:35:20,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:20,157 INFO L93 Difference]: Finished difference Result 984 states and 1780 transitions. [2025-02-05 17:35:20,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:35:20,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2025-02-05 17:35:20,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:20,161 INFO L225 Difference]: With dead ends: 984 [2025-02-05 17:35:20,161 INFO L226 Difference]: Without dead ends: 881 [2025-02-05 17:35:20,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:35:20,162 INFO L435 NwaCegarLoop]: 1503 mSDtfsCounter, 2946 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2946 SdHoareTripleChecker+Valid, 1589 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:20,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2946 Valid, 1589 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:20,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-02-05 17:35:20,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 879. [2025-02-05 17:35:20,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 877 states have (on average 1.8449258836944127) internal successors, (1618), 878 states have internal predecessors, (1618), 0 states have call successors, (0), 0 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:35:20,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1618 transitions. [2025-02-05 17:35:20,180 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1618 transitions. Word has length 37 [2025-02-05 17:35:20,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:20,180 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1618 transitions. [2025-02-05 17:35:20,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 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:35:20,181 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1618 transitions. [2025-02-05 17:35:20,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-05 17:35:20,182 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:20,182 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] [2025-02-05 17:35:20,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:35:20,182 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:20,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:20,182 INFO L85 PathProgramCache]: Analyzing trace with hash 2076221574, now seen corresponding path program 1 times [2025-02-05 17:35:20,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:20,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803912017] [2025-02-05 17:35:20,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:20,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:20,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 17:35:20,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 17:35:20,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:20,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:20,364 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:35:20,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:20,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803912017] [2025-02-05 17:35:20,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803912017] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:20,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:20,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:35:20,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255467985] [2025-02-05 17:35:20,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:20,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:35:20,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:20,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:35:20,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:35:20,366 INFO L87 Difference]: Start difference. First operand 879 states and 1618 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 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:35:20,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:20,423 INFO L93 Difference]: Finished difference Result 887 states and 1627 transitions. [2025-02-05 17:35:20,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 17:35:20,424 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2025-02-05 17:35:20,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:20,427 INFO L225 Difference]: With dead ends: 887 [2025-02-05 17:35:20,427 INFO L226 Difference]: Without dead ends: 885 [2025-02-05 17:35:20,428 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:35:20,429 INFO L435 NwaCegarLoop]: 1502 mSDtfsCounter, 0 mSDsluCounter, 8999 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10501 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:35:20,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10501 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:20,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2025-02-05 17:35:20,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 885. [2025-02-05 17:35:20,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 883 states have (on average 1.838052095130238) internal successors, (1623), 884 states have internal predecessors, (1623), 0 states have call successors, (0), 0 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:35:20,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1623 transitions. [2025-02-05 17:35:20,446 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1623 transitions. Word has length 38 [2025-02-05 17:35:20,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:20,446 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1623 transitions. [2025-02-05 17:35:20,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 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:35:20,446 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1623 transitions. [2025-02-05 17:35:20,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 17:35:20,447 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:20,448 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] [2025-02-05 17:35:20,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:35:20,448 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:20,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:20,449 INFO L85 PathProgramCache]: Analyzing trace with hash -2103070882, now seen corresponding path program 1 times [2025-02-05 17:35:20,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:20,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058424947] [2025-02-05 17:35:20,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:20,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:20,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 17:35:20,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 17:35:20,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:20,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:20,482 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:35:20,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:20,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058424947] [2025-02-05 17:35:20,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058424947] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:20,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:20,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:35:20,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852389598] [2025-02-05 17:35:20,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:20,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:35:20,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:20,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:35:20,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:35:20,484 INFO L87 Difference]: Start difference. First operand 885 states and 1623 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:35:20,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:20,503 INFO L93 Difference]: Finished difference Result 1007 states and 1804 transitions. [2025-02-05 17:35:20,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:35:20,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2025-02-05 17:35:20,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:20,507 INFO L225 Difference]: With dead ends: 1007 [2025-02-05 17:35:20,507 INFO L226 Difference]: Without dead ends: 943 [2025-02-05 17:35:20,507 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:35:20,507 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 1476 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1588 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:35:20,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1588 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:20,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2025-02-05 17:35:20,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 941. [2025-02-05 17:35:20,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 939 states have (on average 1.8146964856230032) internal successors, (1704), 940 states have internal predecessors, (1704), 0 states have call successors, (0), 0 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:35:20,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1704 transitions. [2025-02-05 17:35:20,523 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1704 transitions. Word has length 39 [2025-02-05 17:35:20,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:20,523 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1704 transitions. [2025-02-05 17:35:20,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:35:20,524 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1704 transitions. [2025-02-05 17:35:20,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 17:35:20,524 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:20,524 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] [2025-02-05 17:35:20,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:35:20,524 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:20,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:20,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1687895010, now seen corresponding path program 1 times [2025-02-05 17:35:20,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:20,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724561439] [2025-02-05 17:35:20,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:20,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:20,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 17:35:20,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 17:35:20,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:20,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:20,573 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:35:20,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:20,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724561439] [2025-02-05 17:35:20,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724561439] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:20,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:20,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:35:20,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493534290] [2025-02-05 17:35:20,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:20,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:35:20,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:20,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:35:20,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:35:20,575 INFO L87 Difference]: Start difference. First operand 941 states and 1704 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:35:20,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:20,647 INFO L93 Difference]: Finished difference Result 1243 states and 2144 transitions. [2025-02-05 17:35:20,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:35:20,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2025-02-05 17:35:20,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:20,652 INFO L225 Difference]: With dead ends: 1243 [2025-02-05 17:35:20,652 INFO L226 Difference]: Without dead ends: 1080 [2025-02-05 17:35:20,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:35:20,653 INFO L435 NwaCegarLoop]: 1542 mSDtfsCounter, 1474 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1594 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:35:20,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1594 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:20,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2025-02-05 17:35:20,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 1078. [2025-02-05 17:35:20,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 1076 states have (on average 1.762081784386617) internal successors, (1896), 1077 states have internal predecessors, (1896), 0 states have call successors, (0), 0 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:35:20,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1896 transitions. [2025-02-05 17:35:20,677 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1896 transitions. Word has length 39 [2025-02-05 17:35:20,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:20,678 INFO L471 AbstractCegarLoop]: Abstraction has 1078 states and 1896 transitions. [2025-02-05 17:35:20,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:35:20,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1896 transitions. [2025-02-05 17:35:20,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 17:35:20,678 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:20,678 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] [2025-02-05 17:35:20,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:35:20,678 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:20,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:20,681 INFO L85 PathProgramCache]: Analyzing trace with hash 2120354014, now seen corresponding path program 1 times [2025-02-05 17:35:20,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:20,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65219876] [2025-02-05 17:35:20,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:20,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:20,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 17:35:20,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 17:35:20,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:20,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:20,726 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:35:20,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:20,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65219876] [2025-02-05 17:35:20,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65219876] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:20,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:20,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:35:20,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673579982] [2025-02-05 17:35:20,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:20,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:35:20,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:20,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:35:20,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:35:20,728 INFO L87 Difference]: Start difference. First operand 1078 states and 1896 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:35:20,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:20,752 INFO L93 Difference]: Finished difference Result 1630 states and 2678 transitions. [2025-02-05 17:35:20,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:35:20,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2025-02-05 17:35:20,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:20,757 INFO L225 Difference]: With dead ends: 1630 [2025-02-05 17:35:20,757 INFO L226 Difference]: Without dead ends: 1330 [2025-02-05 17:35:20,758 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:35:20,759 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 1472 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 1596 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:35:20,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 1596 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:20,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2025-02-05 17:35:20,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1328. [2025-02-05 17:35:20,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1326 states have (on average 1.6832579185520362) internal successors, (2232), 1327 states have internal predecessors, (2232), 0 states have call successors, (0), 0 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:35:20,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 2232 transitions. [2025-02-05 17:35:20,785 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 2232 transitions. Word has length 39 [2025-02-05 17:35:20,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:20,786 INFO L471 AbstractCegarLoop]: Abstraction has 1328 states and 2232 transitions. [2025-02-05 17:35:20,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:35:20,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 2232 transitions. [2025-02-05 17:35:20,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 17:35:20,786 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:20,786 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] [2025-02-05 17:35:20,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:35:20,787 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:20,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:20,788 INFO L85 PathProgramCache]: Analyzing trace with hash 2070105244, now seen corresponding path program 1 times [2025-02-05 17:35:20,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:20,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202108627] [2025-02-05 17:35:20,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:20,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:20,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 17:35:20,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 17:35:20,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:20,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:20,901 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:35:20,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:20,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202108627] [2025-02-05 17:35:20,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202108627] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:20,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:20,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:35:20,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997686729] [2025-02-05 17:35:20,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:20,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:35:20,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:20,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:35:20,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:35:20,902 INFO L87 Difference]: Start difference. First operand 1328 states and 2232 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 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:35:26,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:26,436 INFO L93 Difference]: Finished difference Result 3583 states and 6541 transitions. [2025-02-05 17:35:26,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:35:26,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2025-02-05 17:35:26,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:26,448 INFO L225 Difference]: With dead ends: 3583 [2025-02-05 17:35:26,448 INFO L226 Difference]: Without dead ends: 2830 [2025-02-05 17:35:26,453 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:35:26,453 INFO L435 NwaCegarLoop]: 744 mSDtfsCounter, 2355 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2355 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 6507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:26,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2355 Valid, 762 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2025-02-05 17:35:26,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2830 states. [2025-02-05 17:35:26,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2830 to 2830. [2025-02-05 17:35:26,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2830 states, 2828 states have (on average 1.5367751060820367) internal successors, (4346), 2829 states have internal predecessors, (4346), 0 states have call successors, (0), 0 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:35:26,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2830 states to 2830 states and 4346 transitions. [2025-02-05 17:35:26,542 INFO L78 Accepts]: Start accepts. Automaton has 2830 states and 4346 transitions. Word has length 48 [2025-02-05 17:35:26,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:26,543 INFO L471 AbstractCegarLoop]: Abstraction has 2830 states and 4346 transitions. [2025-02-05 17:35:26,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 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:35:26,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2830 states and 4346 transitions. [2025-02-05 17:35:26,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 17:35:26,543 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:26,544 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:26,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:35:26,544 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:26,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:26,544 INFO L85 PathProgramCache]: Analyzing trace with hash 900512759, now seen corresponding path program 1 times [2025-02-05 17:35:26,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:26,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627173976] [2025-02-05 17:35:26,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:26,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:26,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 17:35:26,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 17:35:26,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:26,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:26,633 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 17:35:26,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:26,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627173976] [2025-02-05 17:35:26,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627173976] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:26,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:26,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:35:26,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694496420] [2025-02-05 17:35:26,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:26,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:35:26,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:26,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:35:26,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:35:26,634 INFO L87 Difference]: Start difference. First operand 2830 states and 4346 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 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:35:26,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:26,711 INFO L93 Difference]: Finished difference Result 4462 states and 6622 transitions. [2025-02-05 17:35:26,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:35:26,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 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 54 [2025-02-05 17:35:26,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:26,724 INFO L225 Difference]: With dead ends: 4462 [2025-02-05 17:35:26,725 INFO L226 Difference]: Without dead ends: 4060 [2025-02-05 17:35:26,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:35:26,728 INFO L435 NwaCegarLoop]: 1548 mSDtfsCounter, 3039 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3039 SdHoareTripleChecker+Valid, 3160 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:26,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3039 Valid, 3160 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:26,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4060 states. [2025-02-05 17:35:26,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4060 to 3306. [2025-02-05 17:35:26,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3306 states, 3304 states have (on average 1.5139225181598064) internal successors, (5002), 3305 states have internal predecessors, (5002), 0 states have call successors, (0), 0 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:35:26,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3306 states to 3306 states and 5002 transitions. [2025-02-05 17:35:26,818 INFO L78 Accepts]: Start accepts. Automaton has 3306 states and 5002 transitions. Word has length 54 [2025-02-05 17:35:26,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:26,819 INFO L471 AbstractCegarLoop]: Abstraction has 3306 states and 5002 transitions. [2025-02-05 17:35:26,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 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:35:26,819 INFO L276 IsEmpty]: Start isEmpty. Operand 3306 states and 5002 transitions. [2025-02-05 17:35:26,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 17:35:26,819 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:26,820 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:26,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:35:26,820 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:26,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:26,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1315688631, now seen corresponding path program 1 times [2025-02-05 17:35:26,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:26,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566395521] [2025-02-05 17:35:26,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:26,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:26,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 17:35:26,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 17:35:26,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:26,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:26,976 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 17:35:26,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:26,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566395521] [2025-02-05 17:35:26,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566395521] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:26,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:26,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:35:26,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739083033] [2025-02-05 17:35:26,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:26,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:35:26,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:26,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:35:26,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:35:26,978 INFO L87 Difference]: Start difference. First operand 3306 states and 5002 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 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:35:27,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:27,058 INFO L93 Difference]: Finished difference Result 5010 states and 7382 transitions. [2025-02-05 17:35:27,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:35:27,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 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 54 [2025-02-05 17:35:27,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:27,071 INFO L225 Difference]: With dead ends: 5010 [2025-02-05 17:35:27,071 INFO L226 Difference]: Without dead ends: 4460 [2025-02-05 17:35:27,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:35:27,073 INFO L435 NwaCegarLoop]: 1547 mSDtfsCounter, 3039 mSDsluCounter, 1610 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3039 SdHoareTripleChecker+Valid, 3157 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:27,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3039 Valid, 3157 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:27,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4460 states. [2025-02-05 17:35:27,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4460 to 4054. [2025-02-05 17:35:27,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4054 states, 4052 states have (on average 1.4881539980256664) internal successors, (6030), 4053 states have internal predecessors, (6030), 0 states have call successors, (0), 0 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:35:27,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4054 states to 4054 states and 6030 transitions. [2025-02-05 17:35:27,149 INFO L78 Accepts]: Start accepts. Automaton has 4054 states and 6030 transitions. Word has length 54 [2025-02-05 17:35:27,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:27,149 INFO L471 AbstractCegarLoop]: Abstraction has 4054 states and 6030 transitions. [2025-02-05 17:35:27,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 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:35:27,150 INFO L276 IsEmpty]: Start isEmpty. Operand 4054 states and 6030 transitions. [2025-02-05 17:35:27,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 17:35:27,152 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:27,152 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:27,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:35:27,153 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:27,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:27,153 INFO L85 PathProgramCache]: Analyzing trace with hash 828970359, now seen corresponding path program 1 times [2025-02-05 17:35:27,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:27,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106426465] [2025-02-05 17:35:27,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:27,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:27,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 17:35:27,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 17:35:27,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:27,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:27,235 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 17:35:27,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:27,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106426465] [2025-02-05 17:35:27,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106426465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:27,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:27,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:35:27,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150991775] [2025-02-05 17:35:27,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:27,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:35:27,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:27,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:35:27,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:35:27,237 INFO L87 Difference]: Start difference. First operand 4054 states and 6030 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 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:35:27,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:27,325 INFO L93 Difference]: Finished difference Result 5558 states and 8138 transitions. [2025-02-05 17:35:27,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:35:27,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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 54 [2025-02-05 17:35:27,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:27,343 INFO L225 Difference]: With dead ends: 5558 [2025-02-05 17:35:27,345 INFO L226 Difference]: Without dead ends: 5008 [2025-02-05 17:35:27,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:35:27,348 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 3045 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3045 SdHoareTripleChecker+Valid, 3158 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:27,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3045 Valid, 3158 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:27,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5008 states. [2025-02-05 17:35:27,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5008 to 4602. [2025-02-05 17:35:27,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4602 states, 4600 states have (on average 1.4752173913043478) internal successors, (6786), 4601 states have internal predecessors, (6786), 0 states have call successors, (0), 0 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:35:27,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4602 states to 4602 states and 6786 transitions. [2025-02-05 17:35:27,446 INFO L78 Accepts]: Start accepts. Automaton has 4602 states and 6786 transitions. Word has length 54 [2025-02-05 17:35:27,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:27,446 INFO L471 AbstractCegarLoop]: Abstraction has 4602 states and 6786 transitions. [2025-02-05 17:35:27,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 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:35:27,446 INFO L276 IsEmpty]: Start isEmpty. Operand 4602 states and 6786 transitions. [2025-02-05 17:35:27,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-05 17:35:27,447 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:27,447 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:27,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:35:27,448 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:27,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:27,450 INFO L85 PathProgramCache]: Analyzing trace with hash -357767785, now seen corresponding path program 1 times [2025-02-05 17:35:27,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:27,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529080510] [2025-02-05 17:35:27,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:27,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:27,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-05 17:35:27,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-05 17:35:27,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:27,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:27,513 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:27,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:27,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529080510] [2025-02-05 17:35:27,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529080510] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:27,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:27,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:35:27,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062949077] [2025-02-05 17:35:27,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:27,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:35:27,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:27,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:35:27,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:35:27,515 INFO L87 Difference]: Start difference. First operand 4602 states and 6786 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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:35:27,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:27,581 INFO L93 Difference]: Finished difference Result 6926 states and 9996 transitions. [2025-02-05 17:35:27,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:35:27,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-02-05 17:35:27,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:27,590 INFO L225 Difference]: With dead ends: 6926 [2025-02-05 17:35:27,590 INFO L226 Difference]: Without dead ends: 4604 [2025-02-05 17:35:27,593 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:35:27,594 INFO L435 NwaCegarLoop]: 1526 mSDtfsCounter, 29 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3022 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:27,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3022 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:27,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4604 states. [2025-02-05 17:35:27,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4604 to 4602. [2025-02-05 17:35:27,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4602 states, 4600 states have (on average 1.4643478260869565) internal successors, (6736), 4601 states have internal predecessors, (6736), 0 states have call successors, (0), 0 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:35:27,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4602 states to 4602 states and 6736 transitions. [2025-02-05 17:35:27,691 INFO L78 Accepts]: Start accepts. Automaton has 4602 states and 6736 transitions. Word has length 55 [2025-02-05 17:35:27,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:27,691 INFO L471 AbstractCegarLoop]: Abstraction has 4602 states and 6736 transitions. [2025-02-05 17:35:27,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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:35:27,692 INFO L276 IsEmpty]: Start isEmpty. Operand 4602 states and 6736 transitions. [2025-02-05 17:35:27,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 17:35:27,693 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:27,694 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:27,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:35:27,694 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:27,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:27,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1485901451, now seen corresponding path program 1 times [2025-02-05 17:35:27,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:27,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726737874] [2025-02-05 17:35:27,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:27,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:27,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 17:35:27,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 17:35:27,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:27,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:27,758 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:27,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:27,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726737874] [2025-02-05 17:35:27,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726737874] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:27,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:27,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:35:27,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570097449] [2025-02-05 17:35:27,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:27,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:35:27,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:27,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:35:27,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:35:27,760 INFO L87 Difference]: Start difference. First operand 4602 states and 6736 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 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:35:27,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:27,790 INFO L93 Difference]: Finished difference Result 5521 states and 7996 transitions. [2025-02-05 17:35:27,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:35:27,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-02-05 17:35:27,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:27,800 INFO L225 Difference]: With dead ends: 5521 [2025-02-05 17:35:27,800 INFO L226 Difference]: Without dead ends: 3199 [2025-02-05 17:35:27,803 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:35:27,804 INFO L435 NwaCegarLoop]: 1524 mSDtfsCounter, 23 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3019 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:27,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3019 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:27,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3199 states. [2025-02-05 17:35:27,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3199 to 3191. [2025-02-05 17:35:27,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3191 states, 3189 states have (on average 1.508623392913139) internal successors, (4811), 3190 states have internal predecessors, (4811), 0 states have call successors, (0), 0 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:35:27,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3191 states to 3191 states and 4811 transitions. [2025-02-05 17:35:27,851 INFO L78 Accepts]: Start accepts. Automaton has 3191 states and 4811 transitions. Word has length 56 [2025-02-05 17:35:27,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:27,852 INFO L471 AbstractCegarLoop]: Abstraction has 3191 states and 4811 transitions. [2025-02-05 17:35:27,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 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:35:27,852 INFO L276 IsEmpty]: Start isEmpty. Operand 3191 states and 4811 transitions. [2025-02-05 17:35:27,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 17:35:27,853 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:27,853 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:27,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:35:27,853 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:27,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:27,854 INFO L85 PathProgramCache]: Analyzing trace with hash 505748734, now seen corresponding path program 1 times [2025-02-05 17:35:27,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:27,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121562445] [2025-02-05 17:35:27,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:27,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:27,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 17:35:27,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 17:35:27,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:27,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:27,938 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:27,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:27,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121562445] [2025-02-05 17:35:27,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121562445] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:27,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:27,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:35:27,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475471206] [2025-02-05 17:35:27,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:27,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:35:27,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:27,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:35:27,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:35:27,942 INFO L87 Difference]: Start difference. First operand 3191 states and 4811 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 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:35:27,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:27,963 INFO L93 Difference]: Finished difference Result 3645 states and 5425 transitions. [2025-02-05 17:35:27,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:35:27,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-02-05 17:35:27,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:27,968 INFO L225 Difference]: With dead ends: 3645 [2025-02-05 17:35:27,968 INFO L226 Difference]: Without dead ends: 2743 [2025-02-05 17:35:27,970 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:35:27,970 INFO L435 NwaCegarLoop]: 1518 mSDtfsCounter, 25 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2998 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:27,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2998 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:27,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2743 states. [2025-02-05 17:35:27,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2743 to 2741. [2025-02-05 17:35:28,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2741 states, 2739 states have (on average 1.529755385177072) internal successors, (4190), 2740 states have internal predecessors, (4190), 0 states have call successors, (0), 0 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:35:28,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2741 states to 2741 states and 4190 transitions. [2025-02-05 17:35:28,004 INFO L78 Accepts]: Start accepts. Automaton has 2741 states and 4190 transitions. Word has length 57 [2025-02-05 17:35:28,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:28,005 INFO L471 AbstractCegarLoop]: Abstraction has 2741 states and 4190 transitions. [2025-02-05 17:35:28,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 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:35:28,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2741 states and 4190 transitions. [2025-02-05 17:35:28,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 17:35:28,007 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:28,007 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:28,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 17:35:28,007 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:28,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:28,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1114797445, now seen corresponding path program 1 times [2025-02-05 17:35:28,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:28,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157988011] [2025-02-05 17:35:28,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:28,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:28,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 17:35:28,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 17:35:28,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:28,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:28,331 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:28,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:28,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157988011] [2025-02-05 17:35:28,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157988011] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:35:28,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431179701] [2025-02-05 17:35:28,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:28,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:35:28,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:35:28,337 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:35:28,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 17:35:28,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 17:35:28,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 17:35:28,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:28,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:28,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 17:35:28,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:35:28,845 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:28,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:35:29,598 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:29,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431179701] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:35:29,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:35:29,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-02-05 17:35:29,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926079502] [2025-02-05 17:35:29,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:35:29,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 17:35:29,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:29,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 17:35:29,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2025-02-05 17:35:29,600 INFO L87 Difference]: Start difference. First operand 2741 states and 4190 transitions. Second operand has 23 states, 23 states have (on average 5.608695652173913) internal successors, (129), 22 states have internal predecessors, (129), 0 states have call successors, (0), 0 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:35:29,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:29,963 INFO L93 Difference]: Finished difference Result 3647 states and 5399 transitions. [2025-02-05 17:35:29,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 17:35:29,964 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.608695652173913) internal successors, (129), 22 states have internal predecessors, (129), 0 states have call successors, (0), 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 59 [2025-02-05 17:35:29,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:29,968 INFO L225 Difference]: With dead ends: 3647 [2025-02-05 17:35:29,969 INFO L226 Difference]: Without dead ends: 3195 [2025-02-05 17:35:29,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=739, Unknown=0, NotChecked=0, Total=992 [2025-02-05 17:35:29,971 INFO L435 NwaCegarLoop]: 1487 mSDtfsCounter, 10489 mSDsluCounter, 4637 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10489 SdHoareTripleChecker+Valid, 6124 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:29,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10489 Valid, 6124 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:35:29,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3195 states. [2025-02-05 17:35:30,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3195 to 3191. [2025-02-05 17:35:30,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3191 states, 3189 states have (on average 1.500156788962057) internal successors, (4784), 3190 states have internal predecessors, (4784), 0 states have call successors, (0), 0 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:35:30,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3191 states to 3191 states and 4784 transitions. [2025-02-05 17:35:30,010 INFO L78 Accepts]: Start accepts. Automaton has 3191 states and 4784 transitions. Word has length 59 [2025-02-05 17:35:30,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:30,011 INFO L471 AbstractCegarLoop]: Abstraction has 3191 states and 4784 transitions. [2025-02-05 17:35:30,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.608695652173913) internal successors, (129), 22 states have internal predecessors, (129), 0 states have call successors, (0), 0 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:35:30,011 INFO L276 IsEmpty]: Start isEmpty. Operand 3191 states and 4784 transitions. [2025-02-05 17:35:30,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 17:35:30,012 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:30,012 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 17:35:30,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 17:35:30,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-05 17:35:30,213 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:30,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:30,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1812084498, now seen corresponding path program 1 times [2025-02-05 17:35:30,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:30,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585028759] [2025-02-05 17:35:30,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:30,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:30,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 17:35:30,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 17:35:30,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:30,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:30,502 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:30,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:30,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585028759] [2025-02-05 17:35:30,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585028759] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:35:30,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495268528] [2025-02-05 17:35:30,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:30,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:35:30,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:35:30,504 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:35:30,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 17:35:30,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 17:35:30,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 17:35:30,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:30,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:30,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 17:35:30,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:35:30,802 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:30,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:35:30,986 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:30,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495268528] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:35:30,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:35:30,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 19 [2025-02-05 17:35:30,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500884453] [2025-02-05 17:35:30,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:35:30,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 17:35:30,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:30,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 17:35:30,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-02-05 17:35:30,988 INFO L87 Difference]: Start difference. First operand 3191 states and 4784 transitions. Second operand has 19 states, 19 states have (on average 8.789473684210526) internal successors, (167), 19 states have internal predecessors, (167), 0 states have call successors, (0), 0 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:35:33,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:33,523 INFO L93 Difference]: Finished difference Result 9264 states and 12699 transitions. [2025-02-05 17:35:33,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-02-05 17:35:33,524 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.789473684210526) internal successors, (167), 19 states have internal predecessors, (167), 0 states have call successors, (0), 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 60 [2025-02-05 17:35:33,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:33,554 INFO L225 Difference]: With dead ends: 9264 [2025-02-05 17:35:33,554 INFO L226 Difference]: Without dead ends: 8260 [2025-02-05 17:35:33,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1554 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=916, Invalid=3914, Unknown=0, NotChecked=0, Total=4830 [2025-02-05 17:35:33,566 INFO L435 NwaCegarLoop]: 1543 mSDtfsCounter, 15524 mSDsluCounter, 8009 mSDsCounter, 0 mSdLazyCounter, 1664 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15524 SdHoareTripleChecker+Valid, 9552 SdHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:33,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15524 Valid, 9552 Invalid, 1705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1664 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 17:35:33,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8260 states. [2025-02-05 17:35:33,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8260 to 7686. [2025-02-05 17:35:33,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7686 states, 7684 states have (on average 1.353461738677772) internal successors, (10400), 7685 states have internal predecessors, (10400), 0 states have call successors, (0), 0 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:35:33,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7686 states to 7686 states and 10400 transitions. [2025-02-05 17:35:33,776 INFO L78 Accepts]: Start accepts. Automaton has 7686 states and 10400 transitions. Word has length 60 [2025-02-05 17:35:33,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:33,777 INFO L471 AbstractCegarLoop]: Abstraction has 7686 states and 10400 transitions. [2025-02-05 17:35:33,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.789473684210526) internal successors, (167), 19 states have internal predecessors, (167), 0 states have call successors, (0), 0 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:35:33,777 INFO L276 IsEmpty]: Start isEmpty. Operand 7686 states and 10400 transitions. [2025-02-05 17:35:33,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 17:35:33,778 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:33,778 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:33,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 17:35:33,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-05 17:35:33,979 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:33,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:33,981 INFO L85 PathProgramCache]: Analyzing trace with hash 420436844, now seen corresponding path program 1 times [2025-02-05 17:35:33,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:33,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434162321] [2025-02-05 17:35:33,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:33,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:33,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 17:35:34,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 17:35:34,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:34,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:34,495 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:34,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:34,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434162321] [2025-02-05 17:35:34,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434162321] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:35:34,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964352885] [2025-02-05 17:35:34,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:34,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:35:34,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:35:34,502 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:35:34,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 17:35:34,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 17:35:34,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 17:35:34,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:34,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:34,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-05 17:35:34,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:35:35,278 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:35,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:35:35,948 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:35,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964352885] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:35:35,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:35:35,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 29 [2025-02-05 17:35:35,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232506588] [2025-02-05 17:35:35,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:35:35,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-05 17:35:35,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:35,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-05 17:35:35,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2025-02-05 17:35:35,949 INFO L87 Difference]: Start difference. First operand 7686 states and 10400 transitions. Second operand has 29 states, 29 states have (on average 5.517241379310345) internal successors, (160), 29 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:36,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:36,880 INFO L93 Difference]: Finished difference Result 17729 states and 23179 transitions. [2025-02-05 17:35:36,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 17:35:36,880 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 5.517241379310345) internal successors, (160), 29 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-02-05 17:35:36,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:36,900 INFO L225 Difference]: With dead ends: 17729 [2025-02-05 17:35:36,900 INFO L226 Difference]: Without dead ends: 13132 [2025-02-05 17:35:36,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=421, Invalid=1385, Unknown=0, NotChecked=0, Total=1806 [2025-02-05 17:35:36,906 INFO L435 NwaCegarLoop]: 1493 mSDtfsCounter, 12128 mSDsluCounter, 6289 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12128 SdHoareTripleChecker+Valid, 7782 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:36,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12128 Valid, 7782 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:35:36,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13132 states. [2025-02-05 17:35:37,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13132 to 12944. [2025-02-05 17:35:37,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12944 states, 12942 states have (on average 1.2991809612115592) internal successors, (16814), 12943 states have internal predecessors, (16814), 0 states have call successors, (0), 0 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:35:37,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12944 states to 12944 states and 16814 transitions. [2025-02-05 17:35:37,192 INFO L78 Accepts]: Start accepts. Automaton has 12944 states and 16814 transitions. Word has length 60 [2025-02-05 17:35:37,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:37,193 INFO L471 AbstractCegarLoop]: Abstraction has 12944 states and 16814 transitions. [2025-02-05 17:35:37,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.517241379310345) internal successors, (160), 29 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:37,193 INFO L276 IsEmpty]: Start isEmpty. Operand 12944 states and 16814 transitions. [2025-02-05 17:35:37,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 17:35:37,194 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:37,194 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:37,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 17:35:37,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:35:37,396 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:37,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:37,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1045991069, now seen corresponding path program 1 times [2025-02-05 17:35:37,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:37,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311139292] [2025-02-05 17:35:37,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:37,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:37,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 17:35:37,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 17:35:37,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:37,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:39,040 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:39,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:39,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311139292] [2025-02-05 17:35:39,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311139292] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:35:39,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122757758] [2025-02-05 17:35:39,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:39,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:35:39,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:35:39,043 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:35:39,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 17:35:39,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 17:35:39,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 17:35:39,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:39,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:39,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-05 17:35:39,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:35:40,856 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:40,856 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:35:42,442 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:42,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122757758] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:35:42,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:35:42,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 50 [2025-02-05 17:35:42,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990688325] [2025-02-05 17:35:42,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:35:42,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-02-05 17:35:42,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:42,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-02-05 17:35:42,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=2232, Unknown=0, NotChecked=0, Total=2450 [2025-02-05 17:35:42,445 INFO L87 Difference]: Start difference. First operand 12944 states and 16814 transitions. Second operand has 50 states, 50 states have (on average 3.32) internal successors, (166), 50 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:36:22,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:36:22,186 INFO L93 Difference]: Finished difference Result 40006 states and 50598 transitions. [2025-02-05 17:36:22,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2025-02-05 17:36:22,188 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.32) internal successors, (166), 50 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-02-05 17:36:22,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:36:22,247 INFO L225 Difference]: With dead ends: 40006 [2025-02-05 17:36:22,247 INFO L226 Difference]: Without dead ends: 33042 [2025-02-05 17:36:22,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22267 ImplicationChecksByTransitivity, 37.5s TimeCoverageRelationStatistics Valid=10089, Invalid=48233, Unknown=0, NotChecked=0, Total=58322 [2025-02-05 17:36:22,264 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 21212 mSDsluCounter, 31880 mSDsCounter, 0 mSdLazyCounter, 3915 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21212 SdHoareTripleChecker+Valid, 33420 SdHoareTripleChecker+Invalid, 4090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 3915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:36:22,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21212 Valid, 33420 Invalid, 4090 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [175 Valid, 3915 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 17:36:22,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33042 states. [2025-02-05 17:36:22,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33042 to 14756. [2025-02-05 17:36:22,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14756 states, 14754 states have (on average 1.298563101531788) internal successors, (19159), 14755 states have internal predecessors, (19159), 0 states have call successors, (0), 0 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:36:22,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14756 states to 14756 states and 19159 transitions. [2025-02-05 17:36:22,914 INFO L78 Accepts]: Start accepts. Automaton has 14756 states and 19159 transitions. Word has length 61 [2025-02-05 17:36:22,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:36:22,914 INFO L471 AbstractCegarLoop]: Abstraction has 14756 states and 19159 transitions. [2025-02-05 17:36:22,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.32) internal successors, (166), 50 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:36:22,915 INFO L276 IsEmpty]: Start isEmpty. Operand 14756 states and 19159 transitions. [2025-02-05 17:36:22,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 17:36:22,915 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:36:22,915 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 17:36:22,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 17:36:23,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:36:23,117 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:36:23,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:36:23,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1435836916, now seen corresponding path program 1 times [2025-02-05 17:36:23,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:36:23,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314548495] [2025-02-05 17:36:23,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:36:23,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:36:23,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 17:36:23,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 17:36:23,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:36:23,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:36:23,891 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:36:23,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:36:23,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314548495] [2025-02-05 17:36:23,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314548495] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:36:23,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229794304] [2025-02-05 17:36:23,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:36:23,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:36:23,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:36:23,894 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:36:23,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 17:36:23,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 17:36:24,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 17:36:24,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:36:24,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:36:24,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-05 17:36:24,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:36:25,862 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:36:25,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:36:28,427 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:36:28,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229794304] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:36:28,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:36:28,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 22, 18] total 48 [2025-02-05 17:36:28,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716500580] [2025-02-05 17:36:28,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:36:28,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-05 17:36:28,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:36:28,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-05 17:36:28,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1984, Unknown=0, NotChecked=0, Total=2256 [2025-02-05 17:36:28,429 INFO L87 Difference]: Start difference. First operand 14756 states and 19159 transitions. Second operand has 48 states, 48 states have (on average 3.4583333333333335) internal successors, (166), 48 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:36:43,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:36:43,086 INFO L93 Difference]: Finished difference Result 27005 states and 34433 transitions. [2025-02-05 17:36:43,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2025-02-05 17:36:43,087 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 3.4583333333333335) internal successors, (166), 48 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-02-05 17:36:43,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:36:43,124 INFO L225 Difference]: With dead ends: 27005 [2025-02-05 17:36:43,124 INFO L226 Difference]: Without dead ends: 20561 [2025-02-05 17:36:43,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6753 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=4130, Invalid=17332, Unknown=0, NotChecked=0, Total=21462 [2025-02-05 17:36:43,133 INFO L435 NwaCegarLoop]: 1550 mSDtfsCounter, 31727 mSDsluCounter, 25131 mSDsCounter, 0 mSdLazyCounter, 2356 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31727 SdHoareTripleChecker+Valid, 26681 SdHoareTripleChecker+Invalid, 2500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 2356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:36:43,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31727 Valid, 26681 Invalid, 2500 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [144 Valid, 2356 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 17:36:43,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20561 states. [2025-02-05 17:36:43,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20561 to 12680. [2025-02-05 17:36:43,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12680 states, 12678 states have (on average 1.3017037387600567) internal successors, (16503), 12679 states have internal predecessors, (16503), 0 states have call successors, (0), 0 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:36:43,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12680 states to 12680 states and 16503 transitions. [2025-02-05 17:36:43,742 INFO L78 Accepts]: Start accepts. Automaton has 12680 states and 16503 transitions. Word has length 62 [2025-02-05 17:36:43,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:36:43,742 INFO L471 AbstractCegarLoop]: Abstraction has 12680 states and 16503 transitions. [2025-02-05 17:36:43,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 3.4583333333333335) internal successors, (166), 48 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:36:43,743 INFO L276 IsEmpty]: Start isEmpty. Operand 12680 states and 16503 transitions. [2025-02-05 17:36:43,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 17:36:43,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:36:43,745 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:36:43,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 17:36:43,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:36:43,949 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:36:43,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:36:43,950 INFO L85 PathProgramCache]: Analyzing trace with hash -777183809, now seen corresponding path program 1 times [2025-02-05 17:36:43,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:36:43,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309766339] [2025-02-05 17:36:43,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:36:43,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:36:43,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 17:36:43,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 17:36:43,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:36:43,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:36:44,837 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 25 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:36:44,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:36:44,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309766339] [2025-02-05 17:36:44,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309766339] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:36:44,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146211281] [2025-02-05 17:36:44,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:36:44,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:36:44,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:36:44,839 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:36:44,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 17:36:44,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 17:36:44,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 17:36:44,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:36:44,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:36:44,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 17:36:44,941 INFO L279 TraceCheckSpWp]: Computing forward predicates...