./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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-17.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 6298bb907161662c84076065ae45708309889771194b2faa54ace396b7a9c34e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:43:53,716 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:43:53,763 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:43:53,767 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:43:53,767 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:43:53,785 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:43:53,786 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:43:53,786 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:43:53,786 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:43:53,787 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:43:53,787 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:43:53,787 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:43:53,787 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:43:53,788 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:43:53,788 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:43:53,788 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:43:53,789 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:43:53,789 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:43:53,789 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:43:53,789 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:43:53,789 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:43:53,789 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:43:53,789 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:43:53,789 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:43:53,789 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:43:53,789 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:43:53,789 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:43:53,790 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:43:53,790 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:43:53,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:43:53,790 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:43:53,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:43:53,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:43:53,790 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:43:53,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:43:53,790 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:43:53,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:43:53,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:43:53,790 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:43:53,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:43:53,790 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:43:53,790 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:43:53,790 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:43:53,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:43:53,790 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:43:53,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:43:53,791 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:43:53,791 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:43:53,791 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 -> 6298bb907161662c84076065ae45708309889771194b2faa54ace396b7a9c34e [2025-01-09 14:43:54,023 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:43:54,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:43:54,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:43:54,036 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:43:54,036 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:43:54,037 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-17.i [2025-01-09 14:43:55,163 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ea34f5b2b/030eff53c1ef43feab5f85cd3a24514c/FLAG514beeca8 [2025-01-09 14:43:55,452 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:43:55,453 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-17.i [2025-01-09 14:43:55,463 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ea34f5b2b/030eff53c1ef43feab5f85cd3a24514c/FLAG514beeca8 [2025-01-09 14:43:55,722 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ea34f5b2b/030eff53c1ef43feab5f85cd3a24514c [2025-01-09 14:43:55,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:43:55,726 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:43:55,728 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:43:55,728 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:43:55,731 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:43:55,735 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:43:55" (1/1) ... [2025-01-09 14:43:55,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34bc52da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:55, skipping insertion in model container [2025-01-09 14:43:55,739 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:43:55" (1/1) ... [2025-01-09 14:43:55,774 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:43:55,876 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-17.i[916,929] [2025-01-09 14:43:56,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:43:56,048 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:43:56,065 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-17.i[916,929] [2025-01-09 14:43:56,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:43:56,177 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:43:56,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:56 WrapperNode [2025-01-09 14:43:56,178 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:43:56,179 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:43:56,179 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:43:56,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:43:56,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:56" (1/1) ... [2025-01-09 14:43:56,208 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:56" (1/1) ... [2025-01-09 14:43:56,286 INFO L138 Inliner]: procedures = 26, calls = 82, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 795 [2025-01-09 14:43:56,287 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:43:56,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:43:56,288 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:43:56,289 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:43:56,295 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:56" (1/1) ... [2025-01-09 14:43:56,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:56" (1/1) ... [2025-01-09 14:43:56,313 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:56" (1/1) ... [2025-01-09 14:43:56,398 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-01-09 14:43:56,398 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:56" (1/1) ... [2025-01-09 14:43:56,399 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:56" (1/1) ... [2025-01-09 14:43:56,436 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:56" (1/1) ... [2025-01-09 14:43:56,443 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:56" (1/1) ... [2025-01-09 14:43:56,452 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:56" (1/1) ... [2025-01-09 14:43:56,459 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:56" (1/1) ... [2025-01-09 14:43:56,466 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:56" (1/1) ... [2025-01-09 14:43:56,478 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:43:56,479 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:43:56,479 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:43:56,479 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:43:56,480 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:56" (1/1) ... [2025-01-09 14:43:56,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:43:56,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:43:56,506 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-01-09 14:43:56,509 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-01-09 14:43:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:43:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:43:56,525 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:43:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:43:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:43:56,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:43:56,637 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:43:56,638 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:43:57,706 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2025-01-09 14:43:57,706 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:43:57,717 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:43:57,717 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:43:57,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:43:57 BoogieIcfgContainer [2025-01-09 14:43:57,718 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:43:57,719 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:43:57,719 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:43:57,726 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:43:57,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:43:55" (1/3) ... [2025-01-09 14:43:57,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b8f415c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:43:57, skipping insertion in model container [2025-01-09 14:43:57,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:43:56" (2/3) ... [2025-01-09 14:43:57,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b8f415c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:43:57, skipping insertion in model container [2025-01-09 14:43:57,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:43:57" (3/3) ... [2025-01-09 14:43:57,728 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-17.i [2025-01-09 14:43:57,738 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:43:57,740 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-17.i that has 2 procedures, 307 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:43:57,780 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:43:57,788 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;@3c516f89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:43:57,788 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:43:57,792 INFO L276 IsEmpty]: Start isEmpty. Operand has 307 states, 235 states have (on average 1.5148936170212766) internal successors, (356), 236 states have internal predecessors, (356), 69 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 14:43:57,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-01-09 14:43:57,806 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:57,807 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:43:57,807 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:57,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:57,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1756912656, now seen corresponding path program 1 times [2025-01-09 14:43:57,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:57,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409617978] [2025-01-09 14:43:57,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:57,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:57,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-01-09 14:43:57,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-01-09 14:43:57,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:57,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:58,435 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 9248 trivial. 0 not checked. [2025-01-09 14:43:58,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:58,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409617978] [2025-01-09 14:43:58,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409617978] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:43:58,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34634333] [2025-01-09 14:43:58,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:58,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:43:58,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:43:58,443 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-01-09 14:43:58,451 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-01-09 14:43:58,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-01-09 14:43:58,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-01-09 14:43:58,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:58,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:58,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 1282 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:43:58,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:43:58,856 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 9248 trivial. 0 not checked. [2025-01-09 14:43:58,856 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:43:58,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34634333] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:43:58,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:43:58,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:43:58,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481346725] [2025-01-09 14:43:58,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:43:58,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:43:58,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:58,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:43:58,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:43:58,878 INFO L87 Difference]: Start difference. First operand has 307 states, 235 states have (on average 1.5148936170212766) internal successors, (356), 236 states have internal predecessors, (356), 69 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) Second operand has 2 states, 2 states have (on average 77.0) internal successors, (154), 2 states have internal predecessors, (154), 2 states have call successors, (69), 2 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 2 states have call successors, (69) [2025-01-09 14:43:58,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:58,916 INFO L93 Difference]: Finished difference Result 608 states and 1052 transitions. [2025-01-09 14:43:58,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:43:58,917 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 77.0) internal successors, (154), 2 states have internal predecessors, (154), 2 states have call successors, (69), 2 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 2 states have call successors, (69) Word has length 494 [2025-01-09 14:43:58,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:58,923 INFO L225 Difference]: With dead ends: 608 [2025-01-09 14:43:58,924 INFO L226 Difference]: Without dead ends: 304 [2025-01-09 14:43:58,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 495 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-01-09 14:43:58,929 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:58,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:43:58,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-01-09 14:43:58,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2025-01-09 14:43:58,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 233 states have (on average 1.502145922746781) internal successors, (350), 233 states have internal predecessors, (350), 69 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 14:43:58,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 488 transitions. [2025-01-09 14:43:58,985 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 488 transitions. Word has length 494 [2025-01-09 14:43:58,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:43:58,985 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 488 transitions. [2025-01-09 14:43:58,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 77.0) internal successors, (154), 2 states have internal predecessors, (154), 2 states have call successors, (69), 2 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 2 states have call successors, (69) [2025-01-09 14:43:58,987 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 488 transitions. [2025-01-09 14:43:58,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-01-09 14:43:58,998 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:58,998 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:43:59,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:43:59,199 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-01-09 14:43:59,200 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:59,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:59,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1966388262, now seen corresponding path program 1 times [2025-01-09 14:43:59,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:43:59,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410077237] [2025-01-09 14:43:59,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:59,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:43:59,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-01-09 14:43:59,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-01-09 14:43:59,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:59,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:59,836 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 14:43:59,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:43:59,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410077237] [2025-01-09 14:43:59,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410077237] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:43:59,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:43:59,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:43:59,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932400380] [2025-01-09 14:43:59,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:43:59,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:43:59,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:43:59,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:43:59,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:43:59,841 INFO L87 Difference]: Start difference. First operand 304 states and 488 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:43:59,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:59,946 INFO L93 Difference]: Finished difference Result 904 states and 1454 transitions. [2025-01-09 14:43:59,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:43:59,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 494 [2025-01-09 14:43:59,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:59,954 INFO L225 Difference]: With dead ends: 904 [2025-01-09 14:43:59,954 INFO L226 Difference]: Without dead ends: 603 [2025-01-09 14:43:59,956 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-01-09 14:43:59,958 INFO L435 NwaCegarLoop]: 717 mSDtfsCounter, 467 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:59,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1194 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:43:59,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-01-09 14:43:59,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 318. [2025-01-09 14:43:59,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 247 states have (on average 1.5060728744939271) internal successors, (372), 247 states have internal predecessors, (372), 69 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 14:43:59,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 510 transitions. [2025-01-09 14:44:00,001 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 510 transitions. Word has length 494 [2025-01-09 14:44:00,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:00,005 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 510 transitions. [2025-01-09 14:44:00,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:00,005 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 510 transitions. [2025-01-09 14:44:00,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-01-09 14:44:00,013 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:00,013 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:44:00,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:44:00,014 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:00,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:00,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1374638876, now seen corresponding path program 1 times [2025-01-09 14:44:00,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:00,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804146171] [2025-01-09 14:44:00,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:00,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:00,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-01-09 14:44:00,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-01-09 14:44:00,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:00,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:00,377 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 14:44:00,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:00,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804146171] [2025-01-09 14:44:00,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804146171] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:00,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:00,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:44:00,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125588081] [2025-01-09 14:44:00,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:00,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:44:00,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:00,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:44:00,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:44:00,379 INFO L87 Difference]: Start difference. First operand 318 states and 510 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:00,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:00,484 INFO L93 Difference]: Finished difference Result 829 states and 1330 transitions. [2025-01-09 14:44:00,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:44:00,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 494 [2025-01-09 14:44:00,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:00,491 INFO L225 Difference]: With dead ends: 829 [2025-01-09 14:44:00,491 INFO L226 Difference]: Without dead ends: 514 [2025-01-09 14:44:00,492 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-01-09 14:44:00,493 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 249 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:00,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 1144 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:44:00,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-01-09 14:44:00,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 511. [2025-01-09 14:44:00,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 437 states have (on average 1.5491990846681922) internal successors, (677), 438 states have internal predecessors, (677), 71 states have call successors, (71), 2 states have call predecessors, (71), 2 states have return successors, (71), 70 states have call predecessors, (71), 71 states have call successors, (71) [2025-01-09 14:44:00,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 819 transitions. [2025-01-09 14:44:00,524 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 819 transitions. Word has length 494 [2025-01-09 14:44:00,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:00,527 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 819 transitions. [2025-01-09 14:44:00,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:00,527 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 819 transitions. [2025-01-09 14:44:00,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-01-09 14:44:00,534 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:00,535 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:44:00,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:44:00,535 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:00,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:00,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1652698716, now seen corresponding path program 1 times [2025-01-09 14:44:00,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:00,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852793928] [2025-01-09 14:44:00,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:00,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:00,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-01-09 14:44:00,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-01-09 14:44:00,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:00,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:00,805 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 14:44:00,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:00,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852793928] [2025-01-09 14:44:00,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852793928] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:00,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:00,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:44:00,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981205813] [2025-01-09 14:44:00,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:00,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:44:00,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:00,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:44:00,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:44:00,809 INFO L87 Difference]: Start difference. First operand 511 states and 819 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:00,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:00,839 INFO L93 Difference]: Finished difference Result 1021 states and 1639 transitions. [2025-01-09 14:44:00,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:44:00,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 494 [2025-01-09 14:44:00,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:00,846 INFO L225 Difference]: With dead ends: 1021 [2025-01-09 14:44:00,846 INFO L226 Difference]: Without dead ends: 513 [2025-01-09 14:44:00,847 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-01-09 14:44:00,847 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 0 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:00,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 967 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:44:00,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-01-09 14:44:00,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2025-01-09 14:44:00,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 439 states have (on average 1.5466970387243735) internal successors, (679), 440 states have internal predecessors, (679), 71 states have call successors, (71), 2 states have call predecessors, (71), 2 states have return successors, (71), 70 states have call predecessors, (71), 71 states have call successors, (71) [2025-01-09 14:44:00,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 821 transitions. [2025-01-09 14:44:00,884 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 821 transitions. Word has length 494 [2025-01-09 14:44:00,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:00,885 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 821 transitions. [2025-01-09 14:44:00,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:00,886 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 821 transitions. [2025-01-09 14:44:00,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2025-01-09 14:44:00,891 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:00,891 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:44:00,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:44:00,892 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:00,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:00,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1016111772, now seen corresponding path program 1 times [2025-01-09 14:44:00,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:00,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834792041] [2025-01-09 14:44:00,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:00,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:00,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 495 statements into 1 equivalence classes. [2025-01-09 14:44:01,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 495 of 495 statements. [2025-01-09 14:44:01,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:01,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:01,620 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 14:44:01,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:01,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834792041] [2025-01-09 14:44:01,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834792041] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:01,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:01,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:44:01,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439045710] [2025-01-09 14:44:01,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:01,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:44:01,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:01,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:44:01,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:44:01,623 INFO L87 Difference]: Start difference. First operand 513 states and 821 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:01,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:01,942 INFO L93 Difference]: Finished difference Result 1527 states and 2450 transitions. [2025-01-09 14:44:01,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:44:01,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 495 [2025-01-09 14:44:01,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:01,948 INFO L225 Difference]: With dead ends: 1527 [2025-01-09 14:44:01,948 INFO L226 Difference]: Without dead ends: 1017 [2025-01-09 14:44:01,949 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-01-09 14:44:01,950 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 416 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:01,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 1435 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:44:01,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2025-01-09 14:44:02,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 656. [2025-01-09 14:44:02,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 512 states have (on average 1.501953125) internal successors, (769), 513 states have internal predecessors, (769), 140 states have call successors, (140), 3 states have call predecessors, (140), 3 states have return successors, (140), 139 states have call predecessors, (140), 140 states have call successors, (140) [2025-01-09 14:44:02,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1049 transitions. [2025-01-09 14:44:02,053 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1049 transitions. Word has length 495 [2025-01-09 14:44:02,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:02,053 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 1049 transitions. [2025-01-09 14:44:02,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:02,055 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1049 transitions. [2025-01-09 14:44:02,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2025-01-09 14:44:02,061 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:02,061 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:44:02,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:44:02,061 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:02,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:02,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1044612062, now seen corresponding path program 1 times [2025-01-09 14:44:02,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:02,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413913414] [2025-01-09 14:44:02,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:02,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:02,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 495 statements into 1 equivalence classes. [2025-01-09 14:44:02,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 495 of 495 statements. [2025-01-09 14:44:02,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:02,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:02,614 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 14:44:02,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:02,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413913414] [2025-01-09 14:44:02,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413913414] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:02,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:02,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:44:02,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259325323] [2025-01-09 14:44:02,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:02,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:44:02,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:02,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:44:02,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:44:02,618 INFO L87 Difference]: Start difference. First operand 656 states and 1049 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:02,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:02,957 INFO L93 Difference]: Finished difference Result 1899 states and 3042 transitions. [2025-01-09 14:44:02,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:44:02,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 495 [2025-01-09 14:44:02,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:02,964 INFO L225 Difference]: With dead ends: 1899 [2025-01-09 14:44:02,964 INFO L226 Difference]: Without dead ends: 1370 [2025-01-09 14:44:02,966 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-01-09 14:44:02,966 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 644 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 1567 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:02,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 1567 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:44:02,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2025-01-09 14:44:03,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1308. [2025-01-09 14:44:03,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1308 states, 1091 states have (on average 1.53987167736022) internal successors, (1680), 1093 states have internal predecessors, (1680), 211 states have call successors, (211), 5 states have call predecessors, (211), 5 states have return successors, (211), 209 states have call predecessors, (211), 211 states have call successors, (211) [2025-01-09 14:44:03,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 2102 transitions. [2025-01-09 14:44:03,061 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 2102 transitions. Word has length 495 [2025-01-09 14:44:03,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:03,062 INFO L471 AbstractCegarLoop]: Abstraction has 1308 states and 2102 transitions. [2025-01-09 14:44:03,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:03,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 2102 transitions. [2025-01-09 14:44:03,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-01-09 14:44:03,067 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:03,067 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:44:03,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:44:03,067 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:03,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:03,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1244754072, now seen corresponding path program 1 times [2025-01-09 14:44:03,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:03,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540783592] [2025-01-09 14:44:03,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:03,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:03,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-01-09 14:44:03,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-01-09 14:44:03,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:03,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:03,608 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 14:44:03,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:03,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540783592] [2025-01-09 14:44:03,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540783592] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:03,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:03,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:44:03,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860961488] [2025-01-09 14:44:03,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:03,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:44:03,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:03,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:44:03,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:44:03,610 INFO L87 Difference]: Start difference. First operand 1308 states and 2102 transitions. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:03,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:03,934 INFO L93 Difference]: Finished difference Result 4142 states and 6580 transitions. [2025-01-09 14:44:03,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:44:03,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 496 [2025-01-09 14:44:03,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:03,948 INFO L225 Difference]: With dead ends: 4142 [2025-01-09 14:44:03,948 INFO L226 Difference]: Without dead ends: 2970 [2025-01-09 14:44:03,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:44:03,952 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 707 mSDsluCounter, 1583 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 2140 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:03,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 2140 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:44:03,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2970 states. [2025-01-09 14:44:04,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 1844. [2025-01-09 14:44:04,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1844 states, 1481 states have (on average 1.4821066846725186) internal successors, (2195), 1485 states have internal predecessors, (2195), 353 states have call successors, (353), 9 states have call predecessors, (353), 9 states have return successors, (353), 349 states have call predecessors, (353), 353 states have call successors, (353) [2025-01-09 14:44:04,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 2901 transitions. [2025-01-09 14:44:04,048 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 2901 transitions. Word has length 496 [2025-01-09 14:44:04,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:04,073 INFO L471 AbstractCegarLoop]: Abstraction has 1844 states and 2901 transitions. [2025-01-09 14:44:04,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:04,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 2901 transitions. [2025-01-09 14:44:04,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-01-09 14:44:04,076 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:04,077 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:44:04,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:44:04,077 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:04,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:04,078 INFO L85 PathProgramCache]: Analyzing trace with hash 66138008, now seen corresponding path program 1 times [2025-01-09 14:44:04,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:04,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879365226] [2025-01-09 14:44:04,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:04,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:04,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-01-09 14:44:04,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-01-09 14:44:04,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:04,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:04,769 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 14:44:04,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:04,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879365226] [2025-01-09 14:44:04,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879365226] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:04,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:04,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:44:04,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714618590] [2025-01-09 14:44:04,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:04,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:44:04,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:04,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:44:04,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:44:04,771 INFO L87 Difference]: Start difference. First operand 1844 states and 2901 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:04,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:04,849 INFO L93 Difference]: Finished difference Result 3540 states and 5572 transitions. [2025-01-09 14:44:04,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:44:04,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 496 [2025-01-09 14:44:04,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:04,860 INFO L225 Difference]: With dead ends: 3540 [2025-01-09 14:44:04,860 INFO L226 Difference]: Without dead ends: 1838 [2025-01-09 14:44:04,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-01-09 14:44:04,865 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 0 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:04,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 965 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:44:04,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2025-01-09 14:44:04,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2025-01-09 14:44:04,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1475 states have (on average 1.4759322033898306) internal successors, (2177), 1479 states have internal predecessors, (2177), 353 states have call successors, (353), 9 states have call predecessors, (353), 9 states have return successors, (353), 349 states have call predecessors, (353), 353 states have call successors, (353) [2025-01-09 14:44:04,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2883 transitions. [2025-01-09 14:44:04,986 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2883 transitions. Word has length 496 [2025-01-09 14:44:04,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:04,987 INFO L471 AbstractCegarLoop]: Abstraction has 1838 states and 2883 transitions. [2025-01-09 14:44:04,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:04,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2883 transitions. [2025-01-09 14:44:04,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-01-09 14:44:04,993 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:04,993 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:44:04,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:44:04,994 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:04,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:04,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1541656424, now seen corresponding path program 1 times [2025-01-09 14:44:04,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:04,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392557760] [2025-01-09 14:44:04,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:04,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:05,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-01-09 14:44:05,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-01-09 14:44:05,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:05,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:07,807 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 14:44:07,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:07,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392557760] [2025-01-09 14:44:07,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392557760] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:07,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:07,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:44:07,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138420765] [2025-01-09 14:44:07,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:07,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:44:07,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:07,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:44:07,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:44:07,809 INFO L87 Difference]: Start difference. First operand 1838 states and 2883 transitions. Second operand has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:11,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:11,650 INFO L93 Difference]: Finished difference Result 7528 states and 11707 transitions. [2025-01-09 14:44:11,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 14:44:11,651 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 496 [2025-01-09 14:44:11,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:11,675 INFO L225 Difference]: With dead ends: 7528 [2025-01-09 14:44:11,675 INFO L226 Difference]: Without dead ends: 5832 [2025-01-09 14:44:11,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2025-01-09 14:44:11,682 INFO L435 NwaCegarLoop]: 955 mSDtfsCounter, 2636 mSDsluCounter, 2964 mSDsCounter, 0 mSdLazyCounter, 1897 mSolverCounterSat, 1009 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2636 SdHoareTripleChecker+Valid, 3919 SdHoareTripleChecker+Invalid, 2906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1009 IncrementalHoareTripleChecker+Valid, 1897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:11,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2636 Valid, 3919 Invalid, 2906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1009 Valid, 1897 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-09 14:44:11,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5832 states. [2025-01-09 14:44:11,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5832 to 3430. [2025-01-09 14:44:11,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3430 states, 2606 states have (on average 1.4389869531849577) internal successors, (3750), 2618 states have internal predecessors, (3750), 801 states have call successors, (801), 22 states have call predecessors, (801), 22 states have return successors, (801), 789 states have call predecessors, (801), 801 states have call successors, (801) [2025-01-09 14:44:11,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3430 states to 3430 states and 5352 transitions. [2025-01-09 14:44:11,963 INFO L78 Accepts]: Start accepts. Automaton has 3430 states and 5352 transitions. Word has length 496 [2025-01-09 14:44:11,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:11,964 INFO L471 AbstractCegarLoop]: Abstraction has 3430 states and 5352 transitions. [2025-01-09 14:44:11,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:11,965 INFO L276 IsEmpty]: Start isEmpty. Operand 3430 states and 5352 transitions. [2025-01-09 14:44:11,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-01-09 14:44:11,969 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:11,969 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:44:11,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:44:11,970 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:11,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:11,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1322801706, now seen corresponding path program 1 times [2025-01-09 14:44:11,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:11,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879865469] [2025-01-09 14:44:11,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:11,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:12,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-01-09 14:44:12,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-01-09 14:44:12,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:12,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:12,134 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 14:44:12,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:12,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879865469] [2025-01-09 14:44:12,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879865469] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:12,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:12,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:44:12,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001501756] [2025-01-09 14:44:12,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:12,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:44:12,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:12,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:44:12,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:44:12,136 INFO L87 Difference]: Start difference. First operand 3430 states and 5352 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:12,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:12,503 INFO L93 Difference]: Finished difference Result 9276 states and 14408 transitions. [2025-01-09 14:44:12,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:44:12,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 496 [2025-01-09 14:44:12,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:12,530 INFO L225 Difference]: With dead ends: 9276 [2025-01-09 14:44:12,531 INFO L226 Difference]: Without dead ends: 6372 [2025-01-09 14:44:12,539 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-01-09 14:44:12,539 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 472 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:12,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 946 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:44:12,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6372 states. [2025-01-09 14:44:12,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6372 to 3534. [2025-01-09 14:44:12,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3534 states, 2710 states have (on average 1.4391143911439115) internal successors, (3900), 2722 states have internal predecessors, (3900), 801 states have call successors, (801), 22 states have call predecessors, (801), 22 states have return successors, (801), 789 states have call predecessors, (801), 801 states have call successors, (801) [2025-01-09 14:44:12,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3534 states to 3534 states and 5502 transitions. [2025-01-09 14:44:12,833 INFO L78 Accepts]: Start accepts. Automaton has 3534 states and 5502 transitions. Word has length 496 [2025-01-09 14:44:12,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:12,834 INFO L471 AbstractCegarLoop]: Abstraction has 3534 states and 5502 transitions. [2025-01-09 14:44:12,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:12,834 INFO L276 IsEmpty]: Start isEmpty. Operand 3534 states and 5502 transitions. [2025-01-09 14:44:12,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2025-01-09 14:44:12,838 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:12,839 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:44:12,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:44:12,839 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:12,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:12,840 INFO L85 PathProgramCache]: Analyzing trace with hash 671953839, now seen corresponding path program 1 times [2025-01-09 14:44:12,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:12,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190809155] [2025-01-09 14:44:12,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:12,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:12,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 497 statements into 1 equivalence classes. [2025-01-09 14:44:12,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 497 of 497 statements. [2025-01-09 14:44:12,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:12,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:13,410 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 14:44:13,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:13,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190809155] [2025-01-09 14:44:13,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190809155] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:13,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:13,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:44:13,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277130000] [2025-01-09 14:44:13,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:13,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:44:13,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:13,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:44:13,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:44:13,415 INFO L87 Difference]: Start difference. First operand 3534 states and 5502 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:13,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:13,725 INFO L93 Difference]: Finished difference Result 7031 states and 10924 transitions. [2025-01-09 14:44:13,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:44:13,726 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 497 [2025-01-09 14:44:13,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:13,755 INFO L225 Difference]: With dead ends: 7031 [2025-01-09 14:44:13,755 INFO L226 Difference]: Without dead ends: 5269 [2025-01-09 14:44:13,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:44:13,762 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 1715 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1715 SdHoareTripleChecker+Valid, 1892 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:13,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1715 Valid, 1892 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:44:13,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5269 states. [2025-01-09 14:44:13,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5269 to 3693. [2025-01-09 14:44:13,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3693 states, 2869 states have (on average 1.4492854653189264) internal successors, (4158), 2881 states have internal predecessors, (4158), 801 states have call successors, (801), 22 states have call predecessors, (801), 22 states have return successors, (801), 789 states have call predecessors, (801), 801 states have call successors, (801) [2025-01-09 14:44:14,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3693 states to 3693 states and 5760 transitions. [2025-01-09 14:44:14,009 INFO L78 Accepts]: Start accepts. Automaton has 3693 states and 5760 transitions. Word has length 497 [2025-01-09 14:44:14,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:14,010 INFO L471 AbstractCegarLoop]: Abstraction has 3693 states and 5760 transitions. [2025-01-09 14:44:14,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:14,011 INFO L276 IsEmpty]: Start isEmpty. Operand 3693 states and 5760 transitions. [2025-01-09 14:44:14,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2025-01-09 14:44:14,015 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:14,015 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:44:14,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:44:14,016 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:14,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:14,016 INFO L85 PathProgramCache]: Analyzing trace with hash -783071891, now seen corresponding path program 1 times [2025-01-09 14:44:14,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:14,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309905838] [2025-01-09 14:44:14,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:14,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:14,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 497 statements into 1 equivalence classes. [2025-01-09 14:44:14,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 497 of 497 statements. [2025-01-09 14:44:14,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:14,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:14,158 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 14:44:14,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:14,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309905838] [2025-01-09 14:44:14,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309905838] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:14,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:14,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:44:14,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968996647] [2025-01-09 14:44:14,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:14,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:44:14,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:14,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:44:14,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:44:14,160 INFO L87 Difference]: Start difference. First operand 3693 states and 5760 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:14,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:14,568 INFO L93 Difference]: Finished difference Result 10015 states and 15562 transitions. [2025-01-09 14:44:14,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:44:14,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 497 [2025-01-09 14:44:14,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:14,598 INFO L225 Difference]: With dead ends: 10015 [2025-01-09 14:44:14,598 INFO L226 Difference]: Without dead ends: 6688 [2025-01-09 14:44:14,608 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-01-09 14:44:14,609 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 369 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:14,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 947 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:44:14,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6688 states. [2025-01-09 14:44:15,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6688 to 3912. [2025-01-09 14:44:15,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3912 states, 3088 states have (on average 1.4566062176165804) internal successors, (4498), 3100 states have internal predecessors, (4498), 801 states have call successors, (801), 22 states have call predecessors, (801), 22 states have return successors, (801), 789 states have call predecessors, (801), 801 states have call successors, (801) [2025-01-09 14:44:15,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3912 states to 3912 states and 6100 transitions. [2025-01-09 14:44:15,056 INFO L78 Accepts]: Start accepts. Automaton has 3912 states and 6100 transitions. Word has length 497 [2025-01-09 14:44:15,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:15,057 INFO L471 AbstractCegarLoop]: Abstraction has 3912 states and 6100 transitions. [2025-01-09 14:44:15,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:15,057 INFO L276 IsEmpty]: Start isEmpty. Operand 3912 states and 6100 transitions. [2025-01-09 14:44:15,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2025-01-09 14:44:15,061 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:15,061 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:44:15,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:44:15,062 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:15,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:15,062 INFO L85 PathProgramCache]: Analyzing trace with hash -388705105, now seen corresponding path program 1 times [2025-01-09 14:44:15,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:15,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290189127] [2025-01-09 14:44:15,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:15,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:15,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 497 statements into 1 equivalence classes. [2025-01-09 14:44:15,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 497 of 497 statements. [2025-01-09 14:44:15,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:15,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:16,029 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 14:44:16,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:16,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290189127] [2025-01-09 14:44:16,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290189127] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:16,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:16,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:44:16,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430937454] [2025-01-09 14:44:16,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:16,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:44:16,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:16,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:44:16,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:44:16,031 INFO L87 Difference]: Start difference. First operand 3912 states and 6100 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:16,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:16,667 INFO L93 Difference]: Finished difference Result 12261 states and 19064 transitions. [2025-01-09 14:44:16,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:44:16,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 497 [2025-01-09 14:44:16,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:16,694 INFO L225 Difference]: With dead ends: 12261 [2025-01-09 14:44:16,694 INFO L226 Difference]: Without dead ends: 8721 [2025-01-09 14:44:16,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-01-09 14:44:16,704 INFO L435 NwaCegarLoop]: 679 mSDtfsCounter, 895 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 1463 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:16,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 1463 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:44:16,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8721 states. [2025-01-09 14:44:17,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8721 to 7295. [2025-01-09 14:44:17,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7295 states, 6078 states have (on average 1.4865087199736755) internal successors, (9035), 6106 states have internal predecessors, (9035), 1169 states have call successors, (1169), 47 states have call predecessors, (1169), 47 states have return successors, (1169), 1141 states have call predecessors, (1169), 1169 states have call successors, (1169) [2025-01-09 14:44:17,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7295 states to 7295 states and 11373 transitions. [2025-01-09 14:44:17,140 INFO L78 Accepts]: Start accepts. Automaton has 7295 states and 11373 transitions. Word has length 497 [2025-01-09 14:44:17,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:17,140 INFO L471 AbstractCegarLoop]: Abstraction has 7295 states and 11373 transitions. [2025-01-09 14:44:17,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:17,141 INFO L276 IsEmpty]: Start isEmpty. Operand 7295 states and 11373 transitions. [2025-01-09 14:44:17,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2025-01-09 14:44:17,147 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:17,149 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:44:17,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:44:17,149 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:17,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:17,151 INFO L85 PathProgramCache]: Analyzing trace with hash -798590609, now seen corresponding path program 1 times [2025-01-09 14:44:17,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:17,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350140542] [2025-01-09 14:44:17,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:17,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:17,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 497 statements into 1 equivalence classes. [2025-01-09 14:44:17,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 497 of 497 statements. [2025-01-09 14:44:17,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:17,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:18,048 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 14:44:18,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:18,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350140542] [2025-01-09 14:44:18,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350140542] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:18,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:18,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:44:18,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857620096] [2025-01-09 14:44:18,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:18,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:44:18,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:18,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:44:18,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:44:18,054 INFO L87 Difference]: Start difference. First operand 7295 states and 11373 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:18,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:18,625 INFO L93 Difference]: Finished difference Result 16133 states and 25019 transitions. [2025-01-09 14:44:18,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:44:18,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 497 [2025-01-09 14:44:18,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:18,652 INFO L225 Difference]: With dead ends: 16133 [2025-01-09 14:44:18,652 INFO L226 Difference]: Without dead ends: 10518 [2025-01-09 14:44:18,661 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-01-09 14:44:18,662 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 668 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:18,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 1018 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:44:18,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10518 states. [2025-01-09 14:44:18,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10518 to 5768. [2025-01-09 14:44:18,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5768 states, 4931 states have (on average 1.5155140945041574) internal successors, (7473), 4943 states have internal predecessors, (7473), 801 states have call successors, (801), 35 states have call predecessors, (801), 35 states have return successors, (801), 789 states have call predecessors, (801), 801 states have call successors, (801) [2025-01-09 14:44:18,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5768 states to 5768 states and 9075 transitions. [2025-01-09 14:44:18,984 INFO L78 Accepts]: Start accepts. Automaton has 5768 states and 9075 transitions. Word has length 497 [2025-01-09 14:44:18,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:18,985 INFO L471 AbstractCegarLoop]: Abstraction has 5768 states and 9075 transitions. [2025-01-09 14:44:18,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:18,985 INFO L276 IsEmpty]: Start isEmpty. Operand 5768 states and 9075 transitions. [2025-01-09 14:44:18,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2025-01-09 14:44:18,990 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:18,990 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:44:18,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 14:44:18,990 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:18,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:18,991 INFO L85 PathProgramCache]: Analyzing trace with hash 263062703, now seen corresponding path program 1 times [2025-01-09 14:44:18,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:18,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836586641] [2025-01-09 14:44:18,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:18,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:19,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 497 statements into 1 equivalence classes. [2025-01-09 14:44:25,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 497 of 497 statements. [2025-01-09 14:44:25,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:25,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:26,098 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 3 proven. 201 refuted. 0 times theorem prover too weak. 9180 trivial. 0 not checked. [2025-01-09 14:44:26,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:26,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836586641] [2025-01-09 14:44:26,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836586641] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:44:26,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920844445] [2025-01-09 14:44:26,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:26,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:44:26,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:44:26,101 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-01-09 14:44:26,108 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-01-09 14:44:26,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 497 statements into 1 equivalence classes. [2025-01-09 14:44:26,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 497 of 497 statements. [2025-01-09 14:44:26,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:26,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:26,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 1282 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 14:44:26,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:44:26,785 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 4454 proven. 75 refuted. 0 times theorem prover too weak. 4855 trivial. 0 not checked. [2025-01-09 14:44:26,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:44:27,398 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 129 proven. 75 refuted. 0 times theorem prover too weak. 9180 trivial. 0 not checked. [2025-01-09 14:44:27,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920844445] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:44:27,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:44:27,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2025-01-09 14:44:27,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170387687] [2025-01-09 14:44:27,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:44:27,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 14:44:27,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:27,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 14:44:27,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:44:27,401 INFO L87 Difference]: Start difference. First operand 5768 states and 9075 transitions. Second operand has 11 states, 11 states have (on average 34.36363636363637) internal successors, (378), 11 states have internal predecessors, (378), 4 states have call successors, (161), 2 states have call predecessors, (161), 4 states have return successors, (163), 4 states have call predecessors, (163), 4 states have call successors, (163) [2025-01-09 14:44:29,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:29,014 INFO L93 Difference]: Finished difference Result 16286 states and 25254 transitions. [2025-01-09 14:44:29,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-09 14:44:29,014 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 34.36363636363637) internal successors, (378), 11 states have internal predecessors, (378), 4 states have call successors, (161), 2 states have call predecessors, (161), 4 states have return successors, (163), 4 states have call predecessors, (163), 4 states have call successors, (163) Word has length 497 [2025-01-09 14:44:29,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:29,040 INFO L225 Difference]: With dead ends: 16286 [2025-01-09 14:44:29,040 INFO L226 Difference]: Without dead ends: 10752 [2025-01-09 14:44:29,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1027 GetRequests, 991 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=391, Invalid=1015, Unknown=0, NotChecked=0, Total=1406 [2025-01-09 14:44:29,050 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 1672 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 713 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1676 SdHoareTripleChecker+Valid, 2192 SdHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 713 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:29,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1676 Valid, 2192 Invalid, 1747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [713 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 14:44:29,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10752 states. [2025-01-09 14:44:29,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10752 to 4550. [2025-01-09 14:44:29,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4550 states, 3703 states have (on average 1.476910613016473) internal successors, (5469), 3711 states have internal predecessors, (5469), 793 states have call successors, (793), 53 states have call predecessors, (793), 53 states have return successors, (793), 785 states have call predecessors, (793), 793 states have call successors, (793) [2025-01-09 14:44:29,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4550 states to 4550 states and 7055 transitions. [2025-01-09 14:44:29,384 INFO L78 Accepts]: Start accepts. Automaton has 4550 states and 7055 transitions. Word has length 497 [2025-01-09 14:44:29,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:29,385 INFO L471 AbstractCegarLoop]: Abstraction has 4550 states and 7055 transitions. [2025-01-09 14:44:29,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 34.36363636363637) internal successors, (378), 11 states have internal predecessors, (378), 4 states have call successors, (161), 2 states have call predecessors, (161), 4 states have return successors, (163), 4 states have call predecessors, (163), 4 states have call successors, (163) [2025-01-09 14:44:29,385 INFO L276 IsEmpty]: Start isEmpty. Operand 4550 states and 7055 transitions. [2025-01-09 14:44:29,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2025-01-09 14:44:29,390 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:29,390 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:44:29,402 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-01-09 14:44:29,595 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,SelfDestructingSolverStorable14 [2025-01-09 14:44:29,595 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:29,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:29,596 INFO L85 PathProgramCache]: Analyzing trace with hash -336107805, now seen corresponding path program 1 times [2025-01-09 14:44:29,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:29,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567621563] [2025-01-09 14:44:29,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:29,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:29,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-01-09 14:44:30,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-01-09 14:44:30,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:30,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:30,832 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 39 proven. 165 refuted. 0 times theorem prover too weak. 9180 trivial. 0 not checked. [2025-01-09 14:44:30,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:30,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567621563] [2025-01-09 14:44:30,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567621563] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:44:30,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679723565] [2025-01-09 14:44:30,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:30,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:44:30,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:44:30,835 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:44:30,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 14:44:31,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-01-09 14:44:31,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-01-09 14:44:31,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:31,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:31,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 1286 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 14:44:31,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:44:32,054 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 5616 proven. 207 refuted. 0 times theorem prover too weak. 3561 trivial. 0 not checked. [2025-01-09 14:44:32,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:44:33,009 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 387 proven. 216 refuted. 0 times theorem prover too weak. 8781 trivial. 0 not checked. [2025-01-09 14:44:33,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679723565] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:44:33,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:44:33,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13, 13] total 25 [2025-01-09 14:44:33,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265012776] [2025-01-09 14:44:33,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:44:33,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 14:44:33,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:33,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 14:44:33,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2025-01-09 14:44:33,012 INFO L87 Difference]: Start difference. First operand 4550 states and 7055 transitions. Second operand has 25 states, 25 states have (on average 15.64) internal successors, (391), 25 states have internal predecessors, (391), 8 states have call successors, (175), 4 states have call predecessors, (175), 10 states have return successors, (177), 8 states have call predecessors, (177), 8 states have call successors, (177) [2025-01-09 14:44:36,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:36,428 INFO L93 Difference]: Finished difference Result 20266 states and 30432 transitions. [2025-01-09 14:44:36,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-01-09 14:44:36,432 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 15.64) internal successors, (391), 25 states have internal predecessors, (391), 8 states have call successors, (175), 4 states have call predecessors, (175), 10 states have return successors, (177), 8 states have call predecessors, (177), 8 states have call successors, (177) Word has length 498 [2025-01-09 14:44:36,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:36,485 INFO L225 Difference]: With dead ends: 20266 [2025-01-09 14:44:36,485 INFO L226 Difference]: Without dead ends: 16048 [2025-01-09 14:44:36,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1064 GetRequests, 984 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1821 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1756, Invalid=4886, Unknown=0, NotChecked=0, Total=6642 [2025-01-09 14:44:36,497 INFO L435 NwaCegarLoop]: 635 mSDtfsCounter, 2406 mSDsluCounter, 4704 mSDsCounter, 0 mSdLazyCounter, 2367 mSolverCounterSat, 594 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2410 SdHoareTripleChecker+Valid, 5339 SdHoareTripleChecker+Invalid, 2961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 594 IncrementalHoareTripleChecker+Valid, 2367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:36,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2410 Valid, 5339 Invalid, 2961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [594 Valid, 2367 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 14:44:36,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16048 states. [2025-01-09 14:44:36,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16048 to 7945. [2025-01-09 14:44:36,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7945 states, 6961 states have (on average 1.5033759517310732) internal successors, (10465), 6973 states have internal predecessors, (10465), 861 states have call successors, (861), 122 states have call predecessors, (861), 122 states have return successors, (861), 849 states have call predecessors, (861), 861 states have call successors, (861) [2025-01-09 14:44:36,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7945 states to 7945 states and 12187 transitions. [2025-01-09 14:44:36,928 INFO L78 Accepts]: Start accepts. Automaton has 7945 states and 12187 transitions. Word has length 498 [2025-01-09 14:44:36,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:36,929 INFO L471 AbstractCegarLoop]: Abstraction has 7945 states and 12187 transitions. [2025-01-09 14:44:36,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 15.64) internal successors, (391), 25 states have internal predecessors, (391), 8 states have call successors, (175), 4 states have call predecessors, (175), 10 states have return successors, (177), 8 states have call predecessors, (177), 8 states have call successors, (177) [2025-01-09 14:44:36,929 INFO L276 IsEmpty]: Start isEmpty. Operand 7945 states and 12187 transitions. [2025-01-09 14:44:36,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2025-01-09 14:44:36,935 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:36,935 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:44:36,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 14:44:37,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:44:37,140 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:37,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:37,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1944235555, now seen corresponding path program 1 times [2025-01-09 14:44:37,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:37,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260947729] [2025-01-09 14:44:37,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:37,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:37,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-01-09 14:44:37,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-01-09 14:44:37,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:37,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:37,823 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 14:44:37,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:37,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260947729] [2025-01-09 14:44:37,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260947729] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:37,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:37,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:44:37,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954494597] [2025-01-09 14:44:37,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:37,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:44:37,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:37,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:44:37,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:44:37,824 INFO L87 Difference]: Start difference. First operand 7945 states and 12187 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:38,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:38,432 INFO L93 Difference]: Finished difference Result 15752 states and 24169 transitions. [2025-01-09 14:44:38,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:44:38,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 498 [2025-01-09 14:44:38,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:38,457 INFO L225 Difference]: With dead ends: 15752 [2025-01-09 14:44:38,457 INFO L226 Difference]: Without dead ends: 8701 [2025-01-09 14:44:38,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:44:38,470 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 350 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1743 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:38,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 1743 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:44:38,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8701 states. [2025-01-09 14:44:38,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8701 to 7415. [2025-01-09 14:44:38,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7415 states, 6431 states have (on average 1.497900793033743) internal successors, (9633), 6443 states have internal predecessors, (9633), 861 states have call successors, (861), 122 states have call predecessors, (861), 122 states have return successors, (861), 849 states have call predecessors, (861), 861 states have call successors, (861) [2025-01-09 14:44:38,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7415 states to 7415 states and 11355 transitions. [2025-01-09 14:44:38,860 INFO L78 Accepts]: Start accepts. Automaton has 7415 states and 11355 transitions. Word has length 498 [2025-01-09 14:44:38,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:38,860 INFO L471 AbstractCegarLoop]: Abstraction has 7415 states and 11355 transitions. [2025-01-09 14:44:38,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:38,861 INFO L276 IsEmpty]: Start isEmpty. Operand 7415 states and 11355 transitions. [2025-01-09 14:44:38,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-01-09 14:44:38,865 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:38,865 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:44:38,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 14:44:38,865 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:38,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:38,866 INFO L85 PathProgramCache]: Analyzing trace with hash 138947849, now seen corresponding path program 1 times [2025-01-09 14:44:38,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:38,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759696730] [2025-01-09 14:44:38,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:38,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:38,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-01-09 14:44:39,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-01-09 14:44:39,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:39,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:39,643 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 14:44:39,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:39,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759696730] [2025-01-09 14:44:39,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759696730] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:39,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:39,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:44:39,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596980841] [2025-01-09 14:44:39,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:39,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:44:39,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:39,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:44:39,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:44:39,645 INFO L87 Difference]: Start difference. First operand 7415 states and 11355 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:40,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:40,066 INFO L93 Difference]: Finished difference Result 13528 states and 20570 transitions. [2025-01-09 14:44:40,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:44:40,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 499 [2025-01-09 14:44:40,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:40,087 INFO L225 Difference]: With dead ends: 13528 [2025-01-09 14:44:40,087 INFO L226 Difference]: Without dead ends: 7451 [2025-01-09 14:44:40,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-01-09 14:44:40,096 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 201 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:40,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1138 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:44:40,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7451 states. [2025-01-09 14:44:40,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7451 to 5979. [2025-01-09 14:44:40,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5979 states, 4978 states have (on average 1.4477701888308558) internal successors, (7207), 4990 states have internal predecessors, (7207), 861 states have call successors, (861), 139 states have call predecessors, (861), 139 states have return successors, (861), 849 states have call predecessors, (861), 861 states have call successors, (861) [2025-01-09 14:44:40,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5979 states to 5979 states and 8929 transitions. [2025-01-09 14:44:40,545 INFO L78 Accepts]: Start accepts. Automaton has 5979 states and 8929 transitions. Word has length 499 [2025-01-09 14:44:40,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:40,547 INFO L471 AbstractCegarLoop]: Abstraction has 5979 states and 8929 transitions. [2025-01-09 14:44:40,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:40,547 INFO L276 IsEmpty]: Start isEmpty. Operand 5979 states and 8929 transitions. [2025-01-09 14:44:40,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-01-09 14:44:40,553 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:40,553 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:44:40,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 14:44:40,553 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:40,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:40,554 INFO L85 PathProgramCache]: Analyzing trace with hash -2032754248, now seen corresponding path program 1 times [2025-01-09 14:44:40,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:40,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184540153] [2025-01-09 14:44:40,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:40,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:40,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-01-09 14:44:40,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-01-09 14:44:40,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:40,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:40,772 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 14:44:40,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:40,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184540153] [2025-01-09 14:44:40,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184540153] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:40,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:40,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:44:40,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36490550] [2025-01-09 14:44:40,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:40,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:44:40,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:40,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:44:40,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:44:40,774 INFO L87 Difference]: Start difference. First operand 5979 states and 8929 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:41,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:41,593 INFO L93 Difference]: Finished difference Result 15546 states and 23112 transitions. [2025-01-09 14:44:41,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:44:41,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 499 [2025-01-09 14:44:41,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:41,620 INFO L225 Difference]: With dead ends: 15546 [2025-01-09 14:44:41,620 INFO L226 Difference]: Without dead ends: 10589 [2025-01-09 14:44:41,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-01-09 14:44:41,631 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 801 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:41,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 947 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:44:41,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10589 states. [2025-01-09 14:44:42,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10589 to 5968. [2025-01-09 14:44:42,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5968 states, 4967 states have (on average 1.4487618280652306) internal successors, (7196), 4979 states have internal predecessors, (7196), 861 states have call successors, (861), 139 states have call predecessors, (861), 139 states have return successors, (861), 849 states have call predecessors, (861), 861 states have call successors, (861) [2025-01-09 14:44:42,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5968 states to 5968 states and 8918 transitions. [2025-01-09 14:44:42,402 INFO L78 Accepts]: Start accepts. Automaton has 5968 states and 8918 transitions. Word has length 499 [2025-01-09 14:44:42,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:42,403 INFO L471 AbstractCegarLoop]: Abstraction has 5968 states and 8918 transitions. [2025-01-09 14:44:42,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:42,403 INFO L276 IsEmpty]: Start isEmpty. Operand 5968 states and 8918 transitions. [2025-01-09 14:44:42,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-01-09 14:44:42,409 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:42,409 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:44:42,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 14:44:42,410 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:42,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:42,410 INFO L85 PathProgramCache]: Analyzing trace with hash 421383095, now seen corresponding path program 1 times [2025-01-09 14:44:42,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:42,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974419606] [2025-01-09 14:44:42,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:42,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:42,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-01-09 14:44:42,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-01-09 14:44:42,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:42,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:43,061 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 14:44:43,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:43,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974419606] [2025-01-09 14:44:43,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974419606] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:43,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:43,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:44:43,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122959166] [2025-01-09 14:44:43,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:43,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:44:43,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:43,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:44:43,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:44:43,064 INFO L87 Difference]: Start difference. First operand 5968 states and 8918 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:43,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:43,649 INFO L93 Difference]: Finished difference Result 15480 states and 23202 transitions. [2025-01-09 14:44:43,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:44:43,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 500 [2025-01-09 14:44:43,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:43,672 INFO L225 Difference]: With dead ends: 15480 [2025-01-09 14:44:43,672 INFO L226 Difference]: Without dead ends: 10254 [2025-01-09 14:44:43,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:44:43,683 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 627 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 1453 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:43,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 1453 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:44:43,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10254 states. [2025-01-09 14:44:44,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10254 to 9996. [2025-01-09 14:44:44,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9996 states, 8787 states have (on average 1.4721748036872653) internal successors, (12936), 8815 states have internal predecessors, (12936), 1021 states have call successors, (1021), 187 states have call predecessors, (1021), 187 states have return successors, (1021), 993 states have call predecessors, (1021), 1021 states have call successors, (1021) [2025-01-09 14:44:44,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9996 states to 9996 states and 14978 transitions. [2025-01-09 14:44:44,344 INFO L78 Accepts]: Start accepts. Automaton has 9996 states and 14978 transitions. Word has length 500 [2025-01-09 14:44:44,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:44,345 INFO L471 AbstractCegarLoop]: Abstraction has 9996 states and 14978 transitions. [2025-01-09 14:44:44,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:44,345 INFO L276 IsEmpty]: Start isEmpty. Operand 9996 states and 14978 transitions. [2025-01-09 14:44:44,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-01-09 14:44:44,352 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:44,352 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:44:44,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 14:44:44,352 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:44,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:44,354 INFO L85 PathProgramCache]: Analyzing trace with hash -964612937, now seen corresponding path program 1 times [2025-01-09 14:44:44,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:44,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469486969] [2025-01-09 14:44:44,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:44,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:44,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-01-09 14:44:44,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-01-09 14:44:44,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:44,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:44,921 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 14:44:44,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:44,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469486969] [2025-01-09 14:44:44,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469486969] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:44,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:44,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:44:44,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839190769] [2025-01-09 14:44:44,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:44,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:44:44,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:44,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:44:44,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:44:44,922 INFO L87 Difference]: Start difference. First operand 9996 states and 14978 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:46,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:46,095 INFO L93 Difference]: Finished difference Result 33949 states and 50788 transitions. [2025-01-09 14:44:46,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:44:46,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 500 [2025-01-09 14:44:46,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:46,140 INFO L225 Difference]: With dead ends: 33949 [2025-01-09 14:44:46,141 INFO L226 Difference]: Without dead ends: 24243 [2025-01-09 14:44:46,157 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-01-09 14:44:46,158 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 945 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:46,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 1642 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:44:46,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24243 states. [2025-01-09 14:44:46,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24243 to 12804. [2025-01-09 14:44:46,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12804 states, 11595 states have (on average 1.498835705045278) internal successors, (17379), 11623 states have internal predecessors, (17379), 1021 states have call successors, (1021), 187 states have call predecessors, (1021), 187 states have return successors, (1021), 993 states have call predecessors, (1021), 1021 states have call successors, (1021) [2025-01-09 14:44:46,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12804 states to 12804 states and 19421 transitions. [2025-01-09 14:44:46,806 INFO L78 Accepts]: Start accepts. Automaton has 12804 states and 19421 transitions. Word has length 500 [2025-01-09 14:44:46,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:46,807 INFO L471 AbstractCegarLoop]: Abstraction has 12804 states and 19421 transitions. [2025-01-09 14:44:46,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:46,807 INFO L276 IsEmpty]: Start isEmpty. Operand 12804 states and 19421 transitions. [2025-01-09 14:44:46,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-01-09 14:44:46,814 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:46,815 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:44:46,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 14:44:46,815 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:46,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:46,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1135228169, now seen corresponding path program 1 times [2025-01-09 14:44:46,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:46,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110375814] [2025-01-09 14:44:46,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:46,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:46,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-01-09 14:44:47,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-01-09 14:44:47,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:47,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:47,431 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 14:44:47,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:47,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110375814] [2025-01-09 14:44:47,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110375814] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:47,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:47,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:44:47,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815279378] [2025-01-09 14:44:47,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:47,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:44:47,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:47,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:44:47,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:44:47,433 INFO L87 Difference]: Start difference. First operand 12804 states and 19421 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:48,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:48,333 INFO L93 Difference]: Finished difference Result 31782 states and 48085 transitions. [2025-01-09 14:44:48,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:44:48,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 500 [2025-01-09 14:44:48,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:48,393 INFO L225 Difference]: With dead ends: 31782 [2025-01-09 14:44:48,396 INFO L226 Difference]: Without dead ends: 21412 [2025-01-09 14:44:48,426 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-01-09 14:44:48,427 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 743 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 1774 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:48,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 1774 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:44:48,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21412 states. [2025-01-09 14:44:49,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21412 to 13016. [2025-01-09 14:44:49,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13016 states, 11807 states have (on average 1.4954687897010248) internal successors, (17657), 11835 states have internal predecessors, (17657), 1021 states have call successors, (1021), 187 states have call predecessors, (1021), 187 states have return successors, (1021), 993 states have call predecessors, (1021), 1021 states have call successors, (1021) [2025-01-09 14:44:49,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13016 states to 13016 states and 19699 transitions. [2025-01-09 14:44:49,422 INFO L78 Accepts]: Start accepts. Automaton has 13016 states and 19699 transitions. Word has length 500 [2025-01-09 14:44:49,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:49,423 INFO L471 AbstractCegarLoop]: Abstraction has 13016 states and 19699 transitions. [2025-01-09 14:44:49,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:49,423 INFO L276 IsEmpty]: Start isEmpty. Operand 13016 states and 19699 transitions. [2025-01-09 14:44:49,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-01-09 14:44:49,433 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:49,434 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:44:49,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 14:44:49,434 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:49,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:49,434 INFO L85 PathProgramCache]: Analyzing trace with hash 2093714709, now seen corresponding path program 1 times [2025-01-09 14:44:49,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:49,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669816386] [2025-01-09 14:44:49,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:49,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:49,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-01-09 14:44:49,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-01-09 14:44:49,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:49,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:50,118 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 14:44:50,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:50,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669816386] [2025-01-09 14:44:50,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669816386] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:50,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:50,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:44:50,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140062368] [2025-01-09 14:44:50,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:50,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:44:50,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:50,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:44:50,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:44:50,120 INFO L87 Difference]: Start difference. First operand 13016 states and 19699 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:50,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:50,923 INFO L93 Difference]: Finished difference Result 40930 states and 62484 transitions. [2025-01-09 14:44:50,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:44:50,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 500 [2025-01-09 14:44:50,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:50,971 INFO L225 Difference]: With dead ends: 40930 [2025-01-09 14:44:50,971 INFO L226 Difference]: Without dead ends: 29348 [2025-01-09 14:44:50,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:44:50,992 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 754 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 1914 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:50,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 1914 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:44:51,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29348 states. [2025-01-09 14:44:51,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29348 to 15400. [2025-01-09 14:44:51,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15400 states, 14191 states have (on average 1.4931294482418433) internal successors, (21189), 14219 states have internal predecessors, (21189), 1021 states have call successors, (1021), 187 states have call predecessors, (1021), 187 states have return successors, (1021), 993 states have call predecessors, (1021), 1021 states have call successors, (1021) [2025-01-09 14:44:51,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15400 states to 15400 states and 23231 transitions. [2025-01-09 14:44:51,751 INFO L78 Accepts]: Start accepts. Automaton has 15400 states and 23231 transitions. Word has length 500 [2025-01-09 14:44:51,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:51,751 INFO L471 AbstractCegarLoop]: Abstraction has 15400 states and 23231 transitions. [2025-01-09 14:44:51,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 14:44:51,751 INFO L276 IsEmpty]: Start isEmpty. Operand 15400 states and 23231 transitions. [2025-01-09 14:44:51,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-01-09 14:44:51,760 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:51,760 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:44:51,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 14:44:51,760 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:51,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:51,761 INFO L85 PathProgramCache]: Analyzing trace with hash 44326867, now seen corresponding path program 1 times [2025-01-09 14:44:51,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:51,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021752542] [2025-01-09 14:44:51,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:51,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:51,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-01-09 14:44:52,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-01-09 14:44:52,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:52,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:52,888 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 6 proven. 198 refuted. 0 times theorem prover too weak. 9180 trivial. 0 not checked. [2025-01-09 14:44:52,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:52,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021752542] [2025-01-09 14:44:52,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021752542] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:44:52,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437597878] [2025-01-09 14:44:52,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:52,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:44:52,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:44:52,891 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:44:52,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 14:44:53,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-01-09 14:44:53,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-01-09 14:44:53,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:53,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:53,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 1291 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 14:44:53,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:44:53,577 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 4578 proven. 81 refuted. 0 times theorem prover too weak. 4725 trivial. 0 not checked. [2025-01-09 14:44:53,577 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:44:53,988 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 123 proven. 81 refuted. 0 times theorem prover too weak. 9180 trivial. 0 not checked. [2025-01-09 14:44:53,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437597878] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:44:53,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:44:53,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 11] total 19 [2025-01-09 14:44:53,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045566853] [2025-01-09 14:44:53,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:44:53,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 14:44:53,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:53,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 14:44:53,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2025-01-09 14:44:53,991 INFO L87 Difference]: Start difference. First operand 15400 states and 23231 transitions. Second operand has 19 states, 19 states have (on average 20.105263157894736) internal successors, (382), 19 states have internal predecessors, (382), 4 states have call successors, (162), 2 states have call predecessors, (162), 4 states have return successors, (164), 4 states have call predecessors, (164), 4 states have call successors, (164) [2025-01-09 14:44:57,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:57,060 INFO L93 Difference]: Finished difference Result 30884 states and 46110 transitions. [2025-01-09 14:44:57,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-01-09 14:44:57,061 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 20.105263157894736) internal successors, (382), 19 states have internal predecessors, (382), 4 states have call successors, (162), 2 states have call predecessors, (162), 4 states have return successors, (164), 4 states have call predecessors, (164), 4 states have call successors, (164) Word has length 500 [2025-01-09 14:44:57,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:57,091 INFO L225 Difference]: With dead ends: 30884 [2025-01-09 14:44:57,091 INFO L226 Difference]: Without dead ends: 15682 [2025-01-09 14:44:57,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1041 GetRequests, 988 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=575, Invalid=2287, Unknown=0, NotChecked=0, Total=2862 [2025-01-09 14:44:57,109 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 1711 mSDsluCounter, 4780 mSDsCounter, 0 mSdLazyCounter, 2908 mSolverCounterSat, 653 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1714 SdHoareTripleChecker+Valid, 5387 SdHoareTripleChecker+Invalid, 3561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 653 IncrementalHoareTripleChecker+Valid, 2908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:57,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1714 Valid, 5387 Invalid, 3561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [653 Valid, 2908 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 14:44:57,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15682 states. [2025-01-09 14:44:57,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15682 to 10012. [2025-01-09 14:44:57,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10012 states, 9141 states have (on average 1.492834482004157) internal successors, (13646), 9161 states have internal predecessors, (13646), 705 states have call successors, (705), 165 states have call predecessors, (705), 165 states have return successors, (705), 685 states have call predecessors, (705), 705 states have call successors, (705) [2025-01-09 14:44:57,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10012 states to 10012 states and 15056 transitions. [2025-01-09 14:44:57,627 INFO L78 Accepts]: Start accepts. Automaton has 10012 states and 15056 transitions. Word has length 500 [2025-01-09 14:44:57,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:57,628 INFO L471 AbstractCegarLoop]: Abstraction has 10012 states and 15056 transitions. [2025-01-09 14:44:57,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 20.105263157894736) internal successors, (382), 19 states have internal predecessors, (382), 4 states have call successors, (162), 2 states have call predecessors, (162), 4 states have return successors, (164), 4 states have call predecessors, (164), 4 states have call successors, (164) [2025-01-09 14:44:57,628 INFO L276 IsEmpty]: Start isEmpty. Operand 10012 states and 15056 transitions. [2025-01-09 14:44:57,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2025-01-09 14:44:57,635 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:57,635 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:44:57,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 14:44:57,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-09 14:44:57,839 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:57,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:57,840 INFO L85 PathProgramCache]: Analyzing trace with hash 172795062, now seen corresponding path program 1 times [2025-01-09 14:44:57,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:57,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715353653] [2025-01-09 14:44:57,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:57,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:57,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-01-09 14:44:59,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-01-09 14:44:59,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:59,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:59,468 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 12 proven. 192 refuted. 0 times theorem prover too weak. 9180 trivial. 0 not checked. [2025-01-09 14:44:59,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:59,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715353653] [2025-01-09 14:44:59,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715353653] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:44:59,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491270584] [2025-01-09 14:44:59,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:59,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:44:59,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:44:59,472 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:44:59,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 14:44:59,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-01-09 14:44:59,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-01-09 14:44:59,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:59,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:59,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 1289 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 14:44:59,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:45:01,021 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 4578 proven. 81 refuted. 0 times theorem prover too weak. 4725 trivial. 0 not checked. [2025-01-09 14:45:01,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:45:02,012 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 123 proven. 81 refuted. 0 times theorem prover too weak. 9180 trivial. 0 not checked. [2025-01-09 14:45:02,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491270584] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:45:02,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:45:02,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 10] total 21 [2025-01-09 14:45:02,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350616151] [2025-01-09 14:45:02,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:45:02,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 14:45:02,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:02,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 14:45:02,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2025-01-09 14:45:02,015 INFO L87 Difference]: Start difference. First operand 10012 states and 15056 transitions. Second operand has 21 states, 21 states have (on average 18.571428571428573) internal successors, (390), 21 states have internal predecessors, (390), 6 states have call successors, (207), 3 states have call predecessors, (207), 6 states have return successors, (207), 6 states have call predecessors, (207), 6 states have call successors, (207) [2025-01-09 14:45:08,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:08,423 INFO L93 Difference]: Finished difference Result 75135 states and 113281 transitions. [2025-01-09 14:45:08,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-01-09 14:45:08,423 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 18.571428571428573) internal successors, (390), 21 states have internal predecessors, (390), 6 states have call successors, (207), 3 states have call predecessors, (207), 6 states have return successors, (207), 6 states have call predecessors, (207), 6 states have call successors, (207) Word has length 501 [2025-01-09 14:45:08,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:08,512 INFO L225 Difference]: With dead ends: 75135 [2025-01-09 14:45:08,513 INFO L226 Difference]: Without dead ends: 65231 [2025-01-09 14:45:08,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1072 GetRequests, 995 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1948 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1416, Invalid=4746, Unknown=0, NotChecked=0, Total=6162 [2025-01-09 14:45:08,536 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 5195 mSDsluCounter, 7250 mSDsCounter, 0 mSdLazyCounter, 3271 mSolverCounterSat, 1568 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5201 SdHoareTripleChecker+Valid, 7782 SdHoareTripleChecker+Invalid, 4839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1568 IncrementalHoareTripleChecker+Valid, 3271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:08,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5201 Valid, 7782 Invalid, 4839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1568 Valid, 3271 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-09 14:45:08,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65231 states. [2025-01-09 14:45:09,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65231 to 17696. [2025-01-09 14:45:09,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17696 states, 16131 states have (on average 1.4783956357324406) internal successors, (23848), 16163 states have internal predecessors, (23848), 1233 states have call successors, (1233), 331 states have call predecessors, (1233), 331 states have return successors, (1233), 1201 states have call predecessors, (1233), 1233 states have call successors, (1233) [2025-01-09 14:45:09,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17696 states to 17696 states and 26314 transitions. [2025-01-09 14:45:09,831 INFO L78 Accepts]: Start accepts. Automaton has 17696 states and 26314 transitions. Word has length 501 [2025-01-09 14:45:09,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:09,831 INFO L471 AbstractCegarLoop]: Abstraction has 17696 states and 26314 transitions. [2025-01-09 14:45:09,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 18.571428571428573) internal successors, (390), 21 states have internal predecessors, (390), 6 states have call successors, (207), 3 states have call predecessors, (207), 6 states have return successors, (207), 6 states have call predecessors, (207), 6 states have call successors, (207) [2025-01-09 14:45:09,832 INFO L276 IsEmpty]: Start isEmpty. Operand 17696 states and 26314 transitions. [2025-01-09 14:45:09,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2025-01-09 14:45:09,836 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:09,836 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:45:09,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 14:45:10,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-01-09 14:45:10,037 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:10,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:10,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1882971320, now seen corresponding path program 1 times [2025-01-09 14:45:10,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:10,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672225579] [2025-01-09 14:45:10,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:10,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:10,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-01-09 14:45:11,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-01-09 14:45:11,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:11,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat