./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5.1.ufo.UNBOUNDED.pals+Problem12_label05.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.5.1.ufo.UNBOUNDED.pals+Problem12_label05.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 be75db290ec34096274e1fab73d19995a5f186f7a3d66814837a196a3b4a7979 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:40:29,095 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:40:29,163 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:40:29,170 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:40:29,170 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:40:29,192 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:40:29,193 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:40:29,193 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:40:29,194 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:40:29,194 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:40:29,194 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:40:29,195 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:40:29,195 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:40:29,196 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:40:29,196 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:40:29,196 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:40:29,196 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:40:29,196 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:40:29,196 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:40:29,196 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:40:29,196 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:40:29,196 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:40:29,196 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:40:29,196 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:40:29,196 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:40:29,196 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:40:29,196 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:40:29,196 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:40:29,197 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:40:29,197 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:40:29,197 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:40:29,197 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:40:29,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:40:29,197 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:40:29,197 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:40:29,197 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:40:29,197 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:40:29,197 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:40:29,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:40:29,197 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:40:29,197 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:40:29,197 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:40:29,198 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:40:29,198 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 -> be75db290ec34096274e1fab73d19995a5f186f7a3d66814837a196a3b4a7979 [2025-02-05 17:40:29,469 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:40:29,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:40:29,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:40:29,481 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:40:29,481 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:40:29,483 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5.1.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-02-05 17:40:30,769 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4d58afb2f/7a7aae057ec148e5886749e11cc15802/FLAG657bd7fc0 [2025-02-05 17:40:31,388 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:40:31,389 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.1.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-02-05 17:40:31,429 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4d58afb2f/7a7aae057ec148e5886749e11cc15802/FLAG657bd7fc0 [2025-02-05 17:40:31,451 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4d58afb2f/7a7aae057ec148e5886749e11cc15802 [2025-02-05 17:40:31,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:40:31,457 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:40:31,458 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:40:31,459 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:40:31,463 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:40:31,464 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:40:31" (1/1) ... [2025-02-05 17:40:31,464 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fd6818d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:40:31, skipping insertion in model container [2025-02-05 17:40:31,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:40:31" (1/1) ... [2025-02-05 17:40:31,568 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:40:31,912 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.5.1.ufo.UNBOUNDED.pals+Problem12_label05.c[11705,11718] [2025-02-05 17:40:31,987 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.5.1.ufo.UNBOUNDED.pals+Problem12_label05.c[18641,18654] [2025-02-05 17:40:32,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:40:32,517 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:40:32,553 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.5.1.ufo.UNBOUNDED.pals+Problem12_label05.c[11705,11718] [2025-02-05 17:40:32,564 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.5.1.ufo.UNBOUNDED.pals+Problem12_label05.c[18641,18654] [2025-02-05 17:40:32,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:40:32,916 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:40:32,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:40:32 WrapperNode [2025-02-05 17:40:32,918 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:40:32,919 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:40:32,919 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:40:32,920 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:40:32,925 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:40:32" (1/1) ... [2025-02-05 17:40:32,979 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:40:32" (1/1) ... [2025-02-05 17:40:33,285 INFO L138 Inliner]: procedures = 37, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5092 [2025-02-05 17:40:33,286 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:40:33,287 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:40:33,287 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:40:33,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:40:33,296 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:40:32" (1/1) ... [2025-02-05 17:40:33,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:40:32" (1/1) ... [2025-02-05 17:40:33,346 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:40:32" (1/1) ... [2025-02-05 17:40:33,582 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:40:33,583 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:40:32" (1/1) ... [2025-02-05 17:40:33,583 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:40:32" (1/1) ... [2025-02-05 17:40:33,745 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:40:32" (1/1) ... [2025-02-05 17:40:33,790 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:40:32" (1/1) ... [2025-02-05 17:40:33,810 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:40:32" (1/1) ... [2025-02-05 17:40:33,832 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:40:32" (1/1) ... [2025-02-05 17:40:33,900 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:40:33,902 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:40:33,902 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:40:33,902 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:40:33,903 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:40:32" (1/1) ... [2025-02-05 17:40:33,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:40:33,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:40:33,937 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:40:33,942 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:40:33,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:40:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:40:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:40:33,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:40:34,085 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:40:34,087 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:40:38,455 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2131: havoc calculate_output_#t~ret37#1; [2025-02-05 17:40:38,455 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3610: havoc calculate_output2_#t~ret38#1; [2025-02-05 17:40:38,455 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5100: havoc calculate_output3_#t~ret39#1; [2025-02-05 17:40:38,674 INFO L? ?]: Removed 744 outVars from TransFormulas that were not future-live. [2025-02-05 17:40:38,674 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:40:38,719 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:40:38,720 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:40:38,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:40:38 BoogieIcfgContainer [2025-02-05 17:40:38,720 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:40:38,725 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:40:38,725 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:40:38,729 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:40:38,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:40:31" (1/3) ... [2025-02-05 17:40:38,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a6a4b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:40:38, skipping insertion in model container [2025-02-05 17:40:38,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:40:32" (2/3) ... [2025-02-05 17:40:38,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a6a4b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:40:38, skipping insertion in model container [2025-02-05 17:40:38,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:40:38" (3/3) ... [2025-02-05 17:40:38,734 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-02-05 17:40:38,749 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:40:38,752 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals+Problem12_label05.c that has 1 procedures, 900 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-05 17:40:38,837 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:40:38,848 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;@36151de5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:40:38,848 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:40:38,855 INFO L276 IsEmpty]: Start isEmpty. Operand has 900 states, 897 states have (on average 1.9030100334448161) internal successors, (1707), 899 states have internal predecessors, (1707), 0 states have call successors, (0), 0 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:40:38,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 17:40:38,860 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:38,861 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] [2025-02-05 17:40:38,861 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:38,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:38,866 INFO L85 PathProgramCache]: Analyzing trace with hash -29917392, now seen corresponding path program 1 times [2025-02-05 17:40:38,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:38,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461149519] [2025-02-05 17:40:38,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:38,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:38,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 17:40:38,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 17:40:38,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:38,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:39,116 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:40:39,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:39,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461149519] [2025-02-05 17:40:39,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461149519] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:39,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:39,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 17:40:39,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267110922] [2025-02-05 17:40:39,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:39,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 17:40:39,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:39,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 17:40:39,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 17:40:39,141 INFO L87 Difference]: Start difference. First operand has 900 states, 897 states have (on average 1.9030100334448161) internal successors, (1707), 899 states have internal predecessors, (1707), 0 states have call successors, (0), 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 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 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:40:39,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:39,218 INFO L93 Difference]: Finished difference Result 1762 states and 3343 transitions. [2025-02-05 17:40:39,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 17:40:39,220 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-02-05 17:40:39,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:39,239 INFO L225 Difference]: With dead ends: 1762 [2025-02-05 17:40:39,239 INFO L226 Difference]: Without dead ends: 835 [2025-02-05 17:40:39,244 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:40:39,246 INFO L435 NwaCegarLoop]: 1641 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, 1641 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:40:39,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1641 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:40:39,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2025-02-05 17:40:39,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 835. [2025-02-05 17:40:39,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 833 states have (on average 1.893157262905162) internal successors, (1577), 834 states have internal predecessors, (1577), 0 states have call successors, (0), 0 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:40:39,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1577 transitions. [2025-02-05 17:40:39,321 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1577 transitions. Word has length 24 [2025-02-05 17:40:39,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:39,321 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 1577 transitions. [2025-02-05 17:40:39,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 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:40:39,322 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1577 transitions. [2025-02-05 17:40:39,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 17:40:39,324 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:39,324 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] [2025-02-05 17:40:39,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:40:39,325 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:39,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:39,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1026989745, now seen corresponding path program 1 times [2025-02-05 17:40:39,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:39,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326457207] [2025-02-05 17:40:39,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:39,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:39,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 17:40:39,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 17:40:39,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:39,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:39,592 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:40:39,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:39,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326457207] [2025-02-05 17:40:39,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326457207] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:39,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:39,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:40:39,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827131836] [2025-02-05 17:40:39,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:39,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:40:39,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:39,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:40:39,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:40:39,595 INFO L87 Difference]: Start difference. First operand 835 states and 1577 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 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:40:39,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:39,711 INFO L93 Difference]: Finished difference Result 883 states and 1651 transitions. [2025-02-05 17:40:39,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:40:39,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-02-05 17:40:39,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:39,716 INFO L225 Difference]: With dead ends: 883 [2025-02-05 17:40:39,716 INFO L226 Difference]: Without dead ends: 835 [2025-02-05 17:40:39,717 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:40:39,718 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 0 mSDsluCounter, 4689 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6264 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:39,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6264 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:40:39,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2025-02-05 17:40:39,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 835. [2025-02-05 17:40:39,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 833 states have (on average 1.8559423769507803) internal successors, (1546), 834 states have internal predecessors, (1546), 0 states have call successors, (0), 0 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:40:39,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1546 transitions. [2025-02-05 17:40:39,744 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1546 transitions. Word has length 24 [2025-02-05 17:40:39,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:39,745 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 1546 transitions. [2025-02-05 17:40:39,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 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:40:39,745 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1546 transitions. [2025-02-05 17:40:39,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 17:40:39,746 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:39,747 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] [2025-02-05 17:40:39,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:40:39,747 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:39,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:39,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1149039, now seen corresponding path program 1 times [2025-02-05 17:40:39,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:39,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062127672] [2025-02-05 17:40:39,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:39,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:39,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 17:40:39,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 17:40:39,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:39,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:40,016 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:40:40,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:40,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062127672] [2025-02-05 17:40:40,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062127672] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:40,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:40,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:40:40,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275819569] [2025-02-05 17:40:40,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:40,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:40:40,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:40,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:40:40,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:40:40,020 INFO L87 Difference]: Start difference. First operand 835 states and 1546 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 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:40:40,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:40,308 INFO L93 Difference]: Finished difference Result 1275 states and 2246 transitions. [2025-02-05 17:40:40,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 17:40:40,312 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 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:40:40,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:40,319 INFO L225 Difference]: With dead ends: 1275 [2025-02-05 17:40:40,319 INFO L226 Difference]: Without dead ends: 1231 [2025-02-05 17:40:40,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-02-05 17:40:40,322 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 7979 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7979 SdHoareTripleChecker+Valid, 2696 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:40,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7979 Valid, 2696 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:40:40,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2025-02-05 17:40:40,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 877. [2025-02-05 17:40:40,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 875 states have (on average 1.8434285714285714) internal successors, (1613), 876 states have internal predecessors, (1613), 0 states have call successors, (0), 0 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:40:40,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1613 transitions. [2025-02-05 17:40:40,354 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1613 transitions. Word has length 54 [2025-02-05 17:40:40,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:40,354 INFO L471 AbstractCegarLoop]: Abstraction has 877 states and 1613 transitions. [2025-02-05 17:40:40,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 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:40:40,355 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1613 transitions. [2025-02-05 17:40:40,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 17:40:40,359 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:40,360 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] [2025-02-05 17:40:40,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:40:40,360 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:40,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:40,361 INFO L85 PathProgramCache]: Analyzing trace with hash 16126764, now seen corresponding path program 1 times [2025-02-05 17:40:40,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:40,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213100444] [2025-02-05 17:40:40,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:40,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:40,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 17:40:40,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 17:40:40,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:40,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:40,495 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:40:40,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:40,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213100444] [2025-02-05 17:40:40,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213100444] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:40,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:40,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:40:40,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035132841] [2025-02-05 17:40:40,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:40,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:40:40,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:40,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:40:40,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:40,498 INFO L87 Difference]: Start difference. First operand 877 states and 1613 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:40:40,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:40,543 INFO L93 Difference]: Finished difference Result 1038 states and 1868 transitions. [2025-02-05 17:40:40,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:40:40,543 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:40:40,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:40,548 INFO L225 Difference]: With dead ends: 1038 [2025-02-05 17:40:40,548 INFO L226 Difference]: Without dead ends: 952 [2025-02-05 17:40:40,549 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:40:40,551 INFO L435 NwaCegarLoop]: 1542 mSDtfsCounter, 1484 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:40,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 1605 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:40:40,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2025-02-05 17:40:40,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 948. [2025-02-05 17:40:40,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 946 states have (on average 1.8213530655391121) internal successors, (1723), 947 states have internal predecessors, (1723), 0 states have call successors, (0), 0 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:40:40,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1723 transitions. [2025-02-05 17:40:40,587 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1723 transitions. Word has length 56 [2025-02-05 17:40:40,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:40,588 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1723 transitions. [2025-02-05 17:40:40,588 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:40:40,589 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1723 transitions. [2025-02-05 17:40:40,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 17:40:40,590 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:40,591 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] [2025-02-05 17:40:40,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:40:40,591 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:40,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:40,592 INFO L85 PathProgramCache]: Analyzing trace with hash 48449999, now seen corresponding path program 1 times [2025-02-05 17:40:40,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:40,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600485723] [2025-02-05 17:40:40,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:40,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:40,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 17:40:40,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 17:40:40,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:40,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:40,932 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:40:40,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:40,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600485723] [2025-02-05 17:40:40,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600485723] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:40,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:40,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:40:40,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483492233] [2025-02-05 17:40:40,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:40,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:40:40,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:40,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:40:40,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:40:40,934 INFO L87 Difference]: Start difference. First operand 948 states and 1723 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 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:40:41,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:41,140 INFO L93 Difference]: Finished difference Result 1107 states and 1971 transitions. [2025-02-05 17:40:41,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:40:41,141 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 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:40:41,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:41,147 INFO L225 Difference]: With dead ends: 1107 [2025-02-05 17:40:41,147 INFO L226 Difference]: Without dead ends: 950 [2025-02-05 17:40:41,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-02-05 17:40:41,150 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 5976 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5976 SdHoareTripleChecker+Valid, 1805 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:41,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5976 Valid, 1805 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:40:41,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2025-02-05 17:40:41,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 948. [2025-02-05 17:40:41,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 946 states have (on average 1.8192389006342495) internal successors, (1721), 947 states have internal predecessors, (1721), 0 states have call successors, (0), 0 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:40:41,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1721 transitions. [2025-02-05 17:40:41,176 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1721 transitions. Word has length 56 [2025-02-05 17:40:41,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:41,177 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1721 transitions. [2025-02-05 17:40:41,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 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:40:41,177 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1721 transitions. [2025-02-05 17:40:41,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 17:40:41,179 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:41,179 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] [2025-02-05 17:40:41,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:40:41,179 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:41,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:41,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1532487703, now seen corresponding path program 1 times [2025-02-05 17:40:41,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:41,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044788044] [2025-02-05 17:40:41,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:41,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:41,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 17:40:41,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 17:40:41,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:41,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:41,509 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:40:41,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:41,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044788044] [2025-02-05 17:40:41,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044788044] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:41,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:41,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:40:41,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505145245] [2025-02-05 17:40:41,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:41,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:40:41,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:41,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:40:41,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:40:41,514 INFO L87 Difference]: Start difference. First operand 948 states and 1721 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 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:40:41,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:41,588 INFO L93 Difference]: Finished difference Result 956 states and 1730 transitions. [2025-02-05 17:40:41,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 17:40:41,589 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 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:40:41,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:41,594 INFO L225 Difference]: With dead ends: 956 [2025-02-05 17:40:41,594 INFO L226 Difference]: Without dead ends: 954 [2025-02-05 17:40:41,595 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:40:41,596 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 0 mSDsluCounter, 9227 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10767 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:40:41,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10767 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:40:41,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2025-02-05 17:40:41,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 954. [2025-02-05 17:40:41,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 952 states have (on average 1.8130252100840336) internal successors, (1726), 953 states have internal predecessors, (1726), 0 states have call successors, (0), 0 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:40:41,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1726 transitions. [2025-02-05 17:40:41,621 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1726 transitions. Word has length 57 [2025-02-05 17:40:41,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:41,621 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1726 transitions. [2025-02-05 17:40:41,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 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:40:41,621 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1726 transitions. [2025-02-05 17:40:41,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 17:40:41,622 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:41,622 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] [2025-02-05 17:40:41,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:40:41,622 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:41,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:41,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1331006163, now seen corresponding path program 1 times [2025-02-05 17:40:41,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:41,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709866298] [2025-02-05 17:40:41,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:41,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:41,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 17:40:41,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 17:40:41,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:41,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:41,685 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:40:41,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:41,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709866298] [2025-02-05 17:40:41,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709866298] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:41,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:41,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:40:41,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979594245] [2025-02-05 17:40:41,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:41,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:40:41,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:41,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:40:41,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:41,687 INFO L87 Difference]: Start difference. First operand 954 states and 1726 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 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:40:41,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:41,715 INFO L93 Difference]: Finished difference Result 1264 states and 2198 transitions. [2025-02-05 17:40:41,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:40:41,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-02-05 17:40:41,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:41,720 INFO L225 Difference]: With dead ends: 1264 [2025-02-05 17:40:41,720 INFO L226 Difference]: Without dead ends: 1101 [2025-02-05 17:40:41,721 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:40:41,721 INFO L435 NwaCegarLoop]: 1593 mSDtfsCounter, 1497 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1497 SdHoareTripleChecker+Valid, 1668 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:40:41,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1497 Valid, 1668 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:40:41,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2025-02-05 17:40:41,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1099. [2025-02-05 17:40:41,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 1097 states have (on average 1.7711941659070192) internal successors, (1943), 1098 states have internal predecessors, (1943), 0 states have call successors, (0), 0 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:40:41,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1943 transitions. [2025-02-05 17:40:41,748 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1943 transitions. Word has length 58 [2025-02-05 17:40:41,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:41,749 INFO L471 AbstractCegarLoop]: Abstraction has 1099 states and 1943 transitions. [2025-02-05 17:40:41,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 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:40:41,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1943 transitions. [2025-02-05 17:40:41,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 17:40:41,751 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:41,751 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] [2025-02-05 17:40:41,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:40:41,751 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:41,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:41,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1778951699, now seen corresponding path program 1 times [2025-02-05 17:40:41,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:41,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481272277] [2025-02-05 17:40:41,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:41,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:41,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 17:40:41,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 17:40:41,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:41,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:41,815 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:40:41,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:41,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481272277] [2025-02-05 17:40:41,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481272277] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:41,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:41,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:40:41,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15184662] [2025-02-05 17:40:41,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:41,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:40:41,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:41,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:40:41,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:41,817 INFO L87 Difference]: Start difference. First operand 1099 states and 1943 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 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:40:41,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:41,847 INFO L93 Difference]: Finished difference Result 1683 states and 2821 transitions. [2025-02-05 17:40:41,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:40:41,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-02-05 17:40:41,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:41,853 INFO L225 Difference]: With dead ends: 1683 [2025-02-05 17:40:41,853 INFO L226 Difference]: Without dead ends: 1375 [2025-02-05 17:40:41,854 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:40:41,854 INFO L435 NwaCegarLoop]: 1591 mSDtfsCounter, 1495 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 1670 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:40:41,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 1670 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:40:41,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2025-02-05 17:40:41,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1373. [2025-02-05 17:40:41,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1373 states, 1371 states have (on average 1.7104303428154632) internal successors, (2345), 1372 states have internal predecessors, (2345), 0 states have call successors, (0), 0 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:40:41,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 2345 transitions. [2025-02-05 17:40:41,884 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 2345 transitions. Word has length 58 [2025-02-05 17:40:41,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:41,885 INFO L471 AbstractCegarLoop]: Abstraction has 1373 states and 2345 transitions. [2025-02-05 17:40:41,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 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:40:41,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 2345 transitions. [2025-02-05 17:40:41,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 17:40:41,885 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:41,885 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] [2025-02-05 17:40:41,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:40:41,886 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:41,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:41,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1363775827, now seen corresponding path program 1 times [2025-02-05 17:40:41,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:41,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709800192] [2025-02-05 17:40:41,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:41,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:41,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 17:40:41,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 17:40:41,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:41,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:41,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:41,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:41,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709800192] [2025-02-05 17:40:41,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709800192] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:41,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:41,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:40:41,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121263816] [2025-02-05 17:40:41,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:41,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:40:41,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:41,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:40:41,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:41,952 INFO L87 Difference]: Start difference. First operand 1373 states and 2345 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 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:40:41,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:41,988 INFO L93 Difference]: Finished difference Result 2473 states and 3971 transitions. [2025-02-05 17:40:41,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:40:41,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-02-05 17:40:41,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:41,997 INFO L225 Difference]: With dead ends: 2473 [2025-02-05 17:40:41,997 INFO L226 Difference]: Without dead ends: 1891 [2025-02-05 17:40:41,998 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:40:41,998 INFO L435 NwaCegarLoop]: 1589 mSDtfsCounter, 1493 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 1672 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:40:41,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1493 Valid, 1672 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:40:42,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2025-02-05 17:40:42,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1889. [2025-02-05 17:40:42,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1889 states, 1887 states have (on average 1.634870164281929) internal successors, (3085), 1888 states have internal predecessors, (3085), 0 states have call successors, (0), 0 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:40:42,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 3085 transitions. [2025-02-05 17:40:42,044 INFO L78 Accepts]: Start accepts. Automaton has 1889 states and 3085 transitions. Word has length 58 [2025-02-05 17:40:42,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:42,044 INFO L471 AbstractCegarLoop]: Abstraction has 1889 states and 3085 transitions. [2025-02-05 17:40:42,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 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:40:42,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 3085 transitions. [2025-02-05 17:40:42,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 17:40:42,045 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:42,045 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] [2025-02-05 17:40:42,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:40:42,045 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:42,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:42,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1850494099, now seen corresponding path program 1 times [2025-02-05 17:40:42,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:42,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073009211] [2025-02-05 17:40:42,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:42,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:42,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 17:40:42,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 17:40:42,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:42,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:42,097 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:40:42,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:42,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073009211] [2025-02-05 17:40:42,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073009211] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:42,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:42,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:40:42,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442833116] [2025-02-05 17:40:42,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:42,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:40:42,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:42,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:40:42,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:42,098 INFO L87 Difference]: Start difference. First operand 1889 states and 3085 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 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:40:42,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:42,148 INFO L93 Difference]: Finished difference Result 3957 states and 6079 transitions. [2025-02-05 17:40:42,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:40:42,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-02-05 17:40:42,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:42,160 INFO L225 Difference]: With dead ends: 3957 [2025-02-05 17:40:42,161 INFO L226 Difference]: Without dead ends: 2859 [2025-02-05 17:40:42,163 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:40:42,163 INFO L435 NwaCegarLoop]: 1587 mSDtfsCounter, 1491 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1491 SdHoareTripleChecker+Valid, 1674 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:40:42,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1491 Valid, 1674 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:40:42,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2025-02-05 17:40:42,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 2857. [2025-02-05 17:40:42,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2857 states, 2855 states have (on average 1.5541155866900176) internal successors, (4437), 2856 states have internal predecessors, (4437), 0 states have call successors, (0), 0 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:40:42,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2857 states to 2857 states and 4437 transitions. [2025-02-05 17:40:42,234 INFO L78 Accepts]: Start accepts. Automaton has 2857 states and 4437 transitions. Word has length 58 [2025-02-05 17:40:42,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:42,234 INFO L471 AbstractCegarLoop]: Abstraction has 2857 states and 4437 transitions. [2025-02-05 17:40:42,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 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:40:42,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 4437 transitions. [2025-02-05 17:40:42,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 17:40:42,235 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:42,235 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] [2025-02-05 17:40:42,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:40:42,235 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:42,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:42,236 INFO L85 PathProgramCache]: Analyzing trace with hash 291030893, now seen corresponding path program 1 times [2025-02-05 17:40:42,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:42,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488865577] [2025-02-05 17:40:42,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:42,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:42,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 17:40:42,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 17:40:42,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:42,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:42,289 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:40:42,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:42,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488865577] [2025-02-05 17:40:42,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488865577] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:42,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:42,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:40:42,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730850735] [2025-02-05 17:40:42,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:42,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:40:42,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:42,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:40:42,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:42,291 INFO L87 Difference]: Start difference. First operand 2857 states and 4437 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 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:40:42,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:42,352 INFO L93 Difference]: Finished difference Result 5040 states and 7611 transitions. [2025-02-05 17:40:42,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:40:42,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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:40:42,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:42,369 INFO L225 Difference]: With dead ends: 5040 [2025-02-05 17:40:42,369 INFO L226 Difference]: Without dead ends: 3853 [2025-02-05 17:40:42,371 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:40:42,372 INFO L435 NwaCegarLoop]: 1598 mSDtfsCounter, 1496 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 1669 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:40:42,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 1669 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:40:42,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3853 states. [2025-02-05 17:40:42,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3853 to 3851. [2025-02-05 17:40:42,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3851 states, 3849 states have (on average 1.5149389451805664) internal successors, (5831), 3850 states have internal predecessors, (5831), 0 states have call successors, (0), 0 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:40:42,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3851 states to 3851 states and 5831 transitions. [2025-02-05 17:40:42,475 INFO L78 Accepts]: Start accepts. Automaton has 3851 states and 5831 transitions. Word has length 60 [2025-02-05 17:40:42,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:42,475 INFO L471 AbstractCegarLoop]: Abstraction has 3851 states and 5831 transitions. [2025-02-05 17:40:42,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 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:40:42,475 INFO L276 IsEmpty]: Start isEmpty. Operand 3851 states and 5831 transitions. [2025-02-05 17:40:42,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 17:40:42,480 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:42,481 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] [2025-02-05 17:40:42,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:40:42,481 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:42,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:42,481 INFO L85 PathProgramCache]: Analyzing trace with hash 945089098, now seen corresponding path program 1 times [2025-02-05 17:40:42,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:42,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049233913] [2025-02-05 17:40:42,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:42,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:42,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 17:40:42,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 17:40:42,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:42,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:42,655 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:40:42,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:42,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049233913] [2025-02-05 17:40:42,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049233913] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:42,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:42,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:40:42,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874270377] [2025-02-05 17:40:42,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:42,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:40:42,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:42,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:40:42,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:40:42,657 INFO L87 Difference]: Start difference. First operand 3851 states and 5831 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 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:40:48,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:48,373 INFO L93 Difference]: Finished difference Result 6106 states and 10140 transitions. [2025-02-05 17:40:48,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:40:48,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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:40:48,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:48,389 INFO L225 Difference]: With dead ends: 6106 [2025-02-05 17:40:48,389 INFO L226 Difference]: Without dead ends: 5353 [2025-02-05 17:40:48,391 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:40:48,391 INFO L435 NwaCegarLoop]: 800 mSDtfsCounter, 2395 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5518 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2395 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 6618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 5518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:48,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2395 Valid, 818 Invalid, 6618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 5518 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2025-02-05 17:40:48,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5353 states. [2025-02-05 17:40:48,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5353 to 5353. [2025-02-05 17:40:48,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5353 states, 5351 states have (on average 1.4870117735002804) internal successors, (7957), 5352 states have internal predecessors, (7957), 0 states have call successors, (0), 0 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:40:48,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5353 states to 5353 states and 7957 transitions. [2025-02-05 17:40:48,553 INFO L78 Accepts]: Start accepts. Automaton has 5353 states and 7957 transitions. Word has length 60 [2025-02-05 17:40:48,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:48,553 INFO L471 AbstractCegarLoop]: Abstraction has 5353 states and 7957 transitions. [2025-02-05 17:40:48,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 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:40:48,553 INFO L276 IsEmpty]: Start isEmpty. Operand 5353 states and 7957 transitions. [2025-02-05 17:40:48,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 17:40:48,555 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:48,556 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:40:48,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:40:48,556 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:48,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:48,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1155468229, now seen corresponding path program 1 times [2025-02-05 17:40:48,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:48,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357683932] [2025-02-05 17:40:48,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:48,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:48,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 17:40:48,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 17:40:48,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:48,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:48,704 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 17:40:48,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:48,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357683932] [2025-02-05 17:40:48,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357683932] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:48,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:48,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:40:48,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839109981] [2025-02-05 17:40:48,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:48,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:40:48,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:48,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:40:48,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:40:48,706 INFO L87 Difference]: Start difference. First operand 5353 states and 7957 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 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:40:49,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:49,045 INFO L93 Difference]: Finished difference Result 21301 states and 30619 transitions. [2025-02-05 17:40:49,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:40:49,045 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-02-05 17:40:49,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:49,147 INFO L225 Difference]: With dead ends: 21301 [2025-02-05 17:40:49,148 INFO L226 Difference]: Without dead ends: 18243 [2025-02-05 17:40:49,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 17:40:49,156 INFO L435 NwaCegarLoop]: 1613 mSDtfsCounter, 6328 mSDsluCounter, 2047 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6328 SdHoareTripleChecker+Valid, 3660 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:49,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6328 Valid, 3660 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:40:49,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18243 states. [2025-02-05 17:40:49,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18243 to 8409. [2025-02-05 17:40:49,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8409 states, 8407 states have (on average 1.4584275008921137) internal successors, (12261), 8408 states have internal predecessors, (12261), 0 states have call successors, (0), 0 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:40:49,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8409 states to 8409 states and 12261 transitions. [2025-02-05 17:40:49,442 INFO L78 Accepts]: Start accepts. Automaton has 8409 states and 12261 transitions. Word has length 77 [2025-02-05 17:40:49,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:49,442 INFO L471 AbstractCegarLoop]: Abstraction has 8409 states and 12261 transitions. [2025-02-05 17:40:49,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 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:40:49,443 INFO L276 IsEmpty]: Start isEmpty. Operand 8409 states and 12261 transitions. [2025-02-05 17:40:49,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 17:40:49,445 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:49,445 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:40:49,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:40:49,445 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:49,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:49,445 INFO L85 PathProgramCache]: Analyzing trace with hash 707522693, now seen corresponding path program 1 times [2025-02-05 17:40:49,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:49,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263045030] [2025-02-05 17:40:49,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:49,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:49,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 17:40:49,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 17:40:49,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:49,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:49,613 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 17:40:49,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:49,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263045030] [2025-02-05 17:40:49,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263045030] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:49,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:49,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:40:49,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359388891] [2025-02-05 17:40:49,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:49,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:40:49,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:49,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:40:49,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:40:49,614 INFO L87 Difference]: Start difference. First operand 8409 states and 12261 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 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:40:50,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:50,285 INFO L93 Difference]: Finished difference Result 24357 states and 34923 transitions. [2025-02-05 17:40:50,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:40:50,286 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-02-05 17:40:50,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:50,333 INFO L225 Difference]: With dead ends: 24357 [2025-02-05 17:40:50,333 INFO L226 Difference]: Without dead ends: 21299 [2025-02-05 17:40:50,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 17:40:50,345 INFO L435 NwaCegarLoop]: 1610 mSDtfsCounter, 6357 mSDsluCounter, 1957 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6357 SdHoareTripleChecker+Valid, 3567 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:50,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6357 Valid, 3567 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:40:50,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21299 states. [2025-02-05 17:40:50,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21299 to 13001. [2025-02-05 17:40:50,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13001 states, 12999 states have (on average 1.436802830986999) internal successors, (18677), 13000 states have internal predecessors, (18677), 0 states have call successors, (0), 0 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:40:50,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13001 states to 13001 states and 18677 transitions. [2025-02-05 17:40:50,749 INFO L78 Accepts]: Start accepts. Automaton has 13001 states and 18677 transitions. Word has length 77 [2025-02-05 17:40:50,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:50,749 INFO L471 AbstractCegarLoop]: Abstraction has 13001 states and 18677 transitions. [2025-02-05 17:40:50,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 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:40:50,750 INFO L276 IsEmpty]: Start isEmpty. Operand 13001 states and 18677 transitions. [2025-02-05 17:40:50,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 17:40:50,752 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:50,752 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:40:50,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:40:50,752 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:50,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:50,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1122698565, now seen corresponding path program 1 times [2025-02-05 17:40:50,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:50,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879777359] [2025-02-05 17:40:50,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:50,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:50,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 17:40:50,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 17:40:50,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:50,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:50,922 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 17:40:50,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:50,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879777359] [2025-02-05 17:40:50,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879777359] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:50,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:50,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:40:50,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477827617] [2025-02-05 17:40:50,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:50,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:40:50,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:50,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:40:50,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:40:50,924 INFO L87 Difference]: Start difference. First operand 13001 states and 18677 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 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:40:51,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:51,417 INFO L93 Difference]: Finished difference Result 27413 states and 39227 transitions. [2025-02-05 17:40:51,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:40:51,418 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-02-05 17:40:51,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:51,473 INFO L225 Difference]: With dead ends: 27413 [2025-02-05 17:40:51,473 INFO L226 Difference]: Without dead ends: 24355 [2025-02-05 17:40:51,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 17:40:51,488 INFO L435 NwaCegarLoop]: 1607 mSDtfsCounter, 6394 mSDsluCounter, 1970 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6394 SdHoareTripleChecker+Valid, 3577 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:51,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6394 Valid, 3577 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:40:51,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24355 states. [2025-02-05 17:40:52,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24355 to 16057. [2025-02-05 17:40:52,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16057 states, 16055 states have (on average 1.4313920896916847) internal successors, (22981), 16056 states have internal predecessors, (22981), 0 states have call successors, (0), 0 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:40:52,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16057 states to 16057 states and 22981 transitions. [2025-02-05 17:40:52,117 INFO L78 Accepts]: Start accepts. Automaton has 16057 states and 22981 transitions. Word has length 77 [2025-02-05 17:40:52,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:52,117 INFO L471 AbstractCegarLoop]: Abstraction has 16057 states and 22981 transitions. [2025-02-05 17:40:52,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 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:40:52,117 INFO L276 IsEmpty]: Start isEmpty. Operand 16057 states and 22981 transitions. [2025-02-05 17:40:52,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 17:40:52,120 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:52,120 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:40:52,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:40:52,120 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:52,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:52,121 INFO L85 PathProgramCache]: Analyzing trace with hash 635980293, now seen corresponding path program 1 times [2025-02-05 17:40:52,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:52,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579657857] [2025-02-05 17:40:52,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:52,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:52,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 17:40:52,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 17:40:52,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:52,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:52,283 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 17:40:52,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:52,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579657857] [2025-02-05 17:40:52,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579657857] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:52,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:52,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:40:52,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980135403] [2025-02-05 17:40:52,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:52,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:40:52,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:52,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:40:52,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:40:52,284 INFO L87 Difference]: Start difference. First operand 16057 states and 22981 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 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:40:52,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:52,870 INFO L93 Difference]: Finished difference Result 30469 states and 43531 transitions. [2025-02-05 17:40:52,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:40:52,870 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-02-05 17:40:52,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:52,931 INFO L225 Difference]: With dead ends: 30469 [2025-02-05 17:40:52,931 INFO L226 Difference]: Without dead ends: 27411 [2025-02-05 17:40:52,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 17:40:52,942 INFO L435 NwaCegarLoop]: 1613 mSDtfsCounter, 6343 mSDsluCounter, 2028 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6343 SdHoareTripleChecker+Valid, 3641 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:52,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6343 Valid, 3641 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:40:52,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27411 states. [2025-02-05 17:40:53,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27411 to 19113. [2025-02-05 17:40:53,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19113 states, 19111 states have (on average 1.4277117890220292) internal successors, (27285), 19112 states have internal predecessors, (27285), 0 states have call successors, (0), 0 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:40:53,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19113 states to 19113 states and 27285 transitions. [2025-02-05 17:40:53,759 INFO L78 Accepts]: Start accepts. Automaton has 19113 states and 27285 transitions. Word has length 77 [2025-02-05 17:40:53,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:53,759 INFO L471 AbstractCegarLoop]: Abstraction has 19113 states and 27285 transitions. [2025-02-05 17:40:53,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 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:40:53,759 INFO L276 IsEmpty]: Start isEmpty. Operand 19113 states and 27285 transitions. [2025-02-05 17:40:53,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 17:40:53,762 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:53,762 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:40:53,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 17:40:53,763 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:53,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:53,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1791105029, now seen corresponding path program 1 times [2025-02-05 17:40:53,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:53,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911786] [2025-02-05 17:40:53,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:53,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:53,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 17:40:53,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 17:40:53,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:53,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:53,902 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 17:40:53,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:53,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911786] [2025-02-05 17:40:53,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911786] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:53,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:53,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:40:53,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112499429] [2025-02-05 17:40:53,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:53,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:40:53,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:53,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:40:53,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:40:53,904 INFO L87 Difference]: Start difference. First operand 19113 states and 27285 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 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:40:54,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:54,552 INFO L93 Difference]: Finished difference Result 31765 states and 45403 transitions. [2025-02-05 17:40:54,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:40:54,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-02-05 17:40:54,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:54,599 INFO L225 Difference]: With dead ends: 31765 [2025-02-05 17:40:54,599 INFO L226 Difference]: Without dead ends: 29587 [2025-02-05 17:40:54,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 17:40:54,607 INFO L435 NwaCegarLoop]: 1614 mSDtfsCounter, 6326 mSDsluCounter, 2120 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6326 SdHoareTripleChecker+Valid, 3734 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:54,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6326 Valid, 3734 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:40:54,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29587 states. [2025-02-05 17:40:55,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29587 to 21289. [2025-02-05 17:40:55,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21289 states, 21287 states have (on average 1.4275849109785315) internal successors, (30389), 21288 states have internal predecessors, (30389), 0 states have call successors, (0), 0 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:40:55,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21289 states to 21289 states and 30389 transitions. [2025-02-05 17:40:55,211 INFO L78 Accepts]: Start accepts. Automaton has 21289 states and 30389 transitions. Word has length 79 [2025-02-05 17:40:55,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:55,211 INFO L471 AbstractCegarLoop]: Abstraction has 21289 states and 30389 transitions. [2025-02-05 17:40:55,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 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:40:55,212 INFO L276 IsEmpty]: Start isEmpty. Operand 21289 states and 30389 transitions. [2025-02-05 17:40:55,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 17:40:55,216 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:55,216 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:40:55,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 17:40:55,217 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:55,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:55,217 INFO L85 PathProgramCache]: Analyzing trace with hash -838885117, now seen corresponding path program 1 times [2025-02-05 17:40:55,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:55,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219070498] [2025-02-05 17:40:55,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:55,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:55,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 17:40:55,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 17:40:55,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:55,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:55,369 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:55,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:55,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219070498] [2025-02-05 17:40:55,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219070498] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:55,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:55,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:40:55,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995228929] [2025-02-05 17:40:55,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:55,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:40:55,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:55,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:40:55,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:55,370 INFO L87 Difference]: Start difference. First operand 21289 states and 30389 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:55,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:55,861 INFO L93 Difference]: Finished difference Result 35457 states and 50588 transitions. [2025-02-05 17:40:55,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:40:55,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-02-05 17:40:55,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:55,887 INFO L225 Difference]: With dead ends: 35457 [2025-02-05 17:40:55,887 INFO L226 Difference]: Without dead ends: 16463 [2025-02-05 17:40:55,902 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:40:55,903 INFO L435 NwaCegarLoop]: 1586 mSDtfsCounter, 50 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 3117 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:40:55,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 3117 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:40:55,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16463 states. [2025-02-05 17:40:56,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16463 to 16461. [2025-02-05 17:40:56,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16461 states, 16459 states have (on average 1.4334406707576401) internal successors, (23593), 16460 states have internal predecessors, (23593), 0 states have call successors, (0), 0 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:40:56,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16461 states to 16461 states and 23593 transitions. [2025-02-05 17:40:56,275 INFO L78 Accepts]: Start accepts. Automaton has 16461 states and 23593 transitions. Word has length 79 [2025-02-05 17:40:56,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:56,275 INFO L471 AbstractCegarLoop]: Abstraction has 16461 states and 23593 transitions. [2025-02-05 17:40:56,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:56,276 INFO L276 IsEmpty]: Start isEmpty. Operand 16461 states and 23593 transitions. [2025-02-05 17:40:56,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 17:40:56,277 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:56,278 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:40:56,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 17:40:56,278 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:56,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:56,279 INFO L85 PathProgramCache]: Analyzing trace with hash 97319945, now seen corresponding path program 1 times [2025-02-05 17:40:56,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:56,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545899196] [2025-02-05 17:40:56,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:56,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:56,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 17:40:56,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 17:40:56,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:56,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:56,445 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:56,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:56,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545899196] [2025-02-05 17:40:56,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545899196] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:56,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:56,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:40:56,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250119941] [2025-02-05 17:40:56,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:56,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:40:56,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:56,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:40:56,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:56,447 INFO L87 Difference]: Start difference. First operand 16461 states and 23593 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:56,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:56,603 INFO L93 Difference]: Finished difference Result 23537 states and 33579 transitions. [2025-02-05 17:40:56,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:40:56,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-02-05 17:40:56,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:56,624 INFO L225 Difference]: With dead ends: 23537 [2025-02-05 17:40:56,625 INFO L226 Difference]: Without dead ends: 9391 [2025-02-05 17:40:56,639 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:40:56,639 INFO L435 NwaCegarLoop]: 1579 mSDtfsCounter, 45 mSDsluCounter, 1523 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 3102 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:40:56,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 3102 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:40:56,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9391 states. [2025-02-05 17:40:56,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9391 to 9389. [2025-02-05 17:40:56,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9389 states, 9387 states have (on average 1.4386918078193247) internal successors, (13505), 9388 states have internal predecessors, (13505), 0 states have call successors, (0), 0 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:40:56,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9389 states to 9389 states and 13505 transitions. [2025-02-05 17:40:56,956 INFO L78 Accepts]: Start accepts. Automaton has 9389 states and 13505 transitions. Word has length 80 [2025-02-05 17:40:56,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:56,958 INFO L471 AbstractCegarLoop]: Abstraction has 9389 states and 13505 transitions. [2025-02-05 17:40:56,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:56,958 INFO L276 IsEmpty]: Start isEmpty. Operand 9389 states and 13505 transitions. [2025-02-05 17:40:56,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 17:40:56,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:56,959 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:40:56,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 17:40:56,960 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:56,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:56,960 INFO L85 PathProgramCache]: Analyzing trace with hash -755676880, now seen corresponding path program 1 times [2025-02-05 17:40:56,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:56,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622807468] [2025-02-05 17:40:56,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:56,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:56,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 17:40:57,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 17:40:57,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:57,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:57,149 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:57,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:57,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622807468] [2025-02-05 17:40:57,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622807468] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:57,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:57,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:40:57,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493207993] [2025-02-05 17:40:57,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:57,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:40:57,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:57,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:40:57,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:57,150 INFO L87 Difference]: Start difference. First operand 9389 states and 13505 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 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:40:57,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:57,389 INFO L93 Difference]: Finished difference Result 12929 states and 18447 transitions. [2025-02-05 17:40:57,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:40:57,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-02-05 17:40:57,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:57,419 INFO L225 Difference]: With dead ends: 12929 [2025-02-05 17:40:57,419 INFO L226 Difference]: Without dead ends: 5855 [2025-02-05 17:40:57,427 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:40:57,427 INFO L435 NwaCegarLoop]: 1572 mSDtfsCounter, 42 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3087 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:40:57,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3087 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:40:57,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5855 states. [2025-02-05 17:40:57,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5855 to 5853. [2025-02-05 17:40:57,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5853 states, 5851 states have (on average 1.4549649632541446) internal successors, (8513), 5852 states have internal predecessors, (8513), 0 states have call successors, (0), 0 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:40:57,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5853 states to 5853 states and 8513 transitions. [2025-02-05 17:40:57,586 INFO L78 Accepts]: Start accepts. Automaton has 5853 states and 8513 transitions. Word has length 82 [2025-02-05 17:40:57,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:57,586 INFO L471 AbstractCegarLoop]: Abstraction has 5853 states and 8513 transitions. [2025-02-05 17:40:57,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 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:40:57,586 INFO L276 IsEmpty]: Start isEmpty. Operand 5853 states and 8513 transitions. [2025-02-05 17:40:57,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 17:40:57,587 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:57,588 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:40:57,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 17:40:57,588 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:57,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:57,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1816537225, now seen corresponding path program 1 times [2025-02-05 17:40:57,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:57,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172063276] [2025-02-05 17:40:57,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:57,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:57,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 17:40:57,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 17:40:57,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:57,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:57,696 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:57,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:57,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172063276] [2025-02-05 17:40:57,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172063276] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:57,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:57,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:40:57,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064053950] [2025-02-05 17:40:57,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:57,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:40:57,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:57,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:40:57,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:57,700 INFO L87 Difference]: Start difference. First operand 5853 states and 8513 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 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:40:57,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:57,774 INFO L93 Difference]: Finished difference Result 7625 states and 10959 transitions. [2025-02-05 17:40:57,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:40:57,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2025-02-05 17:40:57,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:57,783 INFO L225 Difference]: With dead ends: 7625 [2025-02-05 17:40:57,784 INFO L226 Difference]: Without dead ends: 4087 [2025-02-05 17:40:57,788 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:40:57,790 INFO L435 NwaCegarLoop]: 1565 mSDtfsCounter, 39 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3072 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:40:57,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3072 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:40:57,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4087 states. [2025-02-05 17:40:57,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4087 to 4085. [2025-02-05 17:40:57,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4085 states, 4083 states have (on average 1.4800391868723977) internal successors, (6043), 4084 states have internal predecessors, (6043), 0 states have call successors, (0), 0 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:40:57,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4085 states to 4085 states and 6043 transitions. [2025-02-05 17:40:57,858 INFO L78 Accepts]: Start accepts. Automaton has 4085 states and 6043 transitions. Word has length 84 [2025-02-05 17:40:57,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:57,859 INFO L471 AbstractCegarLoop]: Abstraction has 4085 states and 6043 transitions. [2025-02-05 17:40:57,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 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:40:57,859 INFO L276 IsEmpty]: Start isEmpty. Operand 4085 states and 6043 transitions. [2025-02-05 17:40:57,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 17:40:57,860 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:57,861 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, 1, 1, 1, 1, 1, 1, 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:40:57,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 17:40:57,861 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:57,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:57,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1212344610, now seen corresponding path program 1 times [2025-02-05 17:40:57,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:57,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698967074] [2025-02-05 17:40:57,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:57,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:57,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 17:40:57,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 17:40:57,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:57,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:57,939 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:57,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:57,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698967074] [2025-02-05 17:40:57,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698967074] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:57,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:57,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:40:57,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096598857] [2025-02-05 17:40:57,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:57,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:40:57,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:57,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:40:57,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:57,941 INFO L87 Difference]: Start difference. First operand 4085 states and 6043 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:57,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:57,977 INFO L93 Difference]: Finished difference Result 4973 states and 7254 transitions. [2025-02-05 17:40:57,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:40:57,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-02-05 17:40:57,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:57,984 INFO L225 Difference]: With dead ends: 4973 [2025-02-05 17:40:57,984 INFO L226 Difference]: Without dead ends: 3203 [2025-02-05 17:40:57,986 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:40:57,990 INFO L435 NwaCegarLoop]: 1558 mSDtfsCounter, 36 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 3057 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:40:57,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 3057 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:40:57,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3203 states. [2025-02-05 17:40:58,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3203 to 3201. [2025-02-05 17:40:58,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3201 states, 3199 states have (on average 1.5070334479524852) internal successors, (4821), 3200 states have internal predecessors, (4821), 0 states have call successors, (0), 0 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:40:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3201 states to 3201 states and 4821 transitions. [2025-02-05 17:40:58,086 INFO L78 Accepts]: Start accepts. Automaton has 3201 states and 4821 transitions. Word has length 86 [2025-02-05 17:40:58,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:58,086 INFO L471 AbstractCegarLoop]: Abstraction has 3201 states and 4821 transitions. [2025-02-05 17:40:58,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:58,087 INFO L276 IsEmpty]: Start isEmpty. Operand 3201 states and 4821 transitions. [2025-02-05 17:40:58,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-05 17:40:58,087 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:58,088 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:58,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 17:40:58,088 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:58,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:58,088 INFO L85 PathProgramCache]: Analyzing trace with hash -705464475, now seen corresponding path program 1 times [2025-02-05 17:40:58,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:58,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300364141] [2025-02-05 17:40:58,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:58,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:58,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 17:40:58,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 17:40:58,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:58,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:58,477 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:58,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:58,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300364141] [2025-02-05 17:40:58,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300364141] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:40:58,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128197889] [2025-02-05 17:40:58,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:58,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:40:58,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:40:58,480 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:40:58,482 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:40:58,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 17:40:58,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 17:40:58,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:58,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:58,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 17:40:58,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:40:59,002 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:59,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:40:59,350 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:59,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128197889] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:40:59,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:40:59,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 19 [2025-02-05 17:40:59,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352971185] [2025-02-05 17:40:59,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:40:59,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 17:40:59,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:59,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 17:40:59,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2025-02-05 17:40:59,352 INFO L87 Difference]: Start difference. First operand 3201 states and 4821 transitions. Second operand has 19 states, 19 states have (on average 13.210526315789474) internal successors, (251), 19 states have internal predecessors, (251), 0 states have call successors, (0), 0 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:41:02,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:41:02,209 INFO L93 Difference]: Finished difference Result 10251 states and 14138 transitions. [2025-02-05 17:41:02,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-02-05 17:41:02,210 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 13.210526315789474) internal successors, (251), 19 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-02-05 17:41:02,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:41:02,230 INFO L225 Difference]: With dead ends: 10251 [2025-02-05 17:41:02,231 INFO L226 Difference]: Without dead ends: 9279 [2025-02-05 17:41:02,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1336 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=913, Invalid=3509, Unknown=0, NotChecked=0, Total=4422 [2025-02-05 17:41:02,236 INFO L435 NwaCegarLoop]: 1558 mSDtfsCounter, 14882 mSDsluCounter, 8125 mSDsCounter, 0 mSdLazyCounter, 1551 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14882 SdHoareTripleChecker+Valid, 9683 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:41:02,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14882 Valid, 9683 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1551 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 17:41:02,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9279 states. [2025-02-05 17:41:02,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9279 to 8669. [2025-02-05 17:41:02,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8669 states, 8667 states have (on average 1.3755624783662166) internal successors, (11922), 8668 states have internal predecessors, (11922), 0 states have call successors, (0), 0 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:41:02,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8669 states to 8669 states and 11922 transitions. [2025-02-05 17:41:02,506 INFO L78 Accepts]: Start accepts. Automaton has 8669 states and 11922 transitions. Word has length 88 [2025-02-05 17:41:02,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:41:02,506 INFO L471 AbstractCegarLoop]: Abstraction has 8669 states and 11922 transitions. [2025-02-05 17:41:02,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 13.210526315789474) internal successors, (251), 19 states have internal predecessors, (251), 0 states have call successors, (0), 0 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:41:02,506 INFO L276 IsEmpty]: Start isEmpty. Operand 8669 states and 11922 transitions. [2025-02-05 17:41:02,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 17:41:02,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:41:02,508 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, 1, 1, 1, 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:41:02,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 17:41:02,708 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,SelfDestructingSolverStorable22 [2025-02-05 17:41:02,708 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:41:02,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:41:02,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1536780076, now seen corresponding path program 1 times [2025-02-05 17:41:02,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:41:02,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128313809] [2025-02-05 17:41:02,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:41:02,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:41:02,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 17:41:02,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 17:41:02,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:41:02,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:41:03,071 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:41:03,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:41:03,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128313809] [2025-02-05 17:41:03,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128313809] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:41:03,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820467886] [2025-02-05 17:41:03,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:41:03,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:41:03,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:41:03,092 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:41:03,093 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:41:03,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 17:41:03,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 17:41:03,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:41:03,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:41:03,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 17:41:03,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:41:03,811 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:41:03,811 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:41:04,848 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:41:04,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820467886] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:41:04,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:41:04,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2025-02-05 17:41:04,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935595736] [2025-02-05 17:41:04,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:41:04,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-05 17:41:04,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:41:04,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-05 17:41:04,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2025-02-05 17:41:04,850 INFO L87 Difference]: Start difference. First operand 8669 states and 11922 transitions. Second operand has 32 states, 32 states have (on average 6.84375) internal successors, (219), 32 states have internal predecessors, (219), 0 states have call successors, (0), 0 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:41:06,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:41:06,796 INFO L93 Difference]: Finished difference Result 19151 states and 25620 transitions. [2025-02-05 17:41:06,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-05 17:41:06,797 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 6.84375) internal successors, (219), 32 states have internal predecessors, (219), 0 states have call successors, (0), 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 89 [2025-02-05 17:41:06,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:41:06,817 INFO L225 Difference]: With dead ends: 19151 [2025-02-05 17:41:06,817 INFO L226 Difference]: Without dead ends: 12833 [2025-02-05 17:41:06,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=608, Invalid=2698, Unknown=0, NotChecked=0, Total=3306 [2025-02-05 17:41:06,828 INFO L435 NwaCegarLoop]: 1504 mSDtfsCounter, 18126 mSDsluCounter, 15487 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18126 SdHoareTripleChecker+Valid, 16991 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:41:06,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18126 Valid, 16991 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:41:06,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12833 states. [2025-02-05 17:41:07,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12833 to 11243. [2025-02-05 17:41:07,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11243 states, 11241 states have (on average 1.347122142158171) internal successors, (15143), 11242 states have internal predecessors, (15143), 0 states have call successors, (0), 0 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:41:07,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11243 states to 11243 states and 15143 transitions. [2025-02-05 17:41:07,224 INFO L78 Accepts]: Start accepts. Automaton has 11243 states and 15143 transitions. Word has length 89 [2025-02-05 17:41:07,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:41:07,224 INFO L471 AbstractCegarLoop]: Abstraction has 11243 states and 15143 transitions. [2025-02-05 17:41:07,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.84375) internal successors, (219), 32 states have internal predecessors, (219), 0 states have call successors, (0), 0 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:41:07,225 INFO L276 IsEmpty]: Start isEmpty. Operand 11243 states and 15143 transitions. [2025-02-05 17:41:07,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:41:07,225 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:41:07,226 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, 1, 1, 1, 1, 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:41:07,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 17:41:07,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:41:07,426 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:41:07,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:41:07,427 INFO L85 PathProgramCache]: Analyzing trace with hash 196015673, now seen corresponding path program 1 times [2025-02-05 17:41:07,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:41:07,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418413809] [2025-02-05 17:41:07,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:41:07,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:41:07,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:41:07,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:41:07,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:41:07,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:41:07,766 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:41:07,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:41:07,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418413809] [2025-02-05 17:41:07,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418413809] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:41:07,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976176355] [2025-02-05 17:41:07,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:41:07,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:41:07,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:41:07,769 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:41:07,771 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:41:07,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:41:07,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:41:07,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:41:07,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:41:07,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-05 17:41:07,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:41:08,534 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:41:08,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:41:09,554 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:41:09,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976176355] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:41:09,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:41:09,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 29 [2025-02-05 17:41:09,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99583197] [2025-02-05 17:41:09,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:41:09,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-05 17:41:09,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:41:09,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-05 17:41:09,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2025-02-05 17:41:09,556 INFO L87 Difference]: Start difference. First operand 11243 states and 15143 transitions. Second operand has 29 states, 29 states have (on average 8.344827586206897) internal successors, (242), 29 states have internal predecessors, (242), 0 states have call successors, (0), 0 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:41:10,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:41:10,641 INFO L93 Difference]: Finished difference Result 29719 states and 39117 transitions. [2025-02-05 17:41:10,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 17:41:10,641 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 8.344827586206897) internal successors, (242), 29 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-02-05 17:41:10,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:41:10,660 INFO L225 Difference]: With dead ends: 29719 [2025-02-05 17:41:10,660 INFO L226 Difference]: Without dead ends: 20845 [2025-02-05 17:41:10,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=437, Invalid=1455, Unknown=0, NotChecked=0, Total=1892 [2025-02-05 17:41:10,667 INFO L435 NwaCegarLoop]: 1513 mSDtfsCounter, 15195 mSDsluCounter, 7845 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15195 SdHoareTripleChecker+Valid, 9358 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:41:10,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15195 Valid, 9358 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:41:10,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20845 states. [2025-02-05 17:41:11,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20845 to 20603. [2025-02-05 17:41:11,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20603 states, 20601 states have (on average 1.3081403815348769) internal successors, (26949), 20602 states have internal predecessors, (26949), 0 states have call successors, (0), 0 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:41:11,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20603 states to 20603 states and 26949 transitions. [2025-02-05 17:41:11,256 INFO L78 Accepts]: Start accepts. Automaton has 20603 states and 26949 transitions. Word has length 90 [2025-02-05 17:41:11,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:41:11,257 INFO L471 AbstractCegarLoop]: Abstraction has 20603 states and 26949 transitions. [2025-02-05 17:41:11,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.344827586206897) internal successors, (242), 29 states have internal predecessors, (242), 0 states have call successors, (0), 0 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:41:11,257 INFO L276 IsEmpty]: Start isEmpty. Operand 20603 states and 26949 transitions. [2025-02-05 17:41:11,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:41:11,258 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:41:11,258 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, 1, 1, 1, 1, 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:41:11,266 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:41:11,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:41:11,459 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:41:11,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:41:11,459 INFO L85 PathProgramCache]: Analyzing trace with hash 773681241, now seen corresponding path program 1 times [2025-02-05 17:41:11,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:41:11,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924356632] [2025-02-05 17:41:11,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:41:11,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:41:11,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:41:11,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:41:11,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:41:11,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:41:11,766 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:41:11,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:41:11,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924356632] [2025-02-05 17:41:11,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924356632] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:41:11,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666209518] [2025-02-05 17:41:11,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:41:11,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:41:11,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:41:11,770 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:41:11,772 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:41:11,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:41:11,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:41:11,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:41:11,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:41:11,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 17:41:11,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:41:12,305 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:41:12,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:41:13,196 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:41:13,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666209518] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:41:13,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:41:13,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-02-05 17:41:13,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68761441] [2025-02-05 17:41:13,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:41:13,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-05 17:41:13,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:41:13,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-05 17:41:13,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2025-02-05 17:41:13,199 INFO L87 Difference]: Start difference. First operand 20603 states and 26949 transitions. Second operand has 25 states, 25 states have (on average 10.16) internal successors, (254), 24 states have internal predecessors, (254), 0 states have call successors, (0), 0 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:41:16,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:41:16,450 INFO L93 Difference]: Finished difference Result 98133 states and 126411 transitions. [2025-02-05 17:41:16,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-05 17:41:16,450 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 10.16) internal successors, (254), 24 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-02-05 17:41:16,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:41:16,523 INFO L225 Difference]: With dead ends: 98133 [2025-02-05 17:41:16,523 INFO L226 Difference]: Without dead ends: 80045 [2025-02-05 17:41:16,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=551, Invalid=2205, Unknown=0, NotChecked=0, Total=2756 [2025-02-05 17:41:16,536 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 17042 mSDsluCounter, 5556 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17042 SdHoareTripleChecker+Valid, 7105 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:41:16,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17042 Valid, 7105 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:41:16,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80045 states. [2025-02-05 17:41:19,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80045 to 79041. [2025-02-05 17:41:19,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79041 states, 79039 states have (on average 1.257682916028796) internal successors, (99406), 79040 states have internal predecessors, (99406), 0 states have call successors, (0), 0 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:41:19,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79041 states to 79041 states and 99406 transitions. [2025-02-05 17:41:19,315 INFO L78 Accepts]: Start accepts. Automaton has 79041 states and 99406 transitions. Word has length 90 [2025-02-05 17:41:19,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:41:19,315 INFO L471 AbstractCegarLoop]: Abstraction has 79041 states and 99406 transitions. [2025-02-05 17:41:19,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.16) internal successors, (254), 24 states have internal predecessors, (254), 0 states have call successors, (0), 0 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:41:19,315 INFO L276 IsEmpty]: Start isEmpty. Operand 79041 states and 99406 transitions. [2025-02-05 17:41:19,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 17:41:19,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:41:19,317 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, 1, 1, 1, 1, 1, 1, 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:41:19,326 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:41:19,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-05 17:41:19,518 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:41:19,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:41:19,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1009779006, now seen corresponding path program 1 times [2025-02-05 17:41:19,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:41:19,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798251947] [2025-02-05 17:41:19,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:41:19,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:41:19,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 17:41:19,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 17:41:19,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:41:19,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:41:20,382 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:41:20,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:41:20,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798251947] [2025-02-05 17:41:20,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798251947] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:41:20,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213408526] [2025-02-05 17:41:20,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:41:20,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:41:20,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:41:20,386 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:41:20,388 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:41:20,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 17:41:20,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 17:41:20,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:41:20,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:41:20,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 17:41:20,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:41:21,230 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:41:21,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:41:22,301 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:41:22,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213408526] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:41:22,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:41:22,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 30 [2025-02-05 17:41:22,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692887298] [2025-02-05 17:41:22,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:41:22,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-05 17:41:22,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:41:22,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-05 17:41:22,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=751, Unknown=0, NotChecked=0, Total=870 [2025-02-05 17:41:22,302 INFO L87 Difference]: Start difference. First operand 79041 states and 99406 transitions. Second operand has 30 states, 30 states have (on average 7.1) internal successors, (213), 30 states have internal predecessors, (213), 0 states have call successors, (0), 0 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:41:26,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:41:26,584 INFO L93 Difference]: Finished difference Result 135365 states and 169277 transitions. [2025-02-05 17:41:26,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 17:41:26,584 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 7.1) internal successors, (213), 30 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-02-05 17:41:26,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:41:26,697 INFO L225 Difference]: With dead ends: 135365 [2025-02-05 17:41:26,698 INFO L226 Difference]: Without dead ends: 110779 [2025-02-05 17:41:26,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=453, Invalid=1803, Unknown=0, NotChecked=0, Total=2256 [2025-02-05 17:41:26,719 INFO L435 NwaCegarLoop]: 1526 mSDtfsCounter, 9716 mSDsluCounter, 17338 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9716 SdHoareTripleChecker+Valid, 18864 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:41:26,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9716 Valid, 18864 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:41:26,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110779 states. [2025-02-05 17:41:29,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110779 to 73517. [2025-02-05 17:41:29,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73517 states, 73515 states have (on average 1.2562878324151534) internal successors, (92356), 73516 states have internal predecessors, (92356), 0 states have call successors, (0), 0 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:41:29,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73517 states to 73517 states and 92356 transitions. [2025-02-05 17:41:29,786 INFO L78 Accepts]: Start accepts. Automaton has 73517 states and 92356 transitions. Word has length 92 [2025-02-05 17:41:29,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:41:29,786 INFO L471 AbstractCegarLoop]: Abstraction has 73517 states and 92356 transitions. [2025-02-05 17:41:29,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.1) internal successors, (213), 30 states have internal predecessors, (213), 0 states have call successors, (0), 0 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:41:29,786 INFO L276 IsEmpty]: Start isEmpty. Operand 73517 states and 92356 transitions. [2025-02-05 17:41:29,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 17:41:29,787 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:41:29,787 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, 1, 1, 1, 1, 1, 1, 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:41:29,793 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:41:29,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-02-05 17:41:29,988 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:41:29,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:41:29,988 INFO L85 PathProgramCache]: Analyzing trace with hash -201120643, now seen corresponding path program 1 times [2025-02-05 17:41:29,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:41:29,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427946097] [2025-02-05 17:41:29,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:41:29,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:41:29,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 17:41:30,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 17:41:30,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:41:30,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:41:30,772 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:41:30,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:41:30,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427946097] [2025-02-05 17:41:30,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427946097] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:41:30,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393869420] [2025-02-05 17:41:30,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:41:30,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:41:30,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:41:30,775 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:41:30,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 17:41:30,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 17:41:30,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 17:41:30,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:41:30,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:41:30,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-05 17:41:30,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:41:35,308 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:41:35,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:41:41,176 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:41:41,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393869420] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:41:41,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:41:41,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 32, 26] total 64 [2025-02-05 17:41:41,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907036476] [2025-02-05 17:41:41,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:41:41,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-02-05 17:41:41,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:41:41,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-02-05 17:41:41,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=3554, Unknown=0, NotChecked=0, Total=4032 [2025-02-05 17:41:41,178 INFO L87 Difference]: Start difference. First operand 73517 states and 92356 transitions. Second operand has 64 states, 64 states have (on average 3.96875) internal successors, (254), 64 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)