./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label02.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_label02.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 5f3e3e9ccc5a5069122f9a5e86045d7e13172c8034d09d1e159c68b2e816764e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:35:11,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:35:11,598 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:11,602 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:35:11,603 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:35:11,621 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:35:11,621 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:35:11,622 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:35:11,622 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:35:11,622 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:35:11,622 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:35:11,622 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:35:11,623 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:35:11,623 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:35:11,623 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:35:11,623 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:35:11,623 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:35:11,623 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:35:11,624 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:35:11,624 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:35:11,624 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:35:11,624 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:35:11,624 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:35:11,624 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:35:11,624 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:35:11,624 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:35:11,625 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:35:11,625 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:35:11,625 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:35:11,625 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:35:11,625 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:35:11,625 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:35:11,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:35:11,626 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:35:11,626 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:35:11,626 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:35:11,626 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:35:11,626 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:35:11,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:35:11,626 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:35:11,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:35:11,626 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:35:11,626 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:35:11,626 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 -> 5f3e3e9ccc5a5069122f9a5e86045d7e13172c8034d09d1e159c68b2e816764e [2025-02-05 17:35:11,935 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:35:11,947 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:35:11,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:35:11,951 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:35:11,952 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:35:11,953 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_label02.c [2025-02-05 17:35:13,206 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/23c1d5b35/b8bef42605d34d739f752b6a47bd63d9/FLAGfba5c3ca3 [2025-02-05 17:35:13,728 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:35:13,731 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c [2025-02-05 17:35:13,777 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/23c1d5b35/b8bef42605d34d739f752b6a47bd63d9/FLAGfba5c3ca3 [2025-02-05 17:35:13,810 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/23c1d5b35/b8bef42605d34d739f752b6a47bd63d9 [2025-02-05 17:35:13,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:35:13,814 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:35:13,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:35:13,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:35:13,822 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:35:13,824 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:35:13" (1/1) ... [2025-02-05 17:35:13,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b9564cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:13, skipping insertion in model container [2025-02-05 17:35:13,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:35:13" (1/1) ... [2025-02-05 17:35:13,938 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:35:14,342 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_label02.c[6524,6537] [2025-02-05 17:35:14,454 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_label02.c[13814,13827] [2025-02-05 17:35:15,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:35:15,055 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:35:15,077 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_label02.c[6524,6537] [2025-02-05 17:35:15,090 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_label02.c[13814,13827] [2025-02-05 17:35:15,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:35:15,351 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:35:15,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:15 WrapperNode [2025-02-05 17:35:15,352 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:35:15,353 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:35:15,354 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:35:15,354 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:35:15,358 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:15" (1/1) ... [2025-02-05 17:35:15,394 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:15" (1/1) ... [2025-02-05 17:35:15,647 INFO L138 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4975 [2025-02-05 17:35:15,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:35:15,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:35:15,649 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:35:15,649 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:35:15,655 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:15" (1/1) ... [2025-02-05 17:35:15,656 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:15" (1/1) ... [2025-02-05 17:35:15,739 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:15" (1/1) ... [2025-02-05 17:35:15,832 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:15,833 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:15" (1/1) ... [2025-02-05 17:35:15,833 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:15" (1/1) ... [2025-02-05 17:35:15,954 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:15" (1/1) ... [2025-02-05 17:35:15,968 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:15" (1/1) ... [2025-02-05 17:35:15,986 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:15" (1/1) ... [2025-02-05 17:35:16,003 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:15" (1/1) ... [2025-02-05 17:35:16,043 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:35:16,044 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:35:16,044 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:35:16,044 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:35:16,045 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:15" (1/1) ... [2025-02-05 17:35:16,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:35:16,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:35:16,075 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:16,078 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:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:35:16,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:35:16,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:35:16,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:35:16,176 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:35:16,178 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:35:20,035 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1986: havoc calculate_output_#t~ret29#1; [2025-02-05 17:35:20,036 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3465: havoc calculate_output2_#t~ret30#1; [2025-02-05 17:35:20,037 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4955: havoc calculate_output3_#t~ret31#1; [2025-02-05 17:35:20,205 INFO L? ?]: Removed 734 outVars from TransFormulas that were not future-live. [2025-02-05 17:35:20,205 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:35:20,224 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:35:20,224 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:35:20,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:35:20 BoogieIcfgContainer [2025-02-05 17:35:20,224 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:35:20,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:35:20,226 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:35:20,229 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:35:20,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:35:13" (1/3) ... [2025-02-05 17:35:20,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9911b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:35:20, skipping insertion in model container [2025-02-05 17:35:20,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:15" (2/3) ... [2025-02-05 17:35:20,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9911b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:35:20, skipping insertion in model container [2025-02-05 17:35:20,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:35:20" (3/3) ... [2025-02-05 17:35:20,231 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c [2025-02-05 17:35:20,240 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:35:20,245 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c that has 1 procedures, 871 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-05 17:35:20,314 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:35:20,323 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;@7a35fc97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:35:20,324 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:35:20,330 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:20,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 17:35:20,336 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:20,337 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:20,337 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:20,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:20,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1636970803, now seen corresponding path program 1 times [2025-02-05 17:35:20,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:20,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544300350] [2025-02-05 17:35:20,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:20,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:20,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 17:35:20,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 17:35:20,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:20,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:20,534 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,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:20,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544300350] [2025-02-05 17:35:20,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544300350] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:20,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:20,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 17:35:20,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511609456] [2025-02-05 17:35:20,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:20,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 17:35:20,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:20,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 17:35:20,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 17:35:20,578 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:20,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:20,672 INFO L93 Difference]: Finished difference Result 1719 states and 3267 transitions. [2025-02-05 17:35:20,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 17:35:20,673 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:20,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:20,694 INFO L225 Difference]: With dead ends: 1719 [2025-02-05 17:35:20,694 INFO L226 Difference]: Without dead ends: 806 [2025-02-05 17:35:20,702 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:20,707 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:20,708 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:20,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2025-02-05 17:35:20,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 806. [2025-02-05 17:35:20,779 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:20,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1524 transitions. [2025-02-05 17:35:20,795 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1524 transitions. Word has length 20 [2025-02-05 17:35:20,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:20,800 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1524 transitions. [2025-02-05 17:35:20,800 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:20,800 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1524 transitions. [2025-02-05 17:35:20,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 17:35:20,801 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:20,801 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:20,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:35:20,801 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:20,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:20,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1131412178, now seen corresponding path program 1 times [2025-02-05 17:35:20,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:20,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999181959] [2025-02-05 17:35:20,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:20,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:20,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 17:35:20,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 17:35:20,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:20,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:21,039 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:21,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:21,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999181959] [2025-02-05 17:35:21,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999181959] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:21,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:21,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:35:21,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973157958] [2025-02-05 17:35:21,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:21,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:35:21,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:21,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:35:21,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:35:21,044 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:21,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:21,152 INFO L93 Difference]: Finished difference Result 840 states and 1575 transitions. [2025-02-05 17:35:21,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:35:21,153 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:21,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:21,160 INFO L225 Difference]: With dead ends: 840 [2025-02-05 17:35:21,160 INFO L226 Difference]: Without dead ends: 806 [2025-02-05 17:35:21,164 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:21,164 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:21,165 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:21,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2025-02-05 17:35:21,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 806. [2025-02-05 17:35:21,192 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:21,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1508 transitions. [2025-02-05 17:35:21,198 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1508 transitions. Word has length 20 [2025-02-05 17:35:21,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:21,199 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1508 transitions. [2025-02-05 17:35:21,199 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:21,199 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1508 transitions. [2025-02-05 17:35:21,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-05 17:35:21,200 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:21,201 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:21,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:35:21,201 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:21,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:21,203 INFO L85 PathProgramCache]: Analyzing trace with hash 784018818, now seen corresponding path program 1 times [2025-02-05 17:35:21,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:21,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826270562] [2025-02-05 17:35:21,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:21,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:21,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-05 17:35:21,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 17:35:21,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:21,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:21,342 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:21,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:21,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826270562] [2025-02-05 17:35:21,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826270562] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:21,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:21,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:35:21,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451666645] [2025-02-05 17:35:21,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:21,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:35:21,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:21,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:35:21,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:35:21,345 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:21,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:21,487 INFO L93 Difference]: Finished difference Result 986 states and 1790 transitions. [2025-02-05 17:35:21,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:35:21,488 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:21,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:21,492 INFO L225 Difference]: With dead ends: 986 [2025-02-05 17:35:21,493 INFO L226 Difference]: Without dead ends: 956 [2025-02-05 17:35:21,493 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:21,494 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.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:21,494 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.0s Time] [2025-02-05 17:35:21,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2025-02-05 17:35:21,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 834. [2025-02-05 17:35:21,512 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:21,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1552 transitions. [2025-02-05 17:35:21,515 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1552 transitions. Word has length 35 [2025-02-05 17:35:21,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:21,515 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1552 transitions. [2025-02-05 17:35:21,515 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:21,515 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1552 transitions. [2025-02-05 17:35:21,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 17:35:21,516 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:21,516 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:21,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:35:21,516 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:21,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:21,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1351806755, now seen corresponding path program 1 times [2025-02-05 17:35:21,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:21,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192427300] [2025-02-05 17:35:21,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:21,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:21,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 17:35:21,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 17:35:21,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:21,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:21,607 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:21,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:21,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192427300] [2025-02-05 17:35:21,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192427300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:21,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:21,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:35:21,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445714792] [2025-02-05 17:35:21,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:21,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:35:21,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:21,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:35:21,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:35:21,610 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:21,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:21,636 INFO L93 Difference]: Finished difference Result 939 states and 1715 transitions. [2025-02-05 17:35:21,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:35:21,637 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:21,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:21,640 INFO L225 Difference]: With dead ends: 939 [2025-02-05 17:35:21,640 INFO L226 Difference]: Without dead ends: 881 [2025-02-05 17:35:21,640 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:21,641 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:21,643 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:21,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-02-05 17:35:21,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 879. [2025-02-05 17:35:21,659 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:21,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1620 transitions. [2025-02-05 17:35:21,662 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1620 transitions. Word has length 37 [2025-02-05 17:35:21,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:21,663 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1620 transitions. [2025-02-05 17:35:21,663 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:21,663 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1620 transitions. [2025-02-05 17:35:21,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 17:35:21,665 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:21,665 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:21,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:35:21,665 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:21,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:21,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1319483520, now seen corresponding path program 1 times [2025-02-05 17:35:21,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:21,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52061808] [2025-02-05 17:35:21,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:21,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:21,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 17:35:21,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 17:35:21,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:21,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:21,839 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:21,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:21,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52061808] [2025-02-05 17:35:21,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52061808] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:21,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:21,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:35:21,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238980397] [2025-02-05 17:35:21,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:21,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:35:21,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:21,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:35:21,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:35:21,842 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:21,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:21,899 INFO L93 Difference]: Finished difference Result 984 states and 1780 transitions. [2025-02-05 17:35:21,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:35:21,900 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:21,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:21,903 INFO L225 Difference]: With dead ends: 984 [2025-02-05 17:35:21,903 INFO L226 Difference]: Without dead ends: 881 [2025-02-05 17:35:21,904 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:21,905 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:21,905 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:21,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-02-05 17:35:21,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 879. [2025-02-05 17:35:21,921 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:21,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1618 transitions. [2025-02-05 17:35:21,924 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1618 transitions. Word has length 37 [2025-02-05 17:35:21,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:21,926 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1618 transitions. [2025-02-05 17:35:21,926 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:21,926 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1618 transitions. [2025-02-05 17:35:21,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-05 17:35:21,928 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:21,928 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:21,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:35:21,928 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:21,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:21,929 INFO L85 PathProgramCache]: Analyzing trace with hash 2076221574, now seen corresponding path program 1 times [2025-02-05 17:35:21,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:21,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169025353] [2025-02-05 17:35:21,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:21,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:21,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 17:35:21,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 17:35:21,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:21,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:22,120 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:22,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:22,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169025353] [2025-02-05 17:35:22,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169025353] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:22,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:22,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:35:22,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56720266] [2025-02-05 17:35:22,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:22,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:35:22,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:22,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:35:22,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:35:22,121 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:22,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:22,180 INFO L93 Difference]: Finished difference Result 887 states and 1627 transitions. [2025-02-05 17:35:22,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 17:35:22,180 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:22,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:22,184 INFO L225 Difference]: With dead ends: 887 [2025-02-05 17:35:22,184 INFO L226 Difference]: Without dead ends: 885 [2025-02-05 17:35:22,184 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:22,185 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:22,185 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:22,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2025-02-05 17:35:22,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 885. [2025-02-05 17:35:22,199 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:22,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1623 transitions. [2025-02-05 17:35:22,201 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1623 transitions. Word has length 38 [2025-02-05 17:35:22,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:22,202 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1623 transitions. [2025-02-05 17:35:22,202 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:22,203 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1623 transitions. [2025-02-05 17:35:22,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 17:35:22,203 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:22,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:22,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:35:22,204 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:22,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:22,204 INFO L85 PathProgramCache]: Analyzing trace with hash -2103070882, now seen corresponding path program 1 times [2025-02-05 17:35:22,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:22,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054093458] [2025-02-05 17:35:22,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:22,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:22,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 17:35:22,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 17:35:22,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:22,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:22,255 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:22,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:22,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054093458] [2025-02-05 17:35:22,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054093458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:22,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:22,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:35:22,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729826235] [2025-02-05 17:35:22,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:22,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:35:22,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:22,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:35:22,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:35:22,256 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:22,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:22,276 INFO L93 Difference]: Finished difference Result 1007 states and 1804 transitions. [2025-02-05 17:35:22,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:35:22,277 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:22,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:22,280 INFO L225 Difference]: With dead ends: 1007 [2025-02-05 17:35:22,280 INFO L226 Difference]: Without dead ends: 943 [2025-02-05 17:35:22,280 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:22,282 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:22,282 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:22,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2025-02-05 17:35:22,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 941. [2025-02-05 17:35:22,299 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:22,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1704 transitions. [2025-02-05 17:35:22,302 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1704 transitions. Word has length 39 [2025-02-05 17:35:22,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:22,302 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1704 transitions. [2025-02-05 17:35:22,303 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:22,303 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1704 transitions. [2025-02-05 17:35:22,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 17:35:22,304 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:22,305 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:22,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:35:22,305 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:22,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:22,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1687895010, now seen corresponding path program 1 times [2025-02-05 17:35:22,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:22,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857954008] [2025-02-05 17:35:22,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:22,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:22,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 17:35:22,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 17:35:22,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:22,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:22,346 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:22,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:22,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857954008] [2025-02-05 17:35:22,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857954008] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:22,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:22,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:35:22,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819171706] [2025-02-05 17:35:22,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:22,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:35:22,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:22,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:35:22,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:35:22,349 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:22,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:22,369 INFO L93 Difference]: Finished difference Result 1243 states and 2144 transitions. [2025-02-05 17:35:22,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:35:22,369 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:22,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:22,374 INFO L225 Difference]: With dead ends: 1243 [2025-02-05 17:35:22,374 INFO L226 Difference]: Without dead ends: 1080 [2025-02-05 17:35:22,374 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:22,375 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:22,375 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:22,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2025-02-05 17:35:22,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 1078. [2025-02-05 17:35:22,392 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:22,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1896 transitions. [2025-02-05 17:35:22,395 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1896 transitions. Word has length 39 [2025-02-05 17:35:22,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:22,397 INFO L471 AbstractCegarLoop]: Abstraction has 1078 states and 1896 transitions. [2025-02-05 17:35:22,397 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:22,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1896 transitions. [2025-02-05 17:35:22,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 17:35:22,398 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:22,398 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:22,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:35:22,398 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:22,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:22,399 INFO L85 PathProgramCache]: Analyzing trace with hash 2120354014, now seen corresponding path program 1 times [2025-02-05 17:35:22,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:22,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636041035] [2025-02-05 17:35:22,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:22,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:22,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 17:35:22,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 17:35:22,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:22,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:22,444 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:22,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:22,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636041035] [2025-02-05 17:35:22,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636041035] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:22,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:22,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:35:22,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292546397] [2025-02-05 17:35:22,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:22,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:35:22,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:22,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:35:22,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:35:22,445 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:22,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:22,469 INFO L93 Difference]: Finished difference Result 1630 states and 2678 transitions. [2025-02-05 17:35:22,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:35:22,469 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:22,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:22,474 INFO L225 Difference]: With dead ends: 1630 [2025-02-05 17:35:22,474 INFO L226 Difference]: Without dead ends: 1330 [2025-02-05 17:35:22,474 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:22,475 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:22,476 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:22,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2025-02-05 17:35:22,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1328. [2025-02-05 17:35:22,498 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:22,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 2232 transitions. [2025-02-05 17:35:22,503 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 2232 transitions. Word has length 39 [2025-02-05 17:35:22,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:22,503 INFO L471 AbstractCegarLoop]: Abstraction has 1328 states and 2232 transitions. [2025-02-05 17:35:22,503 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:22,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 2232 transitions. [2025-02-05 17:35:22,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 17:35:22,504 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:22,504 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:22,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:35:22,505 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:22,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:22,507 INFO L85 PathProgramCache]: Analyzing trace with hash 900512759, now seen corresponding path program 1 times [2025-02-05 17:35:22,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:22,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705884022] [2025-02-05 17:35:22,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:22,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:22,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 17:35:22,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 17:35:22,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:22,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:22,648 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:22,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:22,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705884022] [2025-02-05 17:35:22,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705884022] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:22,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:22,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:35:22,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965596554] [2025-02-05 17:35:22,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:22,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:35:22,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:22,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:35:22,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:35:22,650 INFO L87 Difference]: Start difference. First operand 1328 states and 2232 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:22,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:22,719 INFO L93 Difference]: Finished difference Result 2960 states and 4508 transitions. [2025-02-05 17:35:22,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:35:22,720 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:22,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:22,728 INFO L225 Difference]: With dead ends: 2960 [2025-02-05 17:35:22,728 INFO L226 Difference]: Without dead ends: 2558 [2025-02-05 17:35:22,729 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:22,729 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:22,729 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:22,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states. [2025-02-05 17:35:22,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 1804. [2025-02-05 17:35:22,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1802 states have (on average 1.602663706992231) internal successors, (2888), 1803 states have internal predecessors, (2888), 0 states have call successors, (0), 0 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:22,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2888 transitions. [2025-02-05 17:35:22,771 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2888 transitions. Word has length 54 [2025-02-05 17:35:22,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:22,771 INFO L471 AbstractCegarLoop]: Abstraction has 1804 states and 2888 transitions. [2025-02-05 17:35:22,771 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:22,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2888 transitions. [2025-02-05 17:35:22,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 17:35:22,772 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:22,772 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:22,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:35:22,773 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:22,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:22,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1315688631, now seen corresponding path program 1 times [2025-02-05 17:35:22,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:22,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418182119] [2025-02-05 17:35:22,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:22,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:22,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 17:35:22,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 17:35:22,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:22,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:22,880 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:22,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:22,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418182119] [2025-02-05 17:35:22,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418182119] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:22,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:22,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:35:22,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038865116] [2025-02-05 17:35:22,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:22,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:35:22,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:22,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:35:22,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:35:22,886 INFO L87 Difference]: Start difference. First operand 1804 states and 2888 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:22,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:22,957 INFO L93 Difference]: Finished difference Result 3508 states and 5268 transitions. [2025-02-05 17:35:22,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:35:22,957 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:22,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:22,965 INFO L225 Difference]: With dead ends: 3508 [2025-02-05 17:35:22,965 INFO L226 Difference]: Without dead ends: 2958 [2025-02-05 17:35:22,966 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:22,967 INFO L435 NwaCegarLoop]: 1547 mSDtfsCounter, 3041 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3041 SdHoareTripleChecker+Valid, 3147 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:22,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3041 Valid, 3147 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:22,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2025-02-05 17:35:23,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 2552. [2025-02-05 17:35:23,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2550 states have (on average 1.5356862745098039) internal successors, (3916), 2551 states have internal predecessors, (3916), 0 states have call successors, (0), 0 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:23,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 3916 transitions. [2025-02-05 17:35:23,019 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 3916 transitions. Word has length 54 [2025-02-05 17:35:23,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:23,020 INFO L471 AbstractCegarLoop]: Abstraction has 2552 states and 3916 transitions. [2025-02-05 17:35:23,020 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:23,020 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3916 transitions. [2025-02-05 17:35:23,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 17:35:23,021 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:23,021 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:23,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:35:23,021 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:23,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:23,021 INFO L85 PathProgramCache]: Analyzing trace with hash 828970359, now seen corresponding path program 1 times [2025-02-05 17:35:23,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:23,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44166980] [2025-02-05 17:35:23,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:23,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:23,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 17:35:23,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 17:35:23,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:23,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:23,191 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:23,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:23,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44166980] [2025-02-05 17:35:23,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44166980] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:23,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:23,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:35:23,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694523079] [2025-02-05 17:35:23,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:23,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:35:23,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:23,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:35:23,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:35:23,196 INFO L87 Difference]: Start difference. First operand 2552 states and 3916 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:23,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:23,336 INFO L93 Difference]: Finished difference Result 4056 states and 6024 transitions. [2025-02-05 17:35:23,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:35:23,341 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:23,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:23,359 INFO L225 Difference]: With dead ends: 4056 [2025-02-05 17:35:23,359 INFO L226 Difference]: Without dead ends: 3506 [2025-02-05 17:35:23,361 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:23,365 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 3047 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3047 SdHoareTripleChecker+Valid, 3153 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:23,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3047 Valid, 3153 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:35:23,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2025-02-05 17:35:23,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 3100. [2025-02-05 17:35:23,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3100 states, 3098 states have (on average 1.5080697224015494) internal successors, (4672), 3099 states have internal predecessors, (4672), 0 states have call successors, (0), 0 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:23,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 3100 states and 4672 transitions. [2025-02-05 17:35:23,506 INFO L78 Accepts]: Start accepts. Automaton has 3100 states and 4672 transitions. Word has length 54 [2025-02-05 17:35:23,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:23,506 INFO L471 AbstractCegarLoop]: Abstraction has 3100 states and 4672 transitions. [2025-02-05 17:35:23,506 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:23,506 INFO L276 IsEmpty]: Start isEmpty. Operand 3100 states and 4672 transitions. [2025-02-05 17:35:23,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-05 17:35:23,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:23,508 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:23,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:35:23,509 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:23,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:23,509 INFO L85 PathProgramCache]: Analyzing trace with hash -357767785, now seen corresponding path program 1 times [2025-02-05 17:35:23,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:23,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508015960] [2025-02-05 17:35:23,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:23,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:23,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-05 17:35:23,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-05 17:35:23,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:23,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:23,569 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:23,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:23,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508015960] [2025-02-05 17:35:23,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508015960] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:23,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:23,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:35:23,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839976962] [2025-02-05 17:35:23,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:23,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:35:23,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:23,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:35:23,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:35:23,571 INFO L87 Difference]: Start difference. First operand 3100 states and 4672 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:23,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:23,611 INFO L93 Difference]: Finished difference Result 5424 states and 7882 transitions. [2025-02-05 17:35:23,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:35:23,611 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:23,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:23,619 INFO L225 Difference]: With dead ends: 5424 [2025-02-05 17:35:23,619 INFO L226 Difference]: Without dead ends: 3102 [2025-02-05 17:35:23,621 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:23,622 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:23,622 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:23,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3102 states. [2025-02-05 17:35:23,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3102 to 3100. [2025-02-05 17:35:23,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3100 states, 3098 states have (on average 1.4919302775984506) internal successors, (4622), 3099 states have internal predecessors, (4622), 0 states have call successors, (0), 0 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:23,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 3100 states and 4622 transitions. [2025-02-05 17:35:23,675 INFO L78 Accepts]: Start accepts. Automaton has 3100 states and 4622 transitions. Word has length 55 [2025-02-05 17:35:23,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:23,675 INFO L471 AbstractCegarLoop]: Abstraction has 3100 states and 4622 transitions. [2025-02-05 17:35:23,675 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:23,675 INFO L276 IsEmpty]: Start isEmpty. Operand 3100 states and 4622 transitions. [2025-02-05 17:35:23,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 17:35:23,676 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:23,676 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:23,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:35:23,677 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:23,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:23,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1485901451, now seen corresponding path program 1 times [2025-02-05 17:35:23,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:23,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741326055] [2025-02-05 17:35:23,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:23,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:23,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 17:35:23,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 17:35:23,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:23,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:23,728 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:23,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:23,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741326055] [2025-02-05 17:35:23,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741326055] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:23,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:23,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:35:23,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242969316] [2025-02-05 17:35:23,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:23,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:35:23,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:23,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:35:23,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:35:23,730 INFO L87 Difference]: Start difference. First operand 3100 states and 4622 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:23,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:23,759 INFO L93 Difference]: Finished difference Result 4019 states and 5882 transitions. [2025-02-05 17:35:23,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:35:23,760 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:23,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:23,764 INFO L225 Difference]: With dead ends: 4019 [2025-02-05 17:35:23,764 INFO L226 Difference]: Without dead ends: 1697 [2025-02-05 17:35:23,766 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:23,766 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:23,767 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:23,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2025-02-05 17:35:23,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1689. [2025-02-05 17:35:23,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1689 states, 1687 states have (on average 1.5986959098992295) internal successors, (2697), 1688 states have internal predecessors, (2697), 0 states have call successors, (0), 0 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:23,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 2697 transitions. [2025-02-05 17:35:23,793 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 2697 transitions. Word has length 56 [2025-02-05 17:35:23,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:23,794 INFO L471 AbstractCegarLoop]: Abstraction has 1689 states and 2697 transitions. [2025-02-05 17:35:23,794 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:23,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2697 transitions. [2025-02-05 17:35:23,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 17:35:23,794 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:23,794 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:23,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:35:23,795 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:23,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:23,795 INFO L85 PathProgramCache]: Analyzing trace with hash 505748734, now seen corresponding path program 1 times [2025-02-05 17:35:23,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:23,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002892122] [2025-02-05 17:35:23,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:23,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:23,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 17:35:23,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 17:35:23,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:23,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:23,889 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:23,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:23,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002892122] [2025-02-05 17:35:23,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002892122] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:23,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:23,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:35:23,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842950175] [2025-02-05 17:35:23,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:23,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:35:23,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:23,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:35:23,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:35:23,890 INFO L87 Difference]: Start difference. First operand 1689 states and 2697 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:23,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:23,929 INFO L93 Difference]: Finished difference Result 2143 states and 3311 transitions. [2025-02-05 17:35:23,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:35:23,930 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:23,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:23,933 INFO L225 Difference]: With dead ends: 2143 [2025-02-05 17:35:23,933 INFO L226 Difference]: Without dead ends: 1241 [2025-02-05 17:35:23,938 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:23,938 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:23,938 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:23,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2025-02-05 17:35:23,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1239. [2025-02-05 17:35:23,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1237 states have (on average 1.6782538399353275) internal successors, (2076), 1238 states have internal predecessors, (2076), 0 states have call successors, (0), 0 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:23,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 2076 transitions. [2025-02-05 17:35:23,980 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 2076 transitions. Word has length 57 [2025-02-05 17:35:23,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:23,980 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 2076 transitions. [2025-02-05 17:35:23,980 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:23,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 2076 transitions. [2025-02-05 17:35:23,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 17:35:23,981 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:23,981 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:23,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:35:23,981 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:23,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:23,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1114797445, now seen corresponding path program 1 times [2025-02-05 17:35:23,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:23,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786434201] [2025-02-05 17:35:23,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:23,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:23,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 17:35:24,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 17:35:24,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:24,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:24,312 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:24,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:24,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786434201] [2025-02-05 17:35:24,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786434201] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:35:24,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931007556] [2025-02-05 17:35:24,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:24,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:35:24,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:35:24,315 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:24,318 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:24,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 17:35:24,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 17:35:24,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:24,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:24,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 17:35:24,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:35:24,741 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:24,742 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:35:25,347 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:25,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931007556] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:35:25,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:35:25,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-02-05 17:35:25,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997669106] [2025-02-05 17:35:25,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:35:25,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 17:35:25,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:25,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 17:35:25,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2025-02-05 17:35:25,349 INFO L87 Difference]: Start difference. First operand 1239 states and 2076 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:25,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:25,709 INFO L93 Difference]: Finished difference Result 2145 states and 3285 transitions. [2025-02-05 17:35:25,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 17:35:25,709 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:25,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:25,713 INFO L225 Difference]: With dead ends: 2145 [2025-02-05 17:35:25,714 INFO L226 Difference]: Without dead ends: 1693 [2025-02-05 17:35:25,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=739, Unknown=0, NotChecked=0, Total=992 [2025-02-05 17:35:25,715 INFO L435 NwaCegarLoop]: 1487 mSDtfsCounter, 10528 mSDsluCounter, 3258 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10528 SdHoareTripleChecker+Valid, 4745 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:25,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10528 Valid, 4745 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:35:25,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2025-02-05 17:35:25,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1689. [2025-02-05 17:35:25,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1689 states, 1687 states have (on average 1.5826911677534083) internal successors, (2670), 1688 states have internal predecessors, (2670), 0 states have call successors, (0), 0 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:25,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 2670 transitions. [2025-02-05 17:35:25,745 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 2670 transitions. Word has length 59 [2025-02-05 17:35:25,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:25,745 INFO L471 AbstractCegarLoop]: Abstraction has 1689 states and 2670 transitions. [2025-02-05 17:35:25,745 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:25,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2670 transitions. [2025-02-05 17:35:25,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 17:35:25,746 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:25,746 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:25,753 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:25,947 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,SelfDestructingSolverStorable15 [2025-02-05 17:35:25,947 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:25,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:25,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1812084498, now seen corresponding path program 1 times [2025-02-05 17:35:25,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:25,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589893067] [2025-02-05 17:35:25,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:25,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:25,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 17:35:25,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 17:35:25,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:25,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:26,307 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:26,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:26,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589893067] [2025-02-05 17:35:26,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589893067] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:35:26,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79582152] [2025-02-05 17:35:26,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:26,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:35:26,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:35:26,312 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:26,318 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:26,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 17:35:26,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 17:35:26,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:26,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:26,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 17:35:26,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:35:26,596 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:26,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:35:26,797 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:26,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79582152] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:35:26,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:35:26,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 19 [2025-02-05 17:35:26,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584691330] [2025-02-05 17:35:26,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:35:26,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 17:35:26,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:26,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 17:35:26,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-02-05 17:35:26,800 INFO L87 Difference]: Start difference. First operand 1689 states and 2670 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:29,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:29,017 INFO L93 Difference]: Finished difference Result 7762 states and 10585 transitions. [2025-02-05 17:35:29,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-02-05 17:35:29,018 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:29,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:29,030 INFO L225 Difference]: With dead ends: 7762 [2025-02-05 17:35:29,030 INFO L226 Difference]: Without dead ends: 6758 [2025-02-05 17:35:29,034 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:29,035 INFO L435 NwaCegarLoop]: 1543 mSDtfsCounter, 14220 mSDsluCounter, 8080 mSDsCounter, 0 mSdLazyCounter, 1800 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14220 SdHoareTripleChecker+Valid, 9623 SdHoareTripleChecker+Invalid, 1840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:29,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14220 Valid, 9623 Invalid, 1840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1800 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 17:35:29,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6758 states. [2025-02-05 17:35:29,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6758 to 6184. [2025-02-05 17:35:29,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6184 states, 6182 states have (on average 1.3403429310902621) internal successors, (8286), 6183 states have internal predecessors, (8286), 0 states have call successors, (0), 0 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,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6184 states to 6184 states and 8286 transitions. [2025-02-05 17:35:29,212 INFO L78 Accepts]: Start accepts. Automaton has 6184 states and 8286 transitions. Word has length 60 [2025-02-05 17:35:29,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:29,212 INFO L471 AbstractCegarLoop]: Abstraction has 6184 states and 8286 transitions. [2025-02-05 17:35:29,213 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:29,213 INFO L276 IsEmpty]: Start isEmpty. Operand 6184 states and 8286 transitions. [2025-02-05 17:35:29,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 17:35:29,213 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:29,213 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:29,220 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:29,418 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,SelfDestructingSolverStorable16 [2025-02-05 17:35:29,418 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:29,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:29,419 INFO L85 PathProgramCache]: Analyzing trace with hash 420436844, now seen corresponding path program 1 times [2025-02-05 17:35:29,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:29,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032813007] [2025-02-05 17:35:29,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:29,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:29,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 17:35:29,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 17:35:29,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:29,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:29,671 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:29,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:29,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032813007] [2025-02-05 17:35:29,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032813007] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:35:29,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078741753] [2025-02-05 17:35:29,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:29,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:35:29,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:35:29,675 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:29,676 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:29,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 17:35:29,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 17:35:29,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:29,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:29,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-05 17:35:29,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:35:30,155 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:30,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:35:30,813 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:30,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078741753] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:35:30,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:35:30,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 29 [2025-02-05 17:35:30,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304355149] [2025-02-05 17:35:30,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:35:30,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-05 17:35:30,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:30,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-05 17:35:30,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2025-02-05 17:35:30,814 INFO L87 Difference]: Start difference. First operand 6184 states and 8286 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:31,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:31,552 INFO L93 Difference]: Finished difference Result 16227 states and 21065 transitions. [2025-02-05 17:35:31,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 17:35:31,553 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:31,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:31,570 INFO L225 Difference]: With dead ends: 16227 [2025-02-05 17:35:31,570 INFO L226 Difference]: Without dead ends: 11630 [2025-02-05 17:35:31,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=421, Invalid=1385, Unknown=0, NotChecked=0, Total=1806 [2025-02-05 17:35:31,577 INFO L435 NwaCegarLoop]: 1493 mSDtfsCounter, 10412 mSDsluCounter, 6218 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10412 SdHoareTripleChecker+Valid, 7711 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:31,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10412 Valid, 7711 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:35:31,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11630 states. [2025-02-05 17:35:31,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11630 to 11442. [2025-02-05 17:35:31,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11442 states, 11440 states have (on average 1.284965034965035) internal successors, (14700), 11441 states have internal predecessors, (14700), 0 states have call successors, (0), 0 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:31,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11442 states to 11442 states and 14700 transitions. [2025-02-05 17:35:31,834 INFO L78 Accepts]: Start accepts. Automaton has 11442 states and 14700 transitions. Word has length 60 [2025-02-05 17:35:31,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:31,835 INFO L471 AbstractCegarLoop]: Abstraction has 11442 states and 14700 transitions. [2025-02-05 17:35:31,835 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:31,836 INFO L276 IsEmpty]: Start isEmpty. Operand 11442 states and 14700 transitions. [2025-02-05 17:35:31,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 17:35:31,837 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:31,837 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:31,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 17:35:32,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:35:32,038 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:32,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:32,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1045991069, now seen corresponding path program 1 times [2025-02-05 17:35:32,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:32,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861517307] [2025-02-05 17:35:32,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:32,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:32,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 17:35:32,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 17:35:32,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:32,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:33,630 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:33,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:33,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861517307] [2025-02-05 17:35:33,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861517307] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:35:33,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236840094] [2025-02-05 17:35:33,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:33,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:35:33,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:35:33,636 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:33,637 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:33,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 17:35:33,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 17:35:33,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:33,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:33,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-05 17:35:33,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:35:35,562 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:35,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:35:37,109 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:37,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236840094] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:35:37,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:35:37,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 50 [2025-02-05 17:35:37,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778041834] [2025-02-05 17:35:37,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:35:37,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-02-05 17:35:37,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:37,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-02-05 17:35:37,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=2232, Unknown=0, NotChecked=0, Total=2450 [2025-02-05 17:35:37,111 INFO L87 Difference]: Start difference. First operand 11442 states and 14700 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:17,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:36:17,453 INFO L93 Difference]: Finished difference Result 38504 states and 48484 transitions. [2025-02-05 17:36:17,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2025-02-05 17:36:17,453 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:17,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:36:17,497 INFO L225 Difference]: With dead ends: 38504 [2025-02-05 17:36:17,498 INFO L226 Difference]: Without dead ends: 31540 [2025-02-05 17:36:17,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22267 ImplicationChecksByTransitivity, 38.4s TimeCoverageRelationStatistics Valid=10089, Invalid=48233, Unknown=0, NotChecked=0, Total=58322 [2025-02-05 17:36:17,513 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 26121 mSDsluCounter, 21159 mSDsCounter, 0 mSdLazyCounter, 3178 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26121 SdHoareTripleChecker+Valid, 22699 SdHoareTripleChecker+Invalid, 3352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 3178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:36:17,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26121 Valid, 22699 Invalid, 3352 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [174 Valid, 3178 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 17:36:17,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31540 states. [2025-02-05 17:36:18,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31540 to 13254. [2025-02-05 17:36:18,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13254 states, 13252 states have (on average 1.286220947781467) internal successors, (17045), 13253 states have internal predecessors, (17045), 0 states have call successors, (0), 0 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:18,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13254 states to 13254 states and 17045 transitions. [2025-02-05 17:36:18,191 INFO L78 Accepts]: Start accepts. Automaton has 13254 states and 17045 transitions. Word has length 61 [2025-02-05 17:36:18,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:36:18,191 INFO L471 AbstractCegarLoop]: Abstraction has 13254 states and 17045 transitions. [2025-02-05 17:36:18,191 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:18,191 INFO L276 IsEmpty]: Start isEmpty. Operand 13254 states and 17045 transitions. [2025-02-05 17:36:18,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 17:36:18,192 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:36:18,192 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:18,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 17:36:18,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:36:18,398 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:36:18,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:36:18,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1435836916, now seen corresponding path program 1 times [2025-02-05 17:36:18,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:36:18,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989237055] [2025-02-05 17:36:18,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:36:18,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:36:18,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 17:36:18,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 17:36:18,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:36:18,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:36:19,018 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:19,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:36:19,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989237055] [2025-02-05 17:36:19,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989237055] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:36:19,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299112900] [2025-02-05 17:36:19,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:36:19,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:36:19,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:36:19,022 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:19,024 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:19,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 17:36:19,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 17:36:19,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:36:19,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:36:19,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-05 17:36:19,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:36:21,223 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:21,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:36:23,801 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:23,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299112900] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:36:23,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:36:23,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 22, 18] total 48 [2025-02-05 17:36:23,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219730589] [2025-02-05 17:36:23,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:36:23,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-05 17:36:23,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:36:23,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-05 17:36:23,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1984, Unknown=0, NotChecked=0, Total=2256 [2025-02-05 17:36:23,803 INFO L87 Difference]: Start difference. First operand 13254 states and 17045 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:38,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:36:38,817 INFO L93 Difference]: Finished difference Result 25503 states and 32319 transitions. [2025-02-05 17:36:38,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2025-02-05 17:36:38,817 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:38,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:36:38,836 INFO L225 Difference]: With dead ends: 25503 [2025-02-05 17:36:38,837 INFO L226 Difference]: Without dead ends: 19059 [2025-02-05 17:36:38,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6753 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=4130, Invalid=17332, Unknown=0, NotChecked=0, Total=21462 [2025-02-05 17:36:38,846 INFO L435 NwaCegarLoop]: 1550 mSDtfsCounter, 16715 mSDsluCounter, 29406 mSDsCounter, 0 mSdLazyCounter, 2281 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16715 SdHoareTripleChecker+Valid, 30956 SdHoareTripleChecker+Invalid, 2382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 2281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:36:38,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16715 Valid, 30956 Invalid, 2382 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [101 Valid, 2281 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 17:36:38,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19059 states. [2025-02-05 17:36:39,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19059 to 11178. [2025-02-05 17:36:39,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11178 states, 11176 states have (on average 1.2874910522548317) internal successors, (14389), 11177 states have internal predecessors, (14389), 0 states have call successors, (0), 0 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:39,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11178 states to 11178 states and 14389 transitions. [2025-02-05 17:36:39,502 INFO L78 Accepts]: Start accepts. Automaton has 11178 states and 14389 transitions. Word has length 62 [2025-02-05 17:36:39,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:36:39,502 INFO L471 AbstractCegarLoop]: Abstraction has 11178 states and 14389 transitions. [2025-02-05 17:36:39,502 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:39,502 INFO L276 IsEmpty]: Start isEmpty. Operand 11178 states and 14389 transitions. [2025-02-05 17:36:39,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 17:36:39,502 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:36:39,502 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:36:39,512 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:39,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:36:39,705 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:36:39,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:36:39,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1333758369, now seen corresponding path program 1 times [2025-02-05 17:36:39,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:36:39,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498024416] [2025-02-05 17:36:39,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:36:39,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:36:39,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 17:36:39,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 17:36:39,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:36:39,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:36:39,793 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:36:39,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:36:39,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498024416] [2025-02-05 17:36:39,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498024416] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:36:39,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:36:39,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:36:39,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894276064] [2025-02-05 17:36:39,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:36:39,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:36:39,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:36:39,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:36:39,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:36:39,794 INFO L87 Difference]: Start difference. First operand 11178 states and 14389 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 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:45,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:36:45,175 INFO L93 Difference]: Finished difference Result 13433 states and 18698 transitions. [2025-02-05 17:36:45,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:36:45,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-02-05 17:36:45,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:36:45,190 INFO L225 Difference]: With dead ends: 13433 [2025-02-05 17:36:45,190 INFO L226 Difference]: Without dead ends: 12680 [2025-02-05 17:36:45,195 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:36:45,196 INFO L435 NwaCegarLoop]: 762 mSDtfsCounter, 2331 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5154 mSolverCounterSat, 1245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2331 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 6399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1245 IncrementalHoareTripleChecker+Valid, 5154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:36:45,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2331 Valid, 780 Invalid, 6399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1245 Valid, 5154 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-02-05 17:36:45,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12680 states.