./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-44.i --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/hardness-nfm22/hardness_operatoramount_amount500_file-44.i -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 220ce7b7c26744c9904e5fd461259f8f4f4bb30e1410a3523238b4cddd16ae20 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:40:30,537 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:40:30,610 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:40:30,617 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:40:30,618 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:40:30,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:40:30,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:40:30,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:40:30,650 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:40:30,650 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:40:30,651 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:40:30,651 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:40:30,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:40:30,651 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:40:30,652 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:40:30,652 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:40:30,653 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:40:30,653 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:40:30,653 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:40:30,653 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:40:30,653 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:40:30,653 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:40:30,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:40:30,653 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:40:30,654 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:40:30,654 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:40:30,654 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:40:30,654 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:40:30,654 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:40:30,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:40:30,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:40:30,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:40:30,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:40:30,654 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:40:30,654 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:40:30,654 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:40:30,655 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:40:30,655 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:40:30,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:40:30,655 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:40:30,655 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:40:30,655 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:40:30,655 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:40:30,655 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 -> 220ce7b7c26744c9904e5fd461259f8f4f4bb30e1410a3523238b4cddd16ae20 [2025-02-06 02:40:30,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:40:30,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:40:30,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:40:30,946 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:40:30,946 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:40:30,947 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-44.i [2025-02-06 02:40:32,256 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/62b426231/e7b8fe2742f842c8925c89e76b2b567c/FLAGb29824b2d [2025-02-06 02:40:32,699 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:40:32,703 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-44.i [2025-02-06 02:40:32,725 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/62b426231/e7b8fe2742f842c8925c89e76b2b567c/FLAGb29824b2d [2025-02-06 02:40:32,746 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/62b426231/e7b8fe2742f842c8925c89e76b2b567c [2025-02-06 02:40:32,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:40:32,751 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:40:32,753 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:40:32,754 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:40:32,758 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:40:32,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:40:32" (1/1) ... [2025-02-06 02:40:32,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16fd05f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:32, skipping insertion in model container [2025-02-06 02:40:32,761 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:40:32" (1/1) ... [2025-02-06 02:40:32,801 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:40:32,955 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/hardness-nfm22/hardness_operatoramount_amount500_file-44.i[916,929] [2025-02-06 02:40:33,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:40:33,215 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:40:33,226 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/hardness-nfm22/hardness_operatoramount_amount500_file-44.i[916,929] [2025-02-06 02:40:33,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:40:33,407 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:40:33,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:33 WrapperNode [2025-02-06 02:40:33,409 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:40:33,410 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:40:33,411 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:40:33,411 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:40:33,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:33" (1/1) ... [2025-02-06 02:40:33,445 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:33" (1/1) ... [2025-02-06 02:40:33,540 INFO L138 Inliner]: procedures = 26, calls = 64, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 769 [2025-02-06 02:40:33,541 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:40:33,542 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:40:33,542 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:40:33,542 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:40:33,551 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:33" (1/1) ... [2025-02-06 02:40:33,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:33" (1/1) ... [2025-02-06 02:40:33,565 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:33" (1/1) ... [2025-02-06 02:40:33,660 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-06 02:40:33,661 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:33" (1/1) ... [2025-02-06 02:40:33,661 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:33" (1/1) ... [2025-02-06 02:40:33,701 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:33" (1/1) ... [2025-02-06 02:40:33,704 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:33" (1/1) ... [2025-02-06 02:40:33,717 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:33" (1/1) ... [2025-02-06 02:40:33,723 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:33" (1/1) ... [2025-02-06 02:40:33,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:40:33,744 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:40:33,744 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:40:33,744 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:40:33,746 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:33" (1/1) ... [2025-02-06 02:40:33,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:40:33,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:40:33,785 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-06 02:40:33,788 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-06 02:40:33,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:40:33,813 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:40:33,813 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:40:33,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:40:33,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:40:33,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:40:33,955 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:40:33,957 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:40:35,179 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L639: havoc property_#t~ite46#1;havoc property_#t~bitwise42#1;havoc property_#t~ite45#1;havoc property_#t~ite44#1;havoc property_#t~bitwise43#1;havoc property_#t~short47#1;havoc property_#t~ite54#1;havoc property_#t~ite49#1;havoc property_#t~bitwise48#1;havoc property_#t~bitwise50#1;havoc property_#t~ite53#1;havoc property_#t~ite52#1;havoc property_#t~bitwise51#1;havoc property_#t~short55#1;havoc property_#t~ite58#1;havoc property_#t~ite57#1;havoc property_#t~bitwise56#1;havoc property_#t~short59#1;havoc property_#t~bitwise60#1;havoc property_#t~short61#1;havoc property_#t~ite64#1;havoc property_#t~ite63#1;havoc property_#t~bitwise62#1;havoc property_#t~short65#1; [2025-02-06 02:40:35,360 INFO L? ?]: Removed 99 outVars from TransFormulas that were not future-live. [2025-02-06 02:40:35,360 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:40:35,406 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:40:35,406 INFO L337 CfgBuilder]: Removed 4 assume(true) statements. [2025-02-06 02:40:35,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:40:35 BoogieIcfgContainer [2025-02-06 02:40:35,406 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:40:35,408 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:40:35,408 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:40:35,417 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:40:35,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:40:32" (1/3) ... [2025-02-06 02:40:35,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522fb028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:40:35, skipping insertion in model container [2025-02-06 02:40:35,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:33" (2/3) ... [2025-02-06 02:40:35,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522fb028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:40:35, skipping insertion in model container [2025-02-06 02:40:35,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:40:35" (3/3) ... [2025-02-06 02:40:35,432 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-44.i [2025-02-06 02:40:35,448 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:40:35,452 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-44.i that has 2 procedures, 288 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:40:35,528 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:40:35,541 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;@f39f977, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:40:35,544 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:40:35,549 INFO L276 IsEmpty]: Start isEmpty. Operand has 288 states, 234 states have (on average 1.5726495726495726) internal successors, (368), 235 states have internal predecessors, (368), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-02-06 02:40:35,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-02-06 02:40:35,573 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:35,574 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:40:35,575 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:35,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:35,581 INFO L85 PathProgramCache]: Analyzing trace with hash -846343224, now seen corresponding path program 1 times [2025-02-06 02:40:35,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:35,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965805693] [2025-02-06 02:40:35,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:35,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:35,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-02-06 02:40:35,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-02-06 02:40:35,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:35,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:36,245 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2025-02-06 02:40:36,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:36,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965805693] [2025-02-06 02:40:36,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965805693] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:40:36,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573792241] [2025-02-06 02:40:36,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:36,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:40:36,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:40:36,250 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-06 02:40:36,252 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-06 02:40:36,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-02-06 02:40:36,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-02-06 02:40:36,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:36,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:36,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 1056 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:40:36,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:40:36,758 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2025-02-06 02:40:36,759 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:40:36,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573792241] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:40:36,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:40:36,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:40:36,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69937972] [2025-02-06 02:40:36,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:40:36,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:40:36,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:36,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:40:36,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:40:36,797 INFO L87 Difference]: Start difference. First operand has 288 states, 234 states have (on average 1.5726495726495726) internal successors, (368), 235 states have internal predecessors, (368), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) Second operand has 2 states, 2 states have (on average 61.5) internal successors, (123), 2 states have internal predecessors, (123), 2 states have call successors, (51), 2 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 2 states have call successors, (51) [2025-02-06 02:40:36,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:36,883 INFO L93 Difference]: Finished difference Result 562 states and 973 transitions. [2025-02-06 02:40:36,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:40:36,886 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 61.5) internal successors, (123), 2 states have internal predecessors, (123), 2 states have call successors, (51), 2 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 2 states have call successors, (51) Word has length 373 [2025-02-06 02:40:36,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:36,896 INFO L225 Difference]: With dead ends: 562 [2025-02-06 02:40:36,896 INFO L226 Difference]: Without dead ends: 277 [2025-02-06 02:40:36,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 374 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-06 02:40:36,907 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:36,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 436 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:40:36,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-02-06 02:40:36,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2025-02-06 02:40:36,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 224 states have (on average 1.5535714285714286) internal successors, (348), 224 states have internal predecessors, (348), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-02-06 02:40:36,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 450 transitions. [2025-02-06 02:40:36,986 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 450 transitions. Word has length 373 [2025-02-06 02:40:36,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:36,988 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 450 transitions. [2025-02-06 02:40:36,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 61.5) internal successors, (123), 2 states have internal predecessors, (123), 2 states have call successors, (51), 2 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 2 states have call successors, (51) [2025-02-06 02:40:36,988 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 450 transitions. [2025-02-06 02:40:37,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-02-06 02:40:37,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:37,003 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:40:37,014 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-06 02:40:37,207 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,SelfDestructingSolverStorable0 [2025-02-06 02:40:37,208 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:37,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:37,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1278535447, now seen corresponding path program 1 times [2025-02-06 02:40:37,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:37,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042567259] [2025-02-06 02:40:37,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:37,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:37,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-02-06 02:40:37,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-02-06 02:40:37,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:37,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:37,811 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-02-06 02:40:37,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:37,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042567259] [2025-02-06 02:40:37,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042567259] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:40:37,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:40:37,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:40:37,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481854108] [2025-02-06 02:40:37,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:40:37,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:40:37,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:37,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:40:37,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:40:37,819 INFO L87 Difference]: Start difference. First operand 277 states and 450 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:40:38,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:38,034 INFO L93 Difference]: Finished difference Result 819 states and 1332 transitions. [2025-02-06 02:40:38,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:40:38,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 373 [2025-02-06 02:40:38,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:38,043 INFO L225 Difference]: With dead ends: 819 [2025-02-06 02:40:38,045 INFO L226 Difference]: Without dead ends: 545 [2025-02-06 02:40:38,047 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-06 02:40:38,049 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 422 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:38,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1126 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:40:38,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-02-06 02:40:38,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 326. [2025-02-06 02:40:38,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 273 states have (on average 1.586080586080586) internal successors, (433), 273 states have internal predecessors, (433), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-02-06 02:40:38,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 535 transitions. [2025-02-06 02:40:38,098 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 535 transitions. Word has length 373 [2025-02-06 02:40:38,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:38,102 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 535 transitions. [2025-02-06 02:40:38,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:40:38,103 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 535 transitions. [2025-02-06 02:40:38,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-02-06 02:40:38,110 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:38,110 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:40:38,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:40:38,110 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:38,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:38,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1182298985, now seen corresponding path program 1 times [2025-02-06 02:40:38,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:38,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271708550] [2025-02-06 02:40:38,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:38,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:38,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-02-06 02:40:38,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-02-06 02:40:38,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:38,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:38,561 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-02-06 02:40:38,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:38,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271708550] [2025-02-06 02:40:38,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271708550] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:40:38,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:40:38,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:40:38,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442080787] [2025-02-06 02:40:38,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:40:38,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:40:38,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:38,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:40:38,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:40:38,566 INFO L87 Difference]: Start difference. First operand 326 states and 535 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:40:38,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:38,719 INFO L93 Difference]: Finished difference Result 868 states and 1414 transitions. [2025-02-06 02:40:38,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:40:38,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 373 [2025-02-06 02:40:38,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:38,729 INFO L225 Difference]: With dead ends: 868 [2025-02-06 02:40:38,729 INFO L226 Difference]: Without dead ends: 545 [2025-02-06 02:40:38,730 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-06 02:40:38,731 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 426 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:38,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 968 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:40:38,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-02-06 02:40:38,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 326. [2025-02-06 02:40:38,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 273 states have (on average 1.575091575091575) internal successors, (430), 273 states have internal predecessors, (430), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-02-06 02:40:38,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 532 transitions. [2025-02-06 02:40:38,768 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 532 transitions. Word has length 373 [2025-02-06 02:40:38,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:38,769 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 532 transitions. [2025-02-06 02:40:38,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:40:38,769 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 532 transitions. [2025-02-06 02:40:38,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-02-06 02:40:38,775 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:38,775 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:40:38,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:40:38,775 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:38,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:38,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1620140790, now seen corresponding path program 1 times [2025-02-06 02:40:38,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:38,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131293605] [2025-02-06 02:40:38,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:38,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:38,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-02-06 02:40:38,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-02-06 02:40:38,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:38,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:39,754 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-02-06 02:40:39,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:39,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131293605] [2025-02-06 02:40:39,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131293605] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:40:39,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:40:39,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:40:39,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219191673] [2025-02-06 02:40:39,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:40:39,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:40:39,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:39,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:40:39,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:40:39,759 INFO L87 Difference]: Start difference. First operand 326 states and 532 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:40:39,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:39,885 INFO L93 Difference]: Finished difference Result 972 states and 1590 transitions. [2025-02-06 02:40:39,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:40:39,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 374 [2025-02-06 02:40:39,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:39,893 INFO L225 Difference]: With dead ends: 972 [2025-02-06 02:40:39,894 INFO L226 Difference]: Without dead ends: 649 [2025-02-06 02:40:39,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-06 02:40:39,896 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 383 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:39,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 853 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:40:39,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-02-06 02:40:39,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 647. [2025-02-06 02:40:39,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 542 states have (on average 1.5756457564575646) internal successors, (854), 542 states have internal predecessors, (854), 102 states have call successors, (102), 2 states have call predecessors, (102), 2 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-06 02:40:39,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1058 transitions. [2025-02-06 02:40:39,942 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1058 transitions. Word has length 374 [2025-02-06 02:40:39,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:39,943 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 1058 transitions. [2025-02-06 02:40:39,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:40:39,943 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1058 transitions. [2025-02-06 02:40:39,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-02-06 02:40:39,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:39,948 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:40:39,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:40:39,949 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:39,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:39,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1321516809, now seen corresponding path program 1 times [2025-02-06 02:40:39,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:39,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769367657] [2025-02-06 02:40:39,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:39,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:40,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-02-06 02:40:40,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-02-06 02:40:40,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:40,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:41,417 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-02-06 02:40:41,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:41,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769367657] [2025-02-06 02:40:41,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769367657] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:40:41,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:40:41,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:40:41,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903374171] [2025-02-06 02:40:41,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:40:41,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:40:41,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:41,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:40:41,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:40:41,421 INFO L87 Difference]: Start difference. First operand 647 states and 1058 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:40:42,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:42,020 INFO L93 Difference]: Finished difference Result 1840 states and 3014 transitions. [2025-02-06 02:40:42,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:40:42,022 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 374 [2025-02-06 02:40:42,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:42,029 INFO L225 Difference]: With dead ends: 1840 [2025-02-06 02:40:42,030 INFO L226 Difference]: Without dead ends: 1196 [2025-02-06 02:40:42,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:40:42,035 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 389 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1984 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:42,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1984 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:40:42,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2025-02-06 02:40:42,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 774. [2025-02-06 02:40:42,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 617 states have (on average 1.5559157212317667) internal successors, (960), 617 states have internal predecessors, (960), 153 states have call successors, (153), 3 states have call predecessors, (153), 3 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2025-02-06 02:40:42,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1266 transitions. [2025-02-06 02:40:42,128 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1266 transitions. Word has length 374 [2025-02-06 02:40:42,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:42,129 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 1266 transitions. [2025-02-06 02:40:42,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:40:42,129 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1266 transitions. [2025-02-06 02:40:42,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-02-06 02:40:42,134 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:42,135 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:40:42,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:40:42,135 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:42,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:42,136 INFO L85 PathProgramCache]: Analyzing trace with hash 864417238, now seen corresponding path program 1 times [2025-02-06 02:40:42,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:42,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397575551] [2025-02-06 02:40:42,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:42,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:42,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-02-06 02:40:42,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-02-06 02:40:42,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:42,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:43,109 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-02-06 02:40:43,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:43,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397575551] [2025-02-06 02:40:43,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397575551] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:40:43,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:40:43,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:40:43,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215660570] [2025-02-06 02:40:43,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:40:43,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:40:43,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:43,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:40:43,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:40:43,116 INFO L87 Difference]: Start difference. First operand 774 states and 1266 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:40:43,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:43,661 INFO L93 Difference]: Finished difference Result 2565 states and 4206 transitions. [2025-02-06 02:40:43,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:40:43,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 374 [2025-02-06 02:40:43,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:43,674 INFO L225 Difference]: With dead ends: 2565 [2025-02-06 02:40:43,674 INFO L226 Difference]: Without dead ends: 1884 [2025-02-06 02:40:43,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-06 02:40:43,678 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 713 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:43,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 1436 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:40:43,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2025-02-06 02:40:43,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1434. [2025-02-06 02:40:43,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1173 states have (on average 1.5643648763853368) internal successors, (1835), 1173 states have internal predecessors, (1835), 255 states have call successors, (255), 5 states have call predecessors, (255), 5 states have return successors, (255), 255 states have call predecessors, (255), 255 states have call successors, (255) [2025-02-06 02:40:43,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 2345 transitions. [2025-02-06 02:40:43,871 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 2345 transitions. Word has length 374 [2025-02-06 02:40:43,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:43,872 INFO L471 AbstractCegarLoop]: Abstraction has 1434 states and 2345 transitions. [2025-02-06 02:40:43,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:40:43,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 2345 transitions. [2025-02-06 02:40:43,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-02-06 02:40:43,880 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:43,880 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:40:43,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:40:43,880 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:43,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:43,881 INFO L85 PathProgramCache]: Analyzing trace with hash -2092762899, now seen corresponding path program 1 times [2025-02-06 02:40:43,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:43,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225351296] [2025-02-06 02:40:43,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:43,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:43,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-02-06 02:40:44,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-02-06 02:40:44,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:44,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:45,243 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-02-06 02:40:45,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:45,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225351296] [2025-02-06 02:40:45,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225351296] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:40:45,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:40:45,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:40:45,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162523991] [2025-02-06 02:40:45,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:40:45,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:40:45,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:45,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:40:45,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:40:45,247 INFO L87 Difference]: Start difference. First operand 1434 states and 2345 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:40:45,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:45,681 INFO L93 Difference]: Finished difference Result 3810 states and 6251 transitions. [2025-02-06 02:40:45,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:40:45,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 375 [2025-02-06 02:40:45,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:45,699 INFO L225 Difference]: With dead ends: 3810 [2025-02-06 02:40:45,699 INFO L226 Difference]: Without dead ends: 2472 [2025-02-06 02:40:45,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-06 02:40:45,705 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 442 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:45,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 1362 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:40:45,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2025-02-06 02:40:45,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 1606. [2025-02-06 02:40:45,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1345 states have (on average 1.5739776951672861) internal successors, (2117), 1345 states have internal predecessors, (2117), 255 states have call successors, (255), 5 states have call predecessors, (255), 5 states have return successors, (255), 255 states have call predecessors, (255), 255 states have call successors, (255) [2025-02-06 02:40:45,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 2627 transitions. [2025-02-06 02:40:45,891 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 2627 transitions. Word has length 375 [2025-02-06 02:40:45,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:45,892 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 2627 transitions. [2025-02-06 02:40:45,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:40:45,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 2627 transitions. [2025-02-06 02:40:45,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-02-06 02:40:45,901 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:45,901 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:40:45,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:40:45,902 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:45,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:45,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1785773781, now seen corresponding path program 1 times [2025-02-06 02:40:45,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:45,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138273078] [2025-02-06 02:40:45,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:45,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:45,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-02-06 02:40:46,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-02-06 02:40:46,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:46,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:47,221 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-02-06 02:40:47,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:47,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138273078] [2025-02-06 02:40:47,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138273078] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:40:47,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:40:47,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:40:47,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326623348] [2025-02-06 02:40:47,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:40:47,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:40:47,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:47,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:40:47,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:40:47,225 INFO L87 Difference]: Start difference. First operand 1606 states and 2627 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:40:47,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:47,495 INFO L93 Difference]: Finished difference Result 3922 states and 6375 transitions. [2025-02-06 02:40:47,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:40:47,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 376 [2025-02-06 02:40:47,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:47,516 INFO L225 Difference]: With dead ends: 3922 [2025-02-06 02:40:47,516 INFO L226 Difference]: Without dead ends: 2596 [2025-02-06 02:40:47,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:40:47,522 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 779 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:47,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 845 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:40:47,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2596 states. [2025-02-06 02:40:47,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2596 to 2358. [2025-02-06 02:40:47,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2358 states, 2093 states have (on average 1.6000955566172959) internal successors, (3349), 2093 states have internal predecessors, (3349), 255 states have call successors, (255), 9 states have call predecessors, (255), 9 states have return successors, (255), 255 states have call predecessors, (255), 255 states have call successors, (255) [2025-02-06 02:40:47,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2358 states to 2358 states and 3859 transitions. [2025-02-06 02:40:47,684 INFO L78 Accepts]: Start accepts. Automaton has 2358 states and 3859 transitions. Word has length 376 [2025-02-06 02:40:47,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:47,685 INFO L471 AbstractCegarLoop]: Abstraction has 2358 states and 3859 transitions. [2025-02-06 02:40:47,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:40:47,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2358 states and 3859 transitions. [2025-02-06 02:40:47,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-02-06 02:40:47,693 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:47,694 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:40:47,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:40:47,694 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:47,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:47,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1419653941, now seen corresponding path program 1 times [2025-02-06 02:40:47,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:47,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68756990] [2025-02-06 02:40:47,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:47,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:47,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-02-06 02:40:47,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-02-06 02:40:47,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:47,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:47,917 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-02-06 02:40:47,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:47,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68756990] [2025-02-06 02:40:47,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68756990] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:40:47,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:40:47,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:40:47,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129134993] [2025-02-06 02:40:47,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:40:47,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:40:47,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:47,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:40:47,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:40:47,921 INFO L87 Difference]: Start difference. First operand 2358 states and 3859 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:40:48,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:48,109 INFO L93 Difference]: Finished difference Result 5770 states and 9429 transitions. [2025-02-06 02:40:48,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:40:48,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 376 [2025-02-06 02:40:48,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:48,133 INFO L225 Difference]: With dead ends: 5770 [2025-02-06 02:40:48,133 INFO L226 Difference]: Without dead ends: 3780 [2025-02-06 02:40:48,140 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-06 02:40:48,141 INFO L435 NwaCegarLoop]: 634 mSDtfsCounter, 430 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:48,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 1057 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:40:48,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3780 states. [2025-02-06 02:40:48,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3780 to 2510. [2025-02-06 02:40:48,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2510 states, 2245 states have (on average 1.5844097995545656) internal successors, (3557), 2245 states have internal predecessors, (3557), 255 states have call successors, (255), 9 states have call predecessors, (255), 9 states have return successors, (255), 255 states have call predecessors, (255), 255 states have call successors, (255) [2025-02-06 02:40:48,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2510 states to 2510 states and 4067 transitions. [2025-02-06 02:40:48,295 INFO L78 Accepts]: Start accepts. Automaton has 2510 states and 4067 transitions. Word has length 376 [2025-02-06 02:40:48,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:48,296 INFO L471 AbstractCegarLoop]: Abstraction has 2510 states and 4067 transitions. [2025-02-06 02:40:48,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:40:48,296 INFO L276 IsEmpty]: Start isEmpty. Operand 2510 states and 4067 transitions. [2025-02-06 02:40:48,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-02-06 02:40:48,305 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:48,306 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:40:48,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:40:48,306 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:48,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:48,307 INFO L85 PathProgramCache]: Analyzing trace with hash 2113046646, now seen corresponding path program 1 times [2025-02-06 02:40:48,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:48,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842799387] [2025-02-06 02:40:48,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:48,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:48,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-02-06 02:40:48,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-02-06 02:40:48,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:48,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:49,780 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-02-06 02:40:49,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:49,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842799387] [2025-02-06 02:40:49,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842799387] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:40:49,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:40:49,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:40:49,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812515870] [2025-02-06 02:40:49,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:40:49,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:40:49,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:49,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:40:49,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:40:49,784 INFO L87 Difference]: Start difference. First operand 2510 states and 4067 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:40:50,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:50,593 INFO L93 Difference]: Finished difference Result 6214 states and 10135 transitions. [2025-02-06 02:40:50,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:40:50,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 376 [2025-02-06 02:40:50,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:50,617 INFO L225 Difference]: With dead ends: 6214 [2025-02-06 02:40:50,618 INFO L226 Difference]: Without dead ends: 4020 [2025-02-06 02:40:50,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:40:50,627 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 393 mSDsluCounter, 1151 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:50,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1579 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 02:40:50,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4020 states. [2025-02-06 02:40:50,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4020 to 2510. [2025-02-06 02:40:50,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2510 states, 2245 states have (on average 1.5835189309576838) internal successors, (3555), 2245 states have internal predecessors, (3555), 255 states have call successors, (255), 9 states have call predecessors, (255), 9 states have return successors, (255), 255 states have call predecessors, (255), 255 states have call successors, (255) [2025-02-06 02:40:50,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2510 states to 2510 states and 4065 transitions. [2025-02-06 02:40:50,806 INFO L78 Accepts]: Start accepts. Automaton has 2510 states and 4065 transitions. Word has length 376 [2025-02-06 02:40:50,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:50,806 INFO L471 AbstractCegarLoop]: Abstraction has 2510 states and 4065 transitions. [2025-02-06 02:40:50,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:40:50,807 INFO L276 IsEmpty]: Start isEmpty. Operand 2510 states and 4065 transitions. [2025-02-06 02:40:50,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-02-06 02:40:50,816 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:50,816 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:40:50,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:40:50,817 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:50,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:50,818 INFO L85 PathProgramCache]: Analyzing trace with hash -713601046, now seen corresponding path program 1 times [2025-02-06 02:40:50,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:50,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115713427] [2025-02-06 02:40:50,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:50,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:50,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-02-06 02:40:51,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-02-06 02:40:51,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:51,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:51,669 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-02-06 02:40:51,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:51,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115713427] [2025-02-06 02:40:51,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115713427] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:40:51,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:40:51,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:40:51,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653198830] [2025-02-06 02:40:51,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:40:51,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:40:51,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:51,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:40:51,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:40:51,671 INFO L87 Difference]: Start difference. First operand 2510 states and 4065 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:40:52,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:52,119 INFO L93 Difference]: Finished difference Result 6266 states and 10203 transitions. [2025-02-06 02:40:52,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:40:52,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 377 [2025-02-06 02:40:52,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:52,153 INFO L225 Difference]: With dead ends: 6266 [2025-02-06 02:40:52,153 INFO L226 Difference]: Without dead ends: 4284 [2025-02-06 02:40:52,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:40:52,161 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 809 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:52,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 919 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:40:52,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4284 states. [2025-02-06 02:40:52,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4284 to 3762. [2025-02-06 02:40:52,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3762 states, 3473 states have (on average 1.602936942124964) internal successors, (5567), 3477 states have internal predecessors, (5567), 271 states have call successors, (271), 17 states have call predecessors, (271), 17 states have return successors, (271), 267 states have call predecessors, (271), 271 states have call successors, (271) [2025-02-06 02:40:52,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3762 states to 3762 states and 6109 transitions. [2025-02-06 02:40:52,403 INFO L78 Accepts]: Start accepts. Automaton has 3762 states and 6109 transitions. Word has length 377 [2025-02-06 02:40:52,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:52,404 INFO L471 AbstractCegarLoop]: Abstraction has 3762 states and 6109 transitions. [2025-02-06 02:40:52,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:40:52,405 INFO L276 IsEmpty]: Start isEmpty. Operand 3762 states and 6109 transitions. [2025-02-06 02:40:52,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-02-06 02:40:52,415 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:52,416 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:40:52,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:40:52,416 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:52,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:52,417 INFO L85 PathProgramCache]: Analyzing trace with hash -61490711, now seen corresponding path program 1 times [2025-02-06 02:40:52,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:52,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218016099] [2025-02-06 02:40:52,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:52,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:52,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-02-06 02:40:52,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-02-06 02:40:52,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:52,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:53,218 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-02-06 02:40:53,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:53,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218016099] [2025-02-06 02:40:53,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218016099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:40:53,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:40:53,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:40:53,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601050040] [2025-02-06 02:40:53,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:40:53,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:40:53,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:53,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:40:53,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:40:53,221 INFO L87 Difference]: Start difference. First operand 3762 states and 6109 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:40:53,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:53,697 INFO L93 Difference]: Finished difference Result 11742 states and 18788 transitions. [2025-02-06 02:40:53,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:40:53,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 377 [2025-02-06 02:40:53,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:53,738 INFO L225 Difference]: With dead ends: 11742 [2025-02-06 02:40:53,738 INFO L226 Difference]: Without dead ends: 8136 [2025-02-06 02:40:53,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-06 02:40:53,750 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 1135 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1135 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:53,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1135 Valid, 1502 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:40:53,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8136 states. [2025-02-06 02:40:54,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8136 to 4098. [2025-02-06 02:40:54,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 3808 states have (on average 1.5824579831932772) internal successors, (6026), 3812 states have internal predecessors, (6026), 271 states have call successors, (271), 18 states have call predecessors, (271), 18 states have return successors, (271), 267 states have call predecessors, (271), 271 states have call successors, (271) [2025-02-06 02:40:54,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 6568 transitions. [2025-02-06 02:40:54,038 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 6568 transitions. Word has length 377 [2025-02-06 02:40:54,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:54,039 INFO L471 AbstractCegarLoop]: Abstraction has 4098 states and 6568 transitions. [2025-02-06 02:40:54,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:40:54,040 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 6568 transitions. [2025-02-06 02:40:54,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-02-06 02:40:54,048 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:54,048 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:40:54,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:40:54,049 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:54,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:54,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1460752107, now seen corresponding path program 1 times [2025-02-06 02:40:54,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:54,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232419205] [2025-02-06 02:40:54,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:54,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:54,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-02-06 02:40:54,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-02-06 02:40:54,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:54,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:55,097 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-02-06 02:40:55,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:55,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232419205] [2025-02-06 02:40:55,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232419205] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:40:55,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:40:55,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:40:55,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758160061] [2025-02-06 02:40:55,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:40:55,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:40:55,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:55,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:40:55,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:40:55,099 INFO L87 Difference]: Start difference. First operand 4098 states and 6568 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:40:55,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:55,575 INFO L93 Difference]: Finished difference Result 8972 states and 14293 transitions. [2025-02-06 02:40:55,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:40:55,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 377 [2025-02-06 02:40:55,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:55,594 INFO L225 Difference]: With dead ends: 8972 [2025-02-06 02:40:55,594 INFO L226 Difference]: Without dead ends: 5530 [2025-02-06 02:40:55,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-06 02:40:55,604 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 587 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 1381 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:55,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 1381 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:40:55,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5530 states. [2025-02-06 02:40:55,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5530 to 4106. [2025-02-06 02:40:55,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4106 states, 3816 states have (on average 1.5812368972746331) internal successors, (6034), 3820 states have internal predecessors, (6034), 271 states have call successors, (271), 18 states have call predecessors, (271), 18 states have return successors, (271), 267 states have call predecessors, (271), 271 states have call successors, (271) [2025-02-06 02:40:55,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4106 states to 4106 states and 6576 transitions. [2025-02-06 02:40:55,843 INFO L78 Accepts]: Start accepts. Automaton has 4106 states and 6576 transitions. Word has length 377 [2025-02-06 02:40:55,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:55,844 INFO L471 AbstractCegarLoop]: Abstraction has 4106 states and 6576 transitions. [2025-02-06 02:40:55,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:40:55,844 INFO L276 IsEmpty]: Start isEmpty. Operand 4106 states and 6576 transitions. [2025-02-06 02:40:55,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-02-06 02:40:55,852 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:55,853 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:40:55,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 02:40:55,853 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:55,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:55,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1764075246, now seen corresponding path program 1 times [2025-02-06 02:40:55,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:55,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49514690] [2025-02-06 02:40:55,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:55,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:55,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-02-06 02:40:55,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-02-06 02:40:55,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:55,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:56,021 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-02-06 02:40:56,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:56,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49514690] [2025-02-06 02:40:56,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49514690] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:40:56,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:40:56,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:40:56,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034877389] [2025-02-06 02:40:56,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:40:56,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:40:56,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:56,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:40:56,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:40:56,025 INFO L87 Difference]: Start difference. First operand 4106 states and 6576 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:40:56,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:56,243 INFO L93 Difference]: Finished difference Result 9078 states and 14628 transitions. [2025-02-06 02:40:56,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:40:56,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 377 [2025-02-06 02:40:56,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:56,262 INFO L225 Difference]: With dead ends: 9078 [2025-02-06 02:40:56,262 INFO L226 Difference]: Without dead ends: 5628 [2025-02-06 02:40:56,271 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-06 02:40:56,271 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 148 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:56,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 897 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:40:56,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5628 states. [2025-02-06 02:40:56,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5628 to 4530. [2025-02-06 02:40:56,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4530 states, 4240 states have (on average 1.5929245283018867) internal successors, (6754), 4244 states have internal predecessors, (6754), 271 states have call successors, (271), 18 states have call predecessors, (271), 18 states have return successors, (271), 267 states have call predecessors, (271), 271 states have call successors, (271) [2025-02-06 02:40:56,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4530 states to 4530 states and 7296 transitions. [2025-02-06 02:40:56,467 INFO L78 Accepts]: Start accepts. Automaton has 4530 states and 7296 transitions. Word has length 377 [2025-02-06 02:40:56,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:56,467 INFO L471 AbstractCegarLoop]: Abstraction has 4530 states and 7296 transitions. [2025-02-06 02:40:56,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:40:56,468 INFO L276 IsEmpty]: Start isEmpty. Operand 4530 states and 7296 transitions. [2025-02-06 02:40:56,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-02-06 02:40:56,476 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:56,477 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:40:56,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 02:40:56,478 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:56,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:56,480 INFO L85 PathProgramCache]: Analyzing trace with hash 767002893, now seen corresponding path program 1 times [2025-02-06 02:40:56,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:56,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145429460] [2025-02-06 02:40:56,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:56,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:56,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-02-06 02:40:56,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-02-06 02:40:56,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:56,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:57,448 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-02-06 02:40:57,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:57,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145429460] [2025-02-06 02:40:57,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145429460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:40:57,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:40:57,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:40:57,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331489799] [2025-02-06 02:40:57,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:40:57,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:40:57,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:57,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:40:57,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:40:57,451 INFO L87 Difference]: Start difference. First operand 4530 states and 7296 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:40:57,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:57,998 INFO L93 Difference]: Finished difference Result 11593 states and 18736 transitions. [2025-02-06 02:40:57,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:40:57,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 377 [2025-02-06 02:40:58,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:58,025 INFO L225 Difference]: With dead ends: 11593 [2025-02-06 02:40:58,025 INFO L226 Difference]: Without dead ends: 7719 [2025-02-06 02:40:58,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:40:58,034 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 716 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:58,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 1112 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:40:58,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7719 states. [2025-02-06 02:40:58,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7719 to 7023. [2025-02-06 02:40:58,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7023 states, 6733 states have (on average 1.6160701024803208) internal successors, (10881), 6737 states have internal predecessors, (10881), 271 states have call successors, (271), 18 states have call predecessors, (271), 18 states have return successors, (271), 267 states have call predecessors, (271), 271 states have call successors, (271) [2025-02-06 02:40:58,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7023 states to 7023 states and 11423 transitions. [2025-02-06 02:40:58,278 INFO L78 Accepts]: Start accepts. Automaton has 7023 states and 11423 transitions. Word has length 377 [2025-02-06 02:40:58,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:58,278 INFO L471 AbstractCegarLoop]: Abstraction has 7023 states and 11423 transitions. [2025-02-06 02:40:58,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:40:58,279 INFO L276 IsEmpty]: Start isEmpty. Operand 7023 states and 11423 transitions. [2025-02-06 02:40:58,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-02-06 02:40:58,293 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:58,293 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:40:58,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 02:40:58,293 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:58,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:58,294 INFO L85 PathProgramCache]: Analyzing trace with hash 2120312590, now seen corresponding path program 1 times [2025-02-06 02:40:58,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:58,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791388927] [2025-02-06 02:40:58,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:58,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:58,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-02-06 02:40:59,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-02-06 02:40:59,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:59,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:59,678 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2025-02-06 02:40:59,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:59,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791388927] [2025-02-06 02:40:59,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791388927] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:40:59,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586717661] [2025-02-06 02:40:59,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:59,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:40:59,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:40:59,681 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-06 02:40:59,683 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-06 02:40:59,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-02-06 02:41:00,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-02-06 02:41:00,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:00,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:00,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 02:41:00,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:41:00,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 2600 proven. 75 refuted. 0 times theorem prover too weak. 2425 trivial. 0 not checked. [2025-02-06 02:41:00,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:41:00,860 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 75 proven. 75 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2025-02-06 02:41:00,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586717661] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:41:00,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:41:00,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2025-02-06 02:41:00,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035167670] [2025-02-06 02:41:00,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:41:00,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 02:41:00,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:00,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 02:41:00,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:41:00,865 INFO L87 Difference]: Start difference. First operand 7023 states and 11423 transitions. Second operand has 11 states, 11 states have (on average 27.09090909090909) internal successors, (298), 11 states have internal predecessors, (298), 4 states have call successors, (126), 2 states have call predecessors, (126), 4 states have return successors, (128), 4 states have call predecessors, (128), 4 states have call successors, (128) [2025-02-06 02:41:02,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:02,499 INFO L93 Difference]: Finished difference Result 17609 states and 28695 transitions. [2025-02-06 02:41:02,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 02:41:02,500 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 27.09090909090909) internal successors, (298), 11 states have internal predecessors, (298), 4 states have call successors, (126), 2 states have call predecessors, (126), 4 states have return successors, (128), 4 states have call predecessors, (128), 4 states have call successors, (128) Word has length 377 [2025-02-06 02:41:02,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:02,536 INFO L225 Difference]: With dead ends: 17609 [2025-02-06 02:41:02,536 INFO L226 Difference]: Without dead ends: 11655 [2025-02-06 02:41:02,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 777 GetRequests, 750 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=581, Unknown=0, NotChecked=0, Total=812 [2025-02-06 02:41:02,553 INFO L435 NwaCegarLoop]: 659 mSDtfsCounter, 1217 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1218 SdHoareTripleChecker+Valid, 2421 SdHoareTripleChecker+Invalid, 1356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:02,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1218 Valid, 2421 Invalid, 1356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 02:41:02,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11655 states. [2025-02-06 02:41:02,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11655 to 9485. [2025-02-06 02:41:02,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9485 states, 9181 states have (on average 1.595795664960244) internal successors, (14651), 9185 states have internal predecessors, (14651), 271 states have call successors, (271), 32 states have call predecessors, (271), 32 states have return successors, (271), 267 states have call predecessors, (271), 271 states have call successors, (271) [2025-02-06 02:41:02,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9485 states to 9485 states and 15193 transitions. [2025-02-06 02:41:02,973 INFO L78 Accepts]: Start accepts. Automaton has 9485 states and 15193 transitions. Word has length 377 [2025-02-06 02:41:02,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:02,974 INFO L471 AbstractCegarLoop]: Abstraction has 9485 states and 15193 transitions. [2025-02-06 02:41:02,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 27.09090909090909) internal successors, (298), 11 states have internal predecessors, (298), 4 states have call successors, (126), 2 states have call predecessors, (126), 4 states have return successors, (128), 4 states have call predecessors, (128), 4 states have call successors, (128) [2025-02-06 02:41:02,974 INFO L276 IsEmpty]: Start isEmpty. Operand 9485 states and 15193 transitions. [2025-02-06 02:41:02,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-02-06 02:41:02,993 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:02,993 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:41:03,004 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-06 02:41:03,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-06 02:41:03,198 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:03,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:03,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1237605188, now seen corresponding path program 1 times [2025-02-06 02:41:03,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:03,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894698711] [2025-02-06 02:41:03,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:03,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:03,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-02-06 02:41:03,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-02-06 02:41:03,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:03,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:04,419 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-02-06 02:41:04,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:04,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894698711] [2025-02-06 02:41:04,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894698711] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:04,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:04,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 02:41:04,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125839210] [2025-02-06 02:41:04,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:04,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 02:41:04,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:04,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 02:41:04,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:41:04,424 INFO L87 Difference]: Start difference. First operand 9485 states and 15193 transitions. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:41:05,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:05,151 INFO L93 Difference]: Finished difference Result 26460 states and 42241 transitions. [2025-02-06 02:41:05,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 02:41:05,152 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 378 [2025-02-06 02:41:05,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:05,191 INFO L225 Difference]: With dead ends: 26460 [2025-02-06 02:41:05,191 INFO L226 Difference]: Without dead ends: 17399 [2025-02-06 02:41:05,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:41:05,202 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 953 mSDsluCounter, 1757 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 2411 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:05,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [953 Valid, 2411 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:41:05,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17399 states. [2025-02-06 02:41:05,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17399 to 12861. [2025-02-06 02:41:05,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12861 states, 12513 states have (on average 1.5824342683609047) internal successors, (19801), 12521 states have internal predecessors, (19801), 301 states have call successors, (301), 46 states have call predecessors, (301), 46 states have return successors, (301), 293 states have call predecessors, (301), 301 states have call successors, (301) [2025-02-06 02:41:05,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12861 states to 12861 states and 20403 transitions. [2025-02-06 02:41:05,676 INFO L78 Accepts]: Start accepts. Automaton has 12861 states and 20403 transitions. Word has length 378 [2025-02-06 02:41:05,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:05,677 INFO L471 AbstractCegarLoop]: Abstraction has 12861 states and 20403 transitions. [2025-02-06 02:41:05,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:41:05,677 INFO L276 IsEmpty]: Start isEmpty. Operand 12861 states and 20403 transitions. [2025-02-06 02:41:05,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-02-06 02:41:05,706 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:05,707 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:41:05,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 02:41:05,707 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:05,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:05,708 INFO L85 PathProgramCache]: Analyzing trace with hash 212911267, now seen corresponding path program 1 times [2025-02-06 02:41:05,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:05,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437215879] [2025-02-06 02:41:05,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:05,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:05,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-02-06 02:41:06,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-02-06 02:41:06,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:06,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:06,813 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-02-06 02:41:06,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:06,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437215879] [2025-02-06 02:41:06,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437215879] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:06,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:06,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 02:41:06,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726370033] [2025-02-06 02:41:06,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:06,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:41:06,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:06,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:41:06,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:41:06,815 INFO L87 Difference]: Start difference. First operand 12861 states and 20403 transitions. Second operand has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:41:12,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:12,130 INFO L93 Difference]: Finished difference Result 102766 states and 163162 transitions. [2025-02-06 02:41:12,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 02:41:12,131 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 378 [2025-02-06 02:41:12,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:12,397 INFO L225 Difference]: With dead ends: 102766 [2025-02-06 02:41:12,397 INFO L226 Difference]: Without dead ends: 91190 [2025-02-06 02:41:12,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2025-02-06 02:41:12,441 INFO L435 NwaCegarLoop]: 1968 mSDtfsCounter, 4117 mSDsluCounter, 6684 mSDsCounter, 0 mSdLazyCounter, 2874 mSolverCounterSat, 940 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4117 SdHoareTripleChecker+Valid, 8652 SdHoareTripleChecker+Invalid, 3814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 940 IncrementalHoareTripleChecker+Valid, 2874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:12,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4117 Valid, 8652 Invalid, 3814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [940 Valid, 2874 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-02-06 02:41:12,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91190 states. [2025-02-06 02:41:13,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91190 to 42244. [2025-02-06 02:41:13,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42244 states, 41015 states have (on average 1.5768377422894062) internal successors, (64674), 41051 states have internal predecessors, (64674), 1047 states have call successors, (1047), 181 states have call predecessors, (1047), 181 states have return successors, (1047), 1011 states have call predecessors, (1047), 1047 states have call successors, (1047) [2025-02-06 02:41:13,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42244 states to 42244 states and 66768 transitions. [2025-02-06 02:41:13,986 INFO L78 Accepts]: Start accepts. Automaton has 42244 states and 66768 transitions. Word has length 378 [2025-02-06 02:41:13,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:13,987 INFO L471 AbstractCegarLoop]: Abstraction has 42244 states and 66768 transitions. [2025-02-06 02:41:13,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:41:13,987 INFO L276 IsEmpty]: Start isEmpty. Operand 42244 states and 66768 transitions. [2025-02-06 02:41:14,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-02-06 02:41:14,181 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:14,181 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:41:14,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 02:41:14,182 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:14,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:14,182 INFO L85 PathProgramCache]: Analyzing trace with hash -2011681437, now seen corresponding path program 1 times [2025-02-06 02:41:14,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:14,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16452205] [2025-02-06 02:41:14,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:14,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:14,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-02-06 02:41:14,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-02-06 02:41:14,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:14,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:14,418 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-02-06 02:41:14,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:14,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16452205] [2025-02-06 02:41:14,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16452205] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:14,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:14,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:41:14,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864406397] [2025-02-06 02:41:14,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:14,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:41:14,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:14,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:41:14,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:14,421 INFO L87 Difference]: Start difference. First operand 42244 states and 66768 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:41:15,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:15,390 INFO L93 Difference]: Finished difference Result 81754 states and 129203 transitions. [2025-02-06 02:41:15,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:41:15,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 378 [2025-02-06 02:41:15,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:15,498 INFO L225 Difference]: With dead ends: 81754 [2025-02-06 02:41:15,498 INFO L226 Difference]: Without dead ends: 40315 [2025-02-06 02:41:15,541 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-06 02:41:15,541 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 310 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:15,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 943 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:41:15,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40315 states. [2025-02-06 02:41:16,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40315 to 38282. [2025-02-06 02:41:16,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38282 states, 37172 states have (on average 1.5754600236737328) internal successors, (58563), 37196 states have internal predecessors, (58563), 957 states have call successors, (957), 152 states have call predecessors, (957), 152 states have return successors, (957), 933 states have call predecessors, (957), 957 states have call successors, (957) [2025-02-06 02:41:16,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38282 states to 38282 states and 60477 transitions. [2025-02-06 02:41:16,727 INFO L78 Accepts]: Start accepts. Automaton has 38282 states and 60477 transitions. Word has length 378 [2025-02-06 02:41:16,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:16,728 INFO L471 AbstractCegarLoop]: Abstraction has 38282 states and 60477 transitions. [2025-02-06 02:41:16,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:41:16,728 INFO L276 IsEmpty]: Start isEmpty. Operand 38282 states and 60477 transitions. [2025-02-06 02:41:16,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-02-06 02:41:16,758 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:16,759 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:41:16,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 02:41:16,759 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:16,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:16,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1637466211, now seen corresponding path program 1 times [2025-02-06 02:41:16,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:16,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026174792] [2025-02-06 02:41:16,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:16,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:16,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-02-06 02:41:17,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-02-06 02:41:17,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:17,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:17,646 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-02-06 02:41:17,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:17,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026174792] [2025-02-06 02:41:17,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026174792] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:17,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:17,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:41:17,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171838890] [2025-02-06 02:41:17,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:17,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:41:17,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:17,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:41:17,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:41:17,648 INFO L87 Difference]: Start difference. First operand 38282 states and 60477 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:41:18,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:18,545 INFO L93 Difference]: Finished difference Result 68673 states and 108486 transitions. [2025-02-06 02:41:18,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:41:18,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 378 [2025-02-06 02:41:18,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:18,662 INFO L225 Difference]: With dead ends: 68673 [2025-02-06 02:41:18,662 INFO L226 Difference]: Without dead ends: 44688 [2025-02-06 02:41:18,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-06 02:41:18,698 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 662 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 1455 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:18,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 1455 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:41:18,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44688 states. [2025-02-06 02:41:19,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44688 to 38312. [2025-02-06 02:41:19,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38312 states, 37202 states have (on average 1.574995967958712) internal successors, (58593), 37226 states have internal predecessors, (58593), 957 states have call successors, (957), 152 states have call predecessors, (957), 152 states have return successors, (957), 933 states have call predecessors, (957), 957 states have call successors, (957) [2025-02-06 02:41:19,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38312 states to 38312 states and 60507 transitions. [2025-02-06 02:41:20,006 INFO L78 Accepts]: Start accepts. Automaton has 38312 states and 60507 transitions. Word has length 378 [2025-02-06 02:41:20,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:20,007 INFO L471 AbstractCegarLoop]: Abstraction has 38312 states and 60507 transitions. [2025-02-06 02:41:20,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-02-06 02:41:20,008 INFO L276 IsEmpty]: Start isEmpty. Operand 38312 states and 60507 transitions. [2025-02-06 02:41:20,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-02-06 02:41:20,048 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:20,048 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:41:20,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 02:41:20,049 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:20,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:20,049 INFO L85 PathProgramCache]: Analyzing trace with hash -526934674, now seen corresponding path program 1 times [2025-02-06 02:41:20,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:20,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895861752] [2025-02-06 02:41:20,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:20,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:20,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-02-06 02:41:20,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-02-06 02:41:20,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:20,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:24,072 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-02-06 02:41:24,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:24,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895861752] [2025-02-06 02:41:24,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895861752] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:24,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:24,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 02:41:24,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860496508] [2025-02-06 02:41:24,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:24,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 02:41:24,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:24,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 02:41:24,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-06 02:41:24,078 INFO L87 Difference]: Start difference. First operand 38312 states and 60507 transitions. Second operand has 12 states, 12 states have (on average 10.5) internal successors, (126), 12 states have internal predecessors, (126), 2 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2025-02-06 02:41:30,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:30,954 INFO L93 Difference]: Finished difference Result 183226 states and 288796 transitions. [2025-02-06 02:41:30,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 02:41:30,955 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.5) internal successors, (126), 12 states have internal predecessors, (126), 2 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) Word has length 378 [2025-02-06 02:41:30,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:31,339 INFO L225 Difference]: With dead ends: 183226 [2025-02-06 02:41:31,339 INFO L226 Difference]: Without dead ends: 159211 [2025-02-06 02:41:31,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2025-02-06 02:41:31,423 INFO L435 NwaCegarLoop]: 1325 mSDtfsCounter, 3649 mSDsluCounter, 4823 mSDsCounter, 0 mSdLazyCounter, 3232 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3649 SdHoareTripleChecker+Valid, 6148 SdHoareTripleChecker+Invalid, 3746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 3232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:31,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3649 Valid, 6148 Invalid, 3746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [514 Valid, 3232 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-02-06 02:41:31,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159211 states.