./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-21.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-21.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 754bec8159063c8a609723291c8103d73dc7246c416cbba09af2ee6374dde5d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:38:11,048 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:38:11,102 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:38:11,106 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:38:11,106 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:38:11,133 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:38:11,133 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:38:11,133 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:38:11,134 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:38:11,134 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:38:11,135 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:38:11,135 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:38:11,135 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:38:11,135 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:38:11,136 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:38:11,136 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:38:11,136 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:38:11,136 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:38:11,136 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:38:11,136 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:38:11,136 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:38:11,137 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:38:11,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:38:11,137 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:38:11,137 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:38:11,137 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:38:11,137 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:38:11,137 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:38:11,137 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:38:11,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:38:11,137 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:38:11,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:38:11,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:38:11,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:38:11,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:38:11,138 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:38:11,138 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:38:11,138 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:38:11,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:38:11,138 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:38:11,138 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:38:11,138 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:38:11,138 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:38:11,138 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 -> 754bec8159063c8a609723291c8103d73dc7246c416cbba09af2ee6374dde5d5 [2025-02-06 02:38:11,345 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:38:11,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:38:11,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:38:11,356 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:38:11,356 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:38:11,357 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-21.i [2025-02-06 02:38:12,499 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/db7a1adbf/5367be20eea84f629691fc84d7d74cd4/FLAG0f4363105 [2025-02-06 02:38:12,828 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:38:12,831 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-21.i [2025-02-06 02:38:12,848 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/db7a1adbf/5367be20eea84f629691fc84d7d74cd4/FLAG0f4363105 [2025-02-06 02:38:12,866 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/db7a1adbf/5367be20eea84f629691fc84d7d74cd4 [2025-02-06 02:38:12,868 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:38:12,869 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:38:12,870 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:38:12,871 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:38:12,874 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:38:12,876 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:38:12" (1/1) ... [2025-02-06 02:38:12,878 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3249ac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:12, skipping insertion in model container [2025-02-06 02:38:12,878 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:38:12" (1/1) ... [2025-02-06 02:38:12,910 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:38:13,024 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-21.i[916,929] [2025-02-06 02:38:13,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:38:13,249 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:38:13,257 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-21.i[916,929] [2025-02-06 02:38:13,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:38:13,400 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:38:13,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:13 WrapperNode [2025-02-06 02:38:13,401 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:38:13,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:38:13,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:38:13,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:38:13,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:13" (1/1) ... [2025-02-06 02:38:13,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:13" (1/1) ... [2025-02-06 02:38:13,500 INFO L138 Inliner]: procedures = 26, calls = 86, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 624 [2025-02-06 02:38:13,500 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:38:13,501 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:38:13,501 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:38:13,501 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:38:13,507 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:13" (1/1) ... [2025-02-06 02:38:13,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:13" (1/1) ... [2025-02-06 02:38:13,529 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:13" (1/1) ... [2025-02-06 02:38:13,609 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 02:38:13,610 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:13" (1/1) ... [2025-02-06 02:38:13,610 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:13" (1/1) ... [2025-02-06 02:38:13,648 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:13" (1/1) ... [2025-02-06 02:38:13,653 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:13" (1/1) ... [2025-02-06 02:38:13,664 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:13" (1/1) ... [2025-02-06 02:38:13,671 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:13" (1/1) ... [2025-02-06 02:38:13,683 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:38:13,684 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:38:13,684 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:38:13,684 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:38:13,685 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:13" (1/1) ... [2025-02-06 02:38:13,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:38:13,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:38:13,715 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:38:13,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:38:13,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:38:13,740 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:38:13,740 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:38:13,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:38:13,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:38:13,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:38:13,862 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:38:13,863 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:38:14,662 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L652: havoc property_#t~bitwise48#1;havoc property_#t~short49#1; [2025-02-06 02:38:14,773 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2025-02-06 02:38:14,774 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:38:14,794 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:38:14,796 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:38:14,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:38:14 BoogieIcfgContainer [2025-02-06 02:38:14,796 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:38:14,800 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:38:14,800 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:38:14,803 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:38:14,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:38:12" (1/3) ... [2025-02-06 02:38:14,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b4d22c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:38:14, skipping insertion in model container [2025-02-06 02:38:14,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:13" (2/3) ... [2025-02-06 02:38:14,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b4d22c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:38:14, skipping insertion in model container [2025-02-06 02:38:14,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:38:14" (3/3) ... [2025-02-06 02:38:14,806 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-21.i [2025-02-06 02:38:14,817 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:38:14,819 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-21.i that has 2 procedures, 248 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:38:14,870 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:38:14,879 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;@24526677, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:38:14,881 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:38:14,885 INFO L276 IsEmpty]: Start isEmpty. Operand has 248 states, 172 states have (on average 1.558139534883721) internal successors, (268), 173 states have internal predecessors, (268), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-02-06 02:38:14,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-02-06 02:38:14,921 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:14,922 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:14,922 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:14,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:14,928 INFO L85 PathProgramCache]: Analyzing trace with hash 2112702823, now seen corresponding path program 1 times [2025-02-06 02:38:14,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:14,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011099082] [2025-02-06 02:38:14,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:14,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:15,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-02-06 02:38:15,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-02-06 02:38:15,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:15,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:15,458 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 10368 trivial. 0 not checked. [2025-02-06 02:38:15,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:15,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011099082] [2025-02-06 02:38:15,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011099082] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:38:15,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279012767] [2025-02-06 02:38:15,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:15,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:38:15,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:38:15,462 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:38:15,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 02:38:15,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-02-06 02:38:15,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-02-06 02:38:15,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:15,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:15,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 1207 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:38:15,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:38:15,824 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 10368 trivial. 0 not checked. [2025-02-06 02:38:15,825 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:38:15,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279012767] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:15,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:38:15,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:38:15,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456756032] [2025-02-06 02:38:15,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:15,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:38:15,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:15,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:38:15,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:38:15,850 INFO L87 Difference]: Start difference. First operand has 248 states, 172 states have (on average 1.558139534883721) internal successors, (268), 173 states have internal predecessors, (268), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) Second operand has 2 states, 2 states have (on average 63.0) internal successors, (126), 2 states have internal predecessors, (126), 2 states have call successors, (73), 2 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 2 states have call successors, (73) [2025-02-06 02:38:15,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:15,888 INFO L93 Difference]: Finished difference Result 490 states and 896 transitions. [2025-02-06 02:38:15,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:38:15,889 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 63.0) internal successors, (126), 2 states have internal predecessors, (126), 2 states have call successors, (73), 2 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 2 states have call successors, (73) Word has length 486 [2025-02-06 02:38:15,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:15,899 INFO L225 Difference]: With dead ends: 490 [2025-02-06 02:38:15,899 INFO L226 Difference]: Without dead ends: 245 [2025-02-06 02:38:15,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:38:15,905 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:15,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 407 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:38:15,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-02-06 02:38:15,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2025-02-06 02:38:15,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 170 states have (on average 1.5470588235294118) internal successors, (263), 170 states have internal predecessors, (263), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-02-06 02:38:15,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 409 transitions. [2025-02-06 02:38:15,967 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 409 transitions. Word has length 486 [2025-02-06 02:38:15,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:15,968 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 409 transitions. [2025-02-06 02:38:15,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 63.0) internal successors, (126), 2 states have internal predecessors, (126), 2 states have call successors, (73), 2 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 2 states have call successors, (73) [2025-02-06 02:38:15,968 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 409 transitions. [2025-02-06 02:38:15,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-02-06 02:38:15,975 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:15,975 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:15,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 02:38:16,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 02:38:16,176 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:16,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:16,177 INFO L85 PathProgramCache]: Analyzing trace with hash -371364188, now seen corresponding path program 1 times [2025-02-06 02:38:16,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:16,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455160336] [2025-02-06 02:38:16,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:16,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:16,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-02-06 02:38:16,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-02-06 02:38:16,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:16,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:16,690 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-02-06 02:38:16,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:16,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455160336] [2025-02-06 02:38:16,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455160336] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:16,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:16,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:38:16,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433815500] [2025-02-06 02:38:16,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:16,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:38:16,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:16,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:38:16,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:38:16,696 INFO L87 Difference]: Start difference. First operand 245 states and 409 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-02-06 02:38:16,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:16,810 INFO L93 Difference]: Finished difference Result 645 states and 1077 transitions. [2025-02-06 02:38:16,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:38:16,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 486 [2025-02-06 02:38:16,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:16,815 INFO L225 Difference]: With dead ends: 645 [2025-02-06 02:38:16,816 INFO L226 Difference]: Without dead ends: 403 [2025-02-06 02:38:16,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:38:16,819 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 258 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:16,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 912 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:38:16,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-02-06 02:38:16,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 400. [2025-02-06 02:38:16,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 281 states have (on average 1.5480427046263345) internal successors, (435), 282 states have internal predecessors, (435), 116 states have call successors, (116), 2 states have call predecessors, (116), 2 states have return successors, (116), 115 states have call predecessors, (116), 116 states have call successors, (116) [2025-02-06 02:38:16,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 667 transitions. [2025-02-06 02:38:16,871 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 667 transitions. Word has length 486 [2025-02-06 02:38:16,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:16,874 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 667 transitions. [2025-02-06 02:38:16,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-02-06 02:38:16,875 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 667 transitions. [2025-02-06 02:38:16,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-02-06 02:38:16,881 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:16,882 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:16,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:38:16,882 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:16,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:16,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1599575269, now seen corresponding path program 1 times [2025-02-06 02:38:16,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:16,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219375659] [2025-02-06 02:38:16,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:16,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:16,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-02-06 02:38:17,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-02-06 02:38:17,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:17,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:17,263 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-02-06 02:38:17,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:17,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219375659] [2025-02-06 02:38:17,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219375659] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:17,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:17,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:38:17,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67150460] [2025-02-06 02:38:17,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:17,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:38:17,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:17,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:38:17,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:38:17,270 INFO L87 Difference]: Start difference. First operand 400 states and 667 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-02-06 02:38:17,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:17,369 INFO L93 Difference]: Finished difference Result 1182 states and 1972 transitions. [2025-02-06 02:38:17,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:38:17,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 486 [2025-02-06 02:38:17,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:17,379 INFO L225 Difference]: With dead ends: 1182 [2025-02-06 02:38:17,379 INFO L226 Difference]: Without dead ends: 785 [2025-02-06 02:38:17,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:38:17,382 INFO L435 NwaCegarLoop]: 769 mSDtfsCounter, 385 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:17,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 1164 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:38:17,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2025-02-06 02:38:17,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 492. [2025-02-06 02:38:17,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 373 states have (on average 1.6058981233243967) internal successors, (599), 374 states have internal predecessors, (599), 116 states have call successors, (116), 2 states have call predecessors, (116), 2 states have return successors, (116), 115 states have call predecessors, (116), 116 states have call successors, (116) [2025-02-06 02:38:17,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 831 transitions. [2025-02-06 02:38:17,440 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 831 transitions. Word has length 486 [2025-02-06 02:38:17,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:17,443 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 831 transitions. [2025-02-06 02:38:17,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-02-06 02:38:17,443 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 831 transitions. [2025-02-06 02:38:17,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-02-06 02:38:17,449 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:17,449 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:17,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:38:17,450 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:17,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:17,451 INFO L85 PathProgramCache]: Analyzing trace with hash 416227972, now seen corresponding path program 1 times [2025-02-06 02:38:17,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:17,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517796595] [2025-02-06 02:38:17,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:17,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:17,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-02-06 02:38:17,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-02-06 02:38:17,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:17,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:17,935 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-02-06 02:38:17,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:17,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517796595] [2025-02-06 02:38:17,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517796595] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:17,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:17,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:38:17,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585503640] [2025-02-06 02:38:17,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:17,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:38:17,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:17,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:38:17,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:38:17,938 INFO L87 Difference]: Start difference. First operand 492 states and 831 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-02-06 02:38:17,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:17,982 INFO L93 Difference]: Finished difference Result 1247 states and 2138 transitions. [2025-02-06 02:38:17,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:38:17,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 486 [2025-02-06 02:38:17,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:17,987 INFO L225 Difference]: With dead ends: 1247 [2025-02-06 02:38:17,987 INFO L226 Difference]: Without dead ends: 758 [2025-02-06 02:38:17,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:38:17,989 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 194 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:17,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 987 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:38:17,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2025-02-06 02:38:18,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 492. [2025-02-06 02:38:18,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 373 states have (on average 1.6032171581769437) internal successors, (598), 374 states have internal predecessors, (598), 116 states have call successors, (116), 2 states have call predecessors, (116), 2 states have return successors, (116), 115 states have call predecessors, (116), 116 states have call successors, (116) [2025-02-06 02:38:18,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 830 transitions. [2025-02-06 02:38:18,019 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 830 transitions. Word has length 486 [2025-02-06 02:38:18,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:18,020 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 830 transitions. [2025-02-06 02:38:18,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-02-06 02:38:18,021 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 830 transitions. [2025-02-06 02:38:18,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-02-06 02:38:18,026 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:18,026 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:18,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:38:18,026 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:18,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:18,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1692805277, now seen corresponding path program 1 times [2025-02-06 02:38:18,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:18,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898222382] [2025-02-06 02:38:18,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:18,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:18,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-02-06 02:38:18,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-02-06 02:38:18,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:18,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:18,533 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-02-06 02:38:18,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:18,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898222382] [2025-02-06 02:38:18,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898222382] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:18,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:18,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:38:18,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139865809] [2025-02-06 02:38:18,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:18,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:38:18,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:18,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:38:18,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:38:18,539 INFO L87 Difference]: Start difference. First operand 492 states and 830 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-02-06 02:38:18,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:18,705 INFO L93 Difference]: Finished difference Result 1468 states and 2480 transitions. [2025-02-06 02:38:18,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:38:18,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 486 [2025-02-06 02:38:18,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:18,712 INFO L225 Difference]: With dead ends: 1468 [2025-02-06 02:38:18,713 INFO L226 Difference]: Without dead ends: 979 [2025-02-06 02:38:18,715 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-02-06 02:38:18,716 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 391 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:18,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 791 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:38:18,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2025-02-06 02:38:18,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 974. [2025-02-06 02:38:18,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 737 states have (on average 1.5956580732700136) internal successors, (1176), 739 states have internal predecessors, (1176), 232 states have call successors, (232), 4 states have call predecessors, (232), 4 states have return successors, (232), 230 states have call predecessors, (232), 232 states have call successors, (232) [2025-02-06 02:38:18,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1640 transitions. [2025-02-06 02:38:18,796 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1640 transitions. Word has length 486 [2025-02-06 02:38:18,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:18,797 INFO L471 AbstractCegarLoop]: Abstraction has 974 states and 1640 transitions. [2025-02-06 02:38:18,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-02-06 02:38:18,797 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1640 transitions. [2025-02-06 02:38:18,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-02-06 02:38:18,802 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:18,803 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:18,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:38:18,803 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:18,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:18,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1757690148, now seen corresponding path program 1 times [2025-02-06 02:38:18,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:18,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714636173] [2025-02-06 02:38:18,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:18,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:18,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-02-06 02:38:18,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-02-06 02:38:18,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:18,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:19,753 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-02-06 02:38:19,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:19,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714636173] [2025-02-06 02:38:19,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714636173] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:19,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:19,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:38:19,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987968711] [2025-02-06 02:38:19,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:19,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:38:19,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:19,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:38:19,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:38:19,756 INFO L87 Difference]: Start difference. First operand 974 states and 1640 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-02-06 02:38:20,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:20,835 INFO L93 Difference]: Finished difference Result 4335 states and 7268 transitions. [2025-02-06 02:38:20,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:38:20,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 486 [2025-02-06 02:38:20,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:20,856 INFO L225 Difference]: With dead ends: 4335 [2025-02-06 02:38:20,856 INFO L226 Difference]: Without dead ends: 3364 [2025-02-06 02:38:20,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-02-06 02:38:20,862 INFO L435 NwaCegarLoop]: 804 mSDtfsCounter, 969 mSDsluCounter, 1367 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 2171 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:20,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 2171 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 02:38:20,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3364 states. [2025-02-06 02:38:21,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3364 to 1964. [2025-02-06 02:38:21,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1964 states, 1523 states have (on average 1.6034143138542352) internal successors, (2442), 1529 states have internal predecessors, (2442), 432 states have call successors, (432), 8 states have call predecessors, (432), 8 states have return successors, (432), 426 states have call predecessors, (432), 432 states have call successors, (432) [2025-02-06 02:38:21,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 3306 transitions. [2025-02-06 02:38:21,042 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 3306 transitions. Word has length 486 [2025-02-06 02:38:21,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:21,043 INFO L471 AbstractCegarLoop]: Abstraction has 1964 states and 3306 transitions. [2025-02-06 02:38:21,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-02-06 02:38:21,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 3306 transitions. [2025-02-06 02:38:21,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-02-06 02:38:21,050 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:21,050 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:21,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:38:21,050 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:21,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:21,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1778027523, now seen corresponding path program 1 times [2025-02-06 02:38:21,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:21,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871752657] [2025-02-06 02:38:21,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:21,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:21,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-02-06 02:38:22,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-02-06 02:38:22,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:22,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:23,639 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-02-06 02:38:23,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:23,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871752657] [2025-02-06 02:38:23,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871752657] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:23,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:23,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:38:23,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600615847] [2025-02-06 02:38:23,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:23,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:38:23,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:23,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:38:23,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:38:23,641 INFO L87 Difference]: Start difference. First operand 1964 states and 3306 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) [2025-02-06 02:38:24,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:24,261 INFO L93 Difference]: Finished difference Result 5272 states and 8945 transitions. [2025-02-06 02:38:24,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:38:24,262 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) Word has length 486 [2025-02-06 02:38:24,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:24,281 INFO L225 Difference]: With dead ends: 5272 [2025-02-06 02:38:24,281 INFO L226 Difference]: Without dead ends: 3311 [2025-02-06 02:38:24,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:38:24,295 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 283 mSDsluCounter, 1416 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 1813 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:24,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 1813 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:38:24,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3311 states. [2025-02-06 02:38:24,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3311 to 2097. [2025-02-06 02:38:24,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2097 states, 1582 states have (on average 1.5847029077117574) internal successors, (2507), 1588 states have internal predecessors, (2507), 505 states have call successors, (505), 9 states have call predecessors, (505), 9 states have return successors, (505), 499 states have call predecessors, (505), 505 states have call successors, (505) [2025-02-06 02:38:24,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 2097 states and 3517 transitions. [2025-02-06 02:38:24,479 INFO L78 Accepts]: Start accepts. Automaton has 2097 states and 3517 transitions. Word has length 486 [2025-02-06 02:38:24,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:24,480 INFO L471 AbstractCegarLoop]: Abstraction has 2097 states and 3517 transitions. [2025-02-06 02:38:24,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) [2025-02-06 02:38:24,480 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 3517 transitions. [2025-02-06 02:38:24,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2025-02-06 02:38:24,483 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:24,484 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:24,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:38:24,484 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:24,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:24,484 INFO L85 PathProgramCache]: Analyzing trace with hash -193793666, now seen corresponding path program 1 times [2025-02-06 02:38:24,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:24,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208624166] [2025-02-06 02:38:24,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:24,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:24,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-02-06 02:38:26,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-02-06 02:38:26,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:26,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:26,631 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 6 proven. 210 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-02-06 02:38:26,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:26,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208624166] [2025-02-06 02:38:26,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208624166] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:38:26,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193899610] [2025-02-06 02:38:26,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:26,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:38:26,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:38:26,635 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:38:26,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 02:38:26,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-02-06 02:38:26,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-02-06 02:38:26,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:26,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:26,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 1210 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:38:26,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:38:27,494 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 4626 proven. 147 refuted. 0 times theorem prover too weak. 5739 trivial. 0 not checked. [2025-02-06 02:38:27,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:38:27,972 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 69 proven. 147 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-02-06 02:38:27,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193899610] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:38:27,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:38:27,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 13 [2025-02-06 02:38:27,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812881154] [2025-02-06 02:38:27,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:38:27,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 02:38:27,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:27,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 02:38:27,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-02-06 02:38:27,976 INFO L87 Difference]: Start difference. First operand 2097 states and 3517 transitions. Second operand has 13 states, 13 states have (on average 23.615384615384617) internal successors, (307), 13 states have internal predecessors, (307), 5 states have call successors, (192), 2 states have call predecessors, (192), 4 states have return successors, (194), 5 states have call predecessors, (194), 5 states have call successors, (194) [2025-02-06 02:38:28,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:28,843 INFO L93 Difference]: Finished difference Result 4184 states and 6919 transitions. [2025-02-06 02:38:28,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 02:38:28,844 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 23.615384615384617) internal successors, (307), 13 states have internal predecessors, (307), 5 states have call successors, (192), 2 states have call predecessors, (192), 4 states have return successors, (194), 5 states have call predecessors, (194), 5 states have call successors, (194) Word has length 488 [2025-02-06 02:38:28,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:28,856 INFO L225 Difference]: With dead ends: 4184 [2025-02-06 02:38:28,856 INFO L226 Difference]: Without dead ends: 2223 [2025-02-06 02:38:28,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 997 GetRequests, 974 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2025-02-06 02:38:28,861 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 1297 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1298 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 1286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:28,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1298 Valid, 1166 Invalid, 1286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 02:38:28,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2223 states. [2025-02-06 02:38:28,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2223 to 2205. [2025-02-06 02:38:28,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2205 states, 1663 states have (on average 1.5249549007817198) internal successors, (2536), 1669 states have internal predecessors, (2536), 505 states have call successors, (505), 36 states have call predecessors, (505), 36 states have return successors, (505), 499 states have call predecessors, (505), 505 states have call successors, (505) [2025-02-06 02:38:28,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 3546 transitions. [2025-02-06 02:38:28,983 INFO L78 Accepts]: Start accepts. Automaton has 2205 states and 3546 transitions. Word has length 488 [2025-02-06 02:38:28,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:28,984 INFO L471 AbstractCegarLoop]: Abstraction has 2205 states and 3546 transitions. [2025-02-06 02:38:28,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 23.615384615384617) internal successors, (307), 13 states have internal predecessors, (307), 5 states have call successors, (192), 2 states have call predecessors, (192), 4 states have return successors, (194), 5 states have call predecessors, (194), 5 states have call successors, (194) [2025-02-06 02:38:28,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 3546 transitions. [2025-02-06 02:38:28,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2025-02-06 02:38:28,988 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:28,989 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:28,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 02:38:29,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:38:29,191 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:29,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:29,191 INFO L85 PathProgramCache]: Analyzing trace with hash -229780612, now seen corresponding path program 1 times [2025-02-06 02:38:29,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:29,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177556129] [2025-02-06 02:38:29,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:29,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:29,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-02-06 02:38:29,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-02-06 02:38:29,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:29,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:31,290 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-02-06 02:38:31,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:31,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177556129] [2025-02-06 02:38:31,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177556129] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:31,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:31,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 02:38:31,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130639087] [2025-02-06 02:38:31,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:31,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:38:31,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:31,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:38:31,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:38:31,293 INFO L87 Difference]: Start difference. First operand 2205 states and 3546 transitions. Second operand has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 3 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 3 states have call predecessors, (73), 3 states have call successors, (73) [2025-02-06 02:38:32,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:32,271 INFO L93 Difference]: Finished difference Result 6182 states and 10184 transitions. [2025-02-06 02:38:32,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 02:38:32,272 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 3 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 3 states have call predecessors, (73), 3 states have call successors, (73) Word has length 488 [2025-02-06 02:38:32,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:32,291 INFO L225 Difference]: With dead ends: 6182 [2025-02-06 02:38:32,291 INFO L226 Difference]: Without dead ends: 3869 [2025-02-06 02:38:32,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-02-06 02:38:32,302 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 724 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 1741 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:32,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 1741 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 02:38:32,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3869 states. [2025-02-06 02:38:32,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3869 to 2631. [2025-02-06 02:38:32,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2631 states, 2089 states have (on average 1.5634274772618477) internal successors, (3266), 2095 states have internal predecessors, (3266), 505 states have call successors, (505), 36 states have call predecessors, (505), 36 states have return successors, (505), 499 states have call predecessors, (505), 505 states have call successors, (505) [2025-02-06 02:38:32,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2631 states and 4276 transitions. [2025-02-06 02:38:32,465 INFO L78 Accepts]: Start accepts. Automaton has 2631 states and 4276 transitions. Word has length 488 [2025-02-06 02:38:32,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:32,466 INFO L471 AbstractCegarLoop]: Abstraction has 2631 states and 4276 transitions. [2025-02-06 02:38:32,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 3 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 3 states have call predecessors, (73), 3 states have call successors, (73) [2025-02-06 02:38:32,467 INFO L276 IsEmpty]: Start isEmpty. Operand 2631 states and 4276 transitions. [2025-02-06 02:38:32,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2025-02-06 02:38:32,471 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:32,471 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:32,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:38:32,471 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:32,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:32,472 INFO L85 PathProgramCache]: Analyzing trace with hash -735170501, now seen corresponding path program 1 times [2025-02-06 02:38:32,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:32,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585834648] [2025-02-06 02:38:32,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:32,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:32,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-02-06 02:38:32,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-02-06 02:38:32,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:32,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:33,187 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-02-06 02:38:33,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:33,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585834648] [2025-02-06 02:38:33,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585834648] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:33,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:33,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:38:33,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731427830] [2025-02-06 02:38:33,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:33,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:38:33,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:33,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:38:33,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:38:33,189 INFO L87 Difference]: Start difference. First operand 2631 states and 4276 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-02-06 02:38:33,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:33,844 INFO L93 Difference]: Finished difference Result 6986 states and 11542 transitions. [2025-02-06 02:38:33,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:38:33,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 489 [2025-02-06 02:38:33,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:33,867 INFO L225 Difference]: With dead ends: 6986 [2025-02-06 02:38:33,867 INFO L226 Difference]: Without dead ends: 4929 [2025-02-06 02:38:33,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:38:33,876 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 563 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1654 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:33,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1654 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:38:33,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4929 states. [2025-02-06 02:38:34,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4929 to 2633. [2025-02-06 02:38:34,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2633 states, 2091 states have (on average 1.5628885700621713) internal successors, (3268), 2097 states have internal predecessors, (3268), 505 states have call successors, (505), 36 states have call predecessors, (505), 36 states have return successors, (505), 499 states have call predecessors, (505), 505 states have call successors, (505) [2025-02-06 02:38:34,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2633 states and 4278 transitions. [2025-02-06 02:38:34,058 INFO L78 Accepts]: Start accepts. Automaton has 2633 states and 4278 transitions. Word has length 489 [2025-02-06 02:38:34,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:34,059 INFO L471 AbstractCegarLoop]: Abstraction has 2633 states and 4278 transitions. [2025-02-06 02:38:34,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-02-06 02:38:34,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 4278 transitions. [2025-02-06 02:38:34,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2025-02-06 02:38:34,064 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:34,064 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:34,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:38:34,064 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:34,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:34,065 INFO L85 PathProgramCache]: Analyzing trace with hash 569223228, now seen corresponding path program 1 times [2025-02-06 02:38:34,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:34,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365866937] [2025-02-06 02:38:34,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:34,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:34,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-02-06 02:38:36,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-02-06 02:38:36,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:36,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:36,381 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 24 proven. 192 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-02-06 02:38:36,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:36,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365866937] [2025-02-06 02:38:36,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365866937] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:38:36,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315864391] [2025-02-06 02:38:36,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:36,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:38:36,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:38:36,384 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:38:36,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 02:38:36,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-02-06 02:38:36,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-02-06 02:38:36,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:36,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:36,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 1208 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:38:36,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:38:36,919 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 3436 proven. 42 refuted. 0 times theorem prover too weak. 7034 trivial. 0 not checked. [2025-02-06 02:38:36,919 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:38:37,365 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 174 proven. 42 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-02-06 02:38:37,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315864391] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:38:37,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:38:37,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-02-06 02:38:37,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854236697] [2025-02-06 02:38:37,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:38:37,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:38:37,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:37,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:38:37,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:38:37,368 INFO L87 Difference]: Start difference. First operand 2633 states and 4278 transitions. Second operand has 9 states, 9 states have (on average 25.11111111111111) internal successors, (226), 9 states have internal predecessors, (226), 4 states have call successors, (160), 2 states have call predecessors, (160), 4 states have return successors, (161), 4 states have call predecessors, (161), 4 states have call successors, (161) [2025-02-06 02:38:38,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:38,305 INFO L93 Difference]: Finished difference Result 4603 states and 7408 transitions. [2025-02-06 02:38:38,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 02:38:38,309 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 25.11111111111111) internal successors, (226), 9 states have internal predecessors, (226), 4 states have call successors, (160), 2 states have call predecessors, (160), 4 states have return successors, (161), 4 states have call predecessors, (161), 4 states have call successors, (161) Word has length 489 [2025-02-06 02:38:38,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:38,329 INFO L225 Difference]: With dead ends: 4603 [2025-02-06 02:38:38,329 INFO L226 Difference]: Without dead ends: 2290 [2025-02-06 02:38:38,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 998 GetRequests, 975 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2025-02-06 02:38:38,339 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 1383 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 587 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1440 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 587 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:38,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1440 Valid, 1372 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [587 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 02:38:38,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2290 states. [2025-02-06 02:38:38,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2290 to 2208. [2025-02-06 02:38:38,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2208 states, 1624 states have (on average 1.4901477832512315) internal successors, (2420), 1628 states have internal predecessors, (2420), 537 states have call successors, (537), 46 states have call predecessors, (537), 46 states have return successors, (537), 533 states have call predecessors, (537), 537 states have call successors, (537) [2025-02-06 02:38:38,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2208 states to 2208 states and 3494 transitions. [2025-02-06 02:38:38,481 INFO L78 Accepts]: Start accepts. Automaton has 2208 states and 3494 transitions. Word has length 489 [2025-02-06 02:38:38,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:38,482 INFO L471 AbstractCegarLoop]: Abstraction has 2208 states and 3494 transitions. [2025-02-06 02:38:38,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 25.11111111111111) internal successors, (226), 9 states have internal predecessors, (226), 4 states have call successors, (160), 2 states have call predecessors, (160), 4 states have return successors, (161), 4 states have call predecessors, (161), 4 states have call successors, (161) [2025-02-06 02:38:38,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2208 states and 3494 transitions. [2025-02-06 02:38:38,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2025-02-06 02:38:38,485 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:38,485 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:38,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 02:38:38,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:38:38,687 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:38,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:38,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1289229954, now seen corresponding path program 1 times [2025-02-06 02:38:38,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:38,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786183202] [2025-02-06 02:38:38,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:38,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:38,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-02-06 02:38:38,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-02-06 02:38:38,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:38,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:39,421 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-02-06 02:38:39,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:39,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786183202] [2025-02-06 02:38:39,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786183202] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:39,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:39,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:38:39,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18662756] [2025-02-06 02:38:39,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:39,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:38:39,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:39,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:38:39,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:38:39,424 INFO L87 Difference]: Start difference. First operand 2208 states and 3494 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-02-06 02:38:40,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:40,558 INFO L93 Difference]: Finished difference Result 8588 states and 13609 transitions. [2025-02-06 02:38:40,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:38:40,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 489 [2025-02-06 02:38:40,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:40,578 INFO L225 Difference]: With dead ends: 8588 [2025-02-06 02:38:40,578 INFO L226 Difference]: Without dead ends: 6688 [2025-02-06 02:38:40,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:38:40,583 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 1110 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 465 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 465 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:40,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 1427 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [465 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 02:38:40,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6688 states. [2025-02-06 02:38:41,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6688 to 4498. [2025-02-06 02:38:41,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4498 states, 3485 states have (on average 1.527403156384505) internal successors, (5323), 3497 states have internal predecessors, (5323), 929 states have call successors, (929), 83 states have call predecessors, (929), 83 states have return successors, (929), 917 states have call predecessors, (929), 929 states have call successors, (929) [2025-02-06 02:38:41,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4498 states to 4498 states and 7181 transitions. [2025-02-06 02:38:41,041 INFO L78 Accepts]: Start accepts. Automaton has 4498 states and 7181 transitions. Word has length 489 [2025-02-06 02:38:41,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:41,042 INFO L471 AbstractCegarLoop]: Abstraction has 4498 states and 7181 transitions. [2025-02-06 02:38:41,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-02-06 02:38:41,042 INFO L276 IsEmpty]: Start isEmpty. Operand 4498 states and 7181 transitions. [2025-02-06 02:38:41,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2025-02-06 02:38:41,046 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:41,047 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:41,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:38:41,047 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:41,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:41,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1324467523, now seen corresponding path program 1 times [2025-02-06 02:38:41,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:41,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226130301] [2025-02-06 02:38:41,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:41,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:41,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-02-06 02:38:41,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-02-06 02:38:41,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:41,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:41,658 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-02-06 02:38:41,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:41,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226130301] [2025-02-06 02:38:41,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226130301] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:41,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:41,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:38:41,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313114153] [2025-02-06 02:38:41,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:41,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:38:41,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:41,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:38:41,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:38:41,661 INFO L87 Difference]: Start difference. First operand 4498 states and 7181 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-02-06 02:38:42,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:42,678 INFO L93 Difference]: Finished difference Result 15632 states and 24720 transitions. [2025-02-06 02:38:42,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:38:42,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 489 [2025-02-06 02:38:42,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:42,724 INFO L225 Difference]: With dead ends: 15632 [2025-02-06 02:38:42,724 INFO L226 Difference]: Without dead ends: 11198 [2025-02-06 02:38:42,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:38:42,738 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 562 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:42,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 1302 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:38:42,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11198 states. [2025-02-06 02:38:43,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11198 to 9146. [2025-02-06 02:38:43,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9146 states, 7269 states have (on average 1.5279955977438437) internal successors, (11107), 7297 states have internal predecessors, (11107), 1721 states have call successors, (1721), 155 states have call predecessors, (1721), 155 states have return successors, (1721), 1693 states have call predecessors, (1721), 1721 states have call successors, (1721) [2025-02-06 02:38:43,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9146 states to 9146 states and 14549 transitions. [2025-02-06 02:38:43,330 INFO L78 Accepts]: Start accepts. Automaton has 9146 states and 14549 transitions. Word has length 489 [2025-02-06 02:38:43,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:43,331 INFO L471 AbstractCegarLoop]: Abstraction has 9146 states and 14549 transitions. [2025-02-06 02:38:43,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-02-06 02:38:43,331 INFO L276 IsEmpty]: Start isEmpty. Operand 9146 states and 14549 transitions. [2025-02-06 02:38:43,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2025-02-06 02:38:43,340 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:43,340 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:43,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 02:38:43,340 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:43,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:43,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1580336093, now seen corresponding path program 1 times [2025-02-06 02:38:43,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:43,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970322999] [2025-02-06 02:38:43,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:43,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:43,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-02-06 02:38:43,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-02-06 02:38:43,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:43,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:43,473 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-02-06 02:38:43,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:43,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970322999] [2025-02-06 02:38:43,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970322999] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:43,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:43,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:38:43,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029418033] [2025-02-06 02:38:43,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:43,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:38:43,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:43,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:38:43,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:38:43,476 INFO L87 Difference]: Start difference. First operand 9146 states and 14549 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-02-06 02:38:43,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:43,942 INFO L93 Difference]: Finished difference Result 16952 states and 26929 transitions. [2025-02-06 02:38:43,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:38:43,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 489 [2025-02-06 02:38:43,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:43,971 INFO L225 Difference]: With dead ends: 16952 [2025-02-06 02:38:43,971 INFO L226 Difference]: Without dead ends: 8852 [2025-02-06 02:38:43,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:38:43,988 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 344 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:43,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 978 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:38:43,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8852 states. [2025-02-06 02:38:44,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8852 to 8528. [2025-02-06 02:38:44,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8528 states, 6579 states have (on average 1.5116279069767442) internal successors, (9945), 6603 states have internal predecessors, (9945), 1785 states have call successors, (1785), 163 states have call predecessors, (1785), 163 states have return successors, (1785), 1761 states have call predecessors, (1785), 1785 states have call successors, (1785) [2025-02-06 02:38:44,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8528 states to 8528 states and 13515 transitions. [2025-02-06 02:38:44,721 INFO L78 Accepts]: Start accepts. Automaton has 8528 states and 13515 transitions. Word has length 489 [2025-02-06 02:38:44,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:44,722 INFO L471 AbstractCegarLoop]: Abstraction has 8528 states and 13515 transitions. [2025-02-06 02:38:44,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-02-06 02:38:44,722 INFO L276 IsEmpty]: Start isEmpty. Operand 8528 states and 13515 transitions. [2025-02-06 02:38:44,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2025-02-06 02:38:44,731 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:44,731 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:44,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 02:38:44,732 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:44,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:44,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1325599548, now seen corresponding path program 1 times [2025-02-06 02:38:44,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:44,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857640376] [2025-02-06 02:38:44,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:44,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:44,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-02-06 02:38:45,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-02-06 02:38:45,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:45,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:45,493 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-02-06 02:38:45,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:45,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857640376] [2025-02-06 02:38:45,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857640376] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:45,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:45,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:38:45,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604993633] [2025-02-06 02:38:45,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:45,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:38:45,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:45,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:38:45,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:38:45,495 INFO L87 Difference]: Start difference. First operand 8528 states and 13515 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-02-06 02:38:46,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:46,239 INFO L93 Difference]: Finished difference Result 18944 states and 29691 transitions. [2025-02-06 02:38:46,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:38:46,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 489 [2025-02-06 02:38:46,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:46,285 INFO L225 Difference]: With dead ends: 18944 [2025-02-06 02:38:46,285 INFO L226 Difference]: Without dead ends: 11402 [2025-02-06 02:38:46,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:38:46,306 INFO L435 NwaCegarLoop]: 700 mSDtfsCounter, 548 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:46,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1104 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:38:46,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11402 states. [2025-02-06 02:38:46,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11402 to 8840. [2025-02-06 02:38:46,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8840 states, 6859 states have (on average 1.5053214754337367) internal successors, (10325), 6883 states have internal predecessors, (10325), 1785 states have call successors, (1785), 195 states have call predecessors, (1785), 195 states have return successors, (1785), 1761 states have call predecessors, (1785), 1785 states have call successors, (1785) [2025-02-06 02:38:46,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 13895 transitions. [2025-02-06 02:38:46,960 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 13895 transitions. Word has length 489 [2025-02-06 02:38:46,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:46,961 INFO L471 AbstractCegarLoop]: Abstraction has 8840 states and 13895 transitions. [2025-02-06 02:38:46,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-02-06 02:38:46,961 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 13895 transitions. [2025-02-06 02:38:46,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2025-02-06 02:38:46,969 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:46,969 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:46,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 02:38:46,969 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:46,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:46,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1345936923, now seen corresponding path program 1 times [2025-02-06 02:38:46,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:46,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343351894] [2025-02-06 02:38:46,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:46,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:46,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes.