./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-4.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_fillercode_fillercodesize_ps-cn-250_file-4.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 f125cc7aacd874cf038c23c1026e9d4800627ec1cff77d2b841e959e87f90682 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:35:20,044 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:35:20,103 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:35:20,110 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:35:20,110 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:35:20,139 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:35:20,140 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:35:20,140 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:35:20,140 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:35:20,141 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:35:20,141 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:35:20,142 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:35:20,142 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:35:20,142 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:35:20,142 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:35:20,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:35:20,143 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:35:20,143 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:35:20,143 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:35:20,143 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:35:20,143 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:35:20,144 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:35:20,144 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:35:20,144 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:35:20,144 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:35:20,144 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:35:20,144 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:35:20,144 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:35:20,144 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:35:20,144 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:35:20,144 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:35:20,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:35:20,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:35:20,145 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:35:20,145 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:35:20,145 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:35:20,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:35:20,146 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:35:20,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:35:20,146 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:35:20,146 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:35:20,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:35:20,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:35:20,146 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 -> f125cc7aacd874cf038c23c1026e9d4800627ec1cff77d2b841e959e87f90682 [2025-02-05 21:35:20,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:35:20,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:35:20,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:35:20,445 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:35:20,445 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:35:20,447 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-4.i [2025-02-05 21:35:21,763 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8491aa05b/e66b4579d852427e9cedb218b82ef5ba/FLAGb68aa905c [2025-02-05 21:35:22,076 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:35:22,077 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-4.i [2025-02-05 21:35:22,090 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8491aa05b/e66b4579d852427e9cedb218b82ef5ba/FLAGb68aa905c [2025-02-05 21:35:22,106 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8491aa05b/e66b4579d852427e9cedb218b82ef5ba [2025-02-05 21:35:22,110 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:35:22,111 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:35:22,113 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:35:22,113 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:35:22,117 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:35:22,117 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:35:22" (1/1) ... [2025-02-05 21:35:22,118 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ce8d7d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:35:22, skipping insertion in model container [2025-02-05 21:35:22,119 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:35:22" (1/1) ... [2025-02-05 21:35:22,148 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:35:22,290 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_fillercode_fillercodesize_ps-cn-250_file-4.i[915,928] [2025-02-05 21:35:22,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:35:22,418 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:35:22,427 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_fillercode_fillercodesize_ps-cn-250_file-4.i[915,928] [2025-02-05 21:35:22,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:35:22,517 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:35:22,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:35:22 WrapperNode [2025-02-05 21:35:22,518 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:35:22,519 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:35:22,520 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:35:22,520 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:35:22,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:35:22" (1/1) ... [2025-02-05 21:35:22,545 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:35:22" (1/1) ... [2025-02-05 21:35:22,604 INFO L138 Inliner]: procedures = 26, calls = 86, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 501 [2025-02-05 21:35:22,605 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:35:22,605 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:35:22,607 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:35:22,607 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:35:22,615 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:35:22" (1/1) ... [2025-02-05 21:35:22,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:35:22" (1/1) ... [2025-02-05 21:35:22,627 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:35:22" (1/1) ... [2025-02-05 21:35:22,653 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 21:35:22,654 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:35:22" (1/1) ... [2025-02-05 21:35:22,654 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:35:22" (1/1) ... [2025-02-05 21:35:22,669 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:35:22" (1/1) ... [2025-02-05 21:35:22,671 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:35:22" (1/1) ... [2025-02-05 21:35:22,675 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:35:22" (1/1) ... [2025-02-05 21:35:22,678 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:35:22" (1/1) ... [2025-02-05 21:35:22,684 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:35:22,685 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:35:22,685 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:35:22,685 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:35:22,686 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:35:22" (1/1) ... [2025-02-05 21:35:22,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:35:22,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:35:22,720 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 21:35:22,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 21:35:22,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:35:22,746 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:35:22,746 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:35:22,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:35:22,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:35:22,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:35:22,881 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:35:22,883 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:35:23,694 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-02-05 21:35:23,695 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:35:23,732 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:35:23,736 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:35:23,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:35:23 BoogieIcfgContainer [2025-02-05 21:35:23,736 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:35:23,739 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:35:23,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:35:23,744 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:35:23,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:35:22" (1/3) ... [2025-02-05 21:35:23,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b42e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:35:23, skipping insertion in model container [2025-02-05 21:35:23,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:35:22" (2/3) ... [2025-02-05 21:35:23,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b42e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:35:23, skipping insertion in model container [2025-02-05 21:35:23,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:35:23" (3/3) ... [2025-02-05 21:35:23,748 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-4.i [2025-02-05 21:35:23,764 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:35:23,769 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-4.i that has 2 procedures, 215 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:35:23,843 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:35:23,854 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;@2963b643, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:35:23,855 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:35:23,861 INFO L276 IsEmpty]: Start isEmpty. Operand has 215 states, 139 states have (on average 1.525179856115108) internal successors, (212), 140 states have internal predecessors, (212), 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-05 21:35:23,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-02-05 21:35:23,891 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:23,892 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] [2025-02-05 21:35:23,892 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:23,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:23,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1072257361, now seen corresponding path program 1 times [2025-02-05 21:35:23,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:23,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114361962] [2025-02-05 21:35:23,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:23,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:24,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-02-05 21:35:24,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-02-05 21:35:24,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:24,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:24,547 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-05 21:35:24,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:24,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114361962] [2025-02-05 21:35:24,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114361962] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:35:24,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926608230] [2025-02-05 21:35:24,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:24,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:35:24,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:35:24,555 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:35:24,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 21:35:24,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-02-05 21:35:24,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-02-05 21:35:24,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:24,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:24,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 1014 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:35:24,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:35:24,958 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-05 21:35:24,958 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:35:24,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926608230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:35:24,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:35:24,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:35:24,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924641835] [2025-02-05 21:35:24,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:35:24,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:35:24,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:24,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:35:24,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:35:24,987 INFO L87 Difference]: Start difference. First operand has 215 states, 139 states have (on average 1.525179856115108) internal successors, (212), 140 states have internal predecessors, (212), 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 48.0) internal successors, (96), 2 states have internal predecessors, (96), 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-05 21:35:25,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:25,059 INFO L93 Difference]: Finished difference Result 423 states and 782 transitions. [2025-02-05 21:35:25,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:35:25,062 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 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 456 [2025-02-05 21:35:25,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:25,070 INFO L225 Difference]: With dead ends: 423 [2025-02-05 21:35:25,071 INFO L226 Difference]: Without dead ends: 211 [2025-02-05 21:35:25,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 457 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:35:25,079 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:25,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 341 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:35:25,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-02-05 21:35:25,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2025-02-05 21:35:25,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 136 states have (on average 1.4779411764705883) internal successors, (201), 136 states have internal predecessors, (201), 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-05 21:35:25,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 347 transitions. [2025-02-05 21:35:25,157 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 347 transitions. Word has length 456 [2025-02-05 21:35:25,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:25,158 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 347 transitions. [2025-02-05 21:35:25,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 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-05 21:35:25,159 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 347 transitions. [2025-02-05 21:35:25,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-02-05 21:35:25,171 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:25,172 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] [2025-02-05 21:35:25,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 21:35:25,373 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-05 21:35:25,373 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:25,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:25,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1256206071, now seen corresponding path program 1 times [2025-02-05 21:35:25,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:25,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426288708] [2025-02-05 21:35:25,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:25,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:25,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-02-05 21:35:25,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-02-05 21:35:25,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:25,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:25,881 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-05 21:35:25,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:25,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426288708] [2025-02-05 21:35:25,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426288708] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:35:25,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:35:25,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:35:25,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186869285] [2025-02-05 21:35:25,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:35:25,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:35:25,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:25,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:35:25,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:35:25,888 INFO L87 Difference]: Start difference. First operand 211 states and 347 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-05 21:35:26,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:26,001 INFO L93 Difference]: Finished difference Result 552 states and 911 transitions. [2025-02-05 21:35:26,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:35:26,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 457 [2025-02-05 21:35:26,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:26,007 INFO L225 Difference]: With dead ends: 552 [2025-02-05 21:35:26,007 INFO L226 Difference]: Without dead ends: 344 [2025-02-05 21:35:26,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:35:26,009 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 222 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:26,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 871 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:35:26,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-02-05 21:35:26,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 341. [2025-02-05 21:35:26,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 234 states have (on average 1.5128205128205128) internal successors, (354), 235 states have internal predecessors, (354), 104 states have call successors, (104), 2 states have call predecessors, (104), 2 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-02-05 21:35:26,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 562 transitions. [2025-02-05 21:35:26,053 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 562 transitions. Word has length 457 [2025-02-05 21:35:26,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:26,054 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 562 transitions. [2025-02-05 21:35:26,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-05 21:35:26,055 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 562 transitions. [2025-02-05 21:35:26,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-02-05 21:35:26,061 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:26,061 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] [2025-02-05 21:35:26,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:35:26,061 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:26,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:26,062 INFO L85 PathProgramCache]: Analyzing trace with hash 807509432, now seen corresponding path program 1 times [2025-02-05 21:35:26,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:26,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065438271] [2025-02-05 21:35:26,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:26,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:26,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-02-05 21:35:26,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-02-05 21:35:26,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:26,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:26,769 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-05 21:35:26,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:26,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065438271] [2025-02-05 21:35:26,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065438271] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:35:26,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:35:26,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:35:26,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796567364] [2025-02-05 21:35:26,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:35:26,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:35:26,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:26,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:35:26,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:35:26,777 INFO L87 Difference]: Start difference. First operand 341 states and 562 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-05 21:35:26,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:26,884 INFO L93 Difference]: Finished difference Result 871 states and 1443 transitions. [2025-02-05 21:35:26,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:35:26,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 457 [2025-02-05 21:35:26,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:26,897 INFO L225 Difference]: With dead ends: 871 [2025-02-05 21:35:26,897 INFO L226 Difference]: Without dead ends: 533 [2025-02-05 21:35:26,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:35:26,901 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 342 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:26,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 867 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:35:26,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-02-05 21:35:26,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 341. [2025-02-05 21:35:26,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 234 states have (on average 1.5042735042735043) internal successors, (352), 235 states have internal predecessors, (352), 104 states have call successors, (104), 2 states have call predecessors, (104), 2 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-02-05 21:35:26,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 560 transitions. [2025-02-05 21:35:26,990 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 560 transitions. Word has length 457 [2025-02-05 21:35:26,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:26,993 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 560 transitions. [2025-02-05 21:35:26,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-05 21:35:26,993 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 560 transitions. [2025-02-05 21:35:27,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-02-05 21:35:27,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:27,004 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] [2025-02-05 21:35:27,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:35:27,004 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:27,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:27,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1536790649, now seen corresponding path program 1 times [2025-02-05 21:35:27,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:27,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464914777] [2025-02-05 21:35:27,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:27,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:27,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-02-05 21:35:27,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-02-05 21:35:27,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:27,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:28,743 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-05 21:35:28,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:28,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464914777] [2025-02-05 21:35:28,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464914777] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:35:28,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:35:28,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:35:28,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016448809] [2025-02-05 21:35:28,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:35:28,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:35:28,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:28,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:35:28,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:35:28,747 INFO L87 Difference]: Start difference. First operand 341 states and 560 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 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-05 21:35:30,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:30,453 INFO L93 Difference]: Finished difference Result 1518 states and 2490 transitions. [2025-02-05 21:35:30,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:35:30,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 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 458 [2025-02-05 21:35:30,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:30,466 INFO L225 Difference]: With dead ends: 1518 [2025-02-05 21:35:30,467 INFO L226 Difference]: Without dead ends: 1180 [2025-02-05 21:35:30,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:35:30,471 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 792 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 399 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 399 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:30,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 1120 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [399 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 21:35:30,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2025-02-05 21:35:30,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1167. [2025-02-05 21:35:30,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 803 states have (on average 1.4956413449564134) internal successors, (1201), 809 states have internal predecessors, (1201), 355 states have call successors, (355), 8 states have call predecessors, (355), 8 states have return successors, (355), 349 states have call predecessors, (355), 355 states have call successors, (355) [2025-02-05 21:35:30,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1911 transitions. [2025-02-05 21:35:30,680 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1911 transitions. Word has length 458 [2025-02-05 21:35:30,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:30,683 INFO L471 AbstractCegarLoop]: Abstraction has 1167 states and 1911 transitions. [2025-02-05 21:35:30,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 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-05 21:35:30,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1911 transitions. [2025-02-05 21:35:30,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-02-05 21:35:30,695 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:30,695 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] [2025-02-05 21:35:30,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:35:30,696 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:30,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:30,697 INFO L85 PathProgramCache]: Analyzing trace with hash 755544872, now seen corresponding path program 1 times [2025-02-05 21:35:30,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:30,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399628733] [2025-02-05 21:35:30,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:30,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:30,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-02-05 21:35:30,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-02-05 21:35:30,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:30,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:31,497 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-05 21:35:31,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:31,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399628733] [2025-02-05 21:35:31,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399628733] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:35:31,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:35:31,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:35:31,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845429234] [2025-02-05 21:35:31,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:35:31,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:35:31,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:31,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:35:31,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:35:31,502 INFO L87 Difference]: Start difference. First operand 1167 states and 1911 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 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-05 21:35:33,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:33,006 INFO L93 Difference]: Finished difference Result 6829 states and 11175 transitions. [2025-02-05 21:35:33,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 21:35:33,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 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 458 [2025-02-05 21:35:33,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:33,050 INFO L225 Difference]: With dead ends: 6829 [2025-02-05 21:35:33,051 INFO L226 Difference]: Without dead ends: 5665 [2025-02-05 21:35:33,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:35:33,059 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 1447 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1447 SdHoareTripleChecker+Valid, 1766 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:33,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1447 Valid, 1766 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 21:35:33,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5665 states. [2025-02-05 21:35:33,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5665 to 4383. [2025-02-05 21:35:33,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4383 states, 3044 states have (on average 1.4993429697766096) internal successors, (4564), 3072 states have internal predecessors, (4564), 1306 states have call successors, (1306), 32 states have call predecessors, (1306), 32 states have return successors, (1306), 1278 states have call predecessors, (1306), 1306 states have call successors, (1306) [2025-02-05 21:35:33,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4383 states to 4383 states and 7176 transitions. [2025-02-05 21:35:33,660 INFO L78 Accepts]: Start accepts. Automaton has 4383 states and 7176 transitions. Word has length 458 [2025-02-05 21:35:33,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:33,663 INFO L471 AbstractCegarLoop]: Abstraction has 4383 states and 7176 transitions. [2025-02-05 21:35:33,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 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-05 21:35:33,664 INFO L276 IsEmpty]: Start isEmpty. Operand 4383 states and 7176 transitions. [2025-02-05 21:35:33,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-02-05 21:35:33,676 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:33,677 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] [2025-02-05 21:35:33,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:35:33,678 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:33,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:33,680 INFO L85 PathProgramCache]: Analyzing trace with hash -2077842425, now seen corresponding path program 1 times [2025-02-05 21:35:33,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:33,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420347784] [2025-02-05 21:35:33,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:33,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:33,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-02-05 21:35:33,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-02-05 21:35:33,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:33,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:34,740 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-05 21:35:34,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:34,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420347784] [2025-02-05 21:35:34,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420347784] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:35:34,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:35:34,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:35:34,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679849046] [2025-02-05 21:35:34,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:35:34,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:35:34,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:34,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:35:34,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:35:34,745 INFO L87 Difference]: Start difference. First operand 4383 states and 7176 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 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-05 21:35:35,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:35,303 INFO L93 Difference]: Finished difference Result 9535 states and 15407 transitions. [2025-02-05 21:35:35,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:35:35,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 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 458 [2025-02-05 21:35:35,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:35,348 INFO L225 Difference]: With dead ends: 9535 [2025-02-05 21:35:35,349 INFO L226 Difference]: Without dead ends: 5155 [2025-02-05 21:35:35,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:35:35,369 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 38 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:35,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 974 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:35:35,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5155 states. [2025-02-05 21:35:35,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5155 to 4703. [2025-02-05 21:35:35,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4703 states, 3364 states have (on average 1.4994054696789536) internal successors, (5044), 3392 states have internal predecessors, (5044), 1306 states have call successors, (1306), 32 states have call predecessors, (1306), 32 states have return successors, (1306), 1278 states have call predecessors, (1306), 1306 states have call successors, (1306) [2025-02-05 21:35:35,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4703 states to 4703 states and 7656 transitions. [2025-02-05 21:35:35,946 INFO L78 Accepts]: Start accepts. Automaton has 4703 states and 7656 transitions. Word has length 458 [2025-02-05 21:35:35,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:35,947 INFO L471 AbstractCegarLoop]: Abstraction has 4703 states and 7656 transitions. [2025-02-05 21:35:35,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 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-05 21:35:35,947 INFO L276 IsEmpty]: Start isEmpty. Operand 4703 states and 7656 transitions. [2025-02-05 21:35:35,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-02-05 21:35:35,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:35,960 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] [2025-02-05 21:35:35,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:35:35,960 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:35,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:35,961 INFO L85 PathProgramCache]: Analyzing trace with hash -2076918904, now seen corresponding path program 1 times [2025-02-05 21:35:35,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:35,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759043870] [2025-02-05 21:35:35,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:35,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:35,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-02-05 21:35:36,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-02-05 21:35:36,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:36,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:36,987 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-05 21:35:36,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:36,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759043870] [2025-02-05 21:35:36,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759043870] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:35:36,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:35:36,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:35:36,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795683366] [2025-02-05 21:35:36,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:35:36,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:35:36,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:36,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:35:36,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:35:36,993 INFO L87 Difference]: Start difference. First operand 4703 states and 7656 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 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-05 21:35:38,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:38,032 INFO L93 Difference]: Finished difference Result 9457 states and 15363 transitions. [2025-02-05 21:35:38,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:35:38,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 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 458 [2025-02-05 21:35:38,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:38,078 INFO L225 Difference]: With dead ends: 9457 [2025-02-05 21:35:38,078 INFO L226 Difference]: Without dead ends: 4757 [2025-02-05 21:35:38,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:35:38,101 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 529 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:38,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 1066 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:35:38,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4757 states. [2025-02-05 21:35:38,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4757 to 4735. [2025-02-05 21:35:38,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4735 states, 3388 states have (on average 1.4935064935064934) internal successors, (5060), 3416 states have internal predecessors, (5060), 1306 states have call successors, (1306), 40 states have call predecessors, (1306), 40 states have return successors, (1306), 1278 states have call predecessors, (1306), 1306 states have call successors, (1306) [2025-02-05 21:35:38,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4735 states to 4735 states and 7672 transitions. [2025-02-05 21:35:38,733 INFO L78 Accepts]: Start accepts. Automaton has 4735 states and 7672 transitions. Word has length 458 [2025-02-05 21:35:38,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:38,734 INFO L471 AbstractCegarLoop]: Abstraction has 4735 states and 7672 transitions. [2025-02-05 21:35:38,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 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-05 21:35:38,739 INFO L276 IsEmpty]: Start isEmpty. Operand 4735 states and 7672 transitions. [2025-02-05 21:35:38,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-02-05 21:35:38,749 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:38,749 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] [2025-02-05 21:35:38,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:35:38,750 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:38,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:38,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1216630993, now seen corresponding path program 1 times [2025-02-05 21:35:38,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:38,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172268562] [2025-02-05 21:35:38,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:38,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:38,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-02-05 21:35:39,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-02-05 21:35:39,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:39,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:44,671 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-05 21:35:44,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:44,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172268562] [2025-02-05 21:35:44,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172268562] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:35:44,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:35:44,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 21:35:44,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633139488] [2025-02-05 21:35:44,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:35:44,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 21:35:44,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:44,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 21:35:44,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:35:44,676 INFO L87 Difference]: Start difference. First operand 4735 states and 7672 transitions. Second operand has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 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-05 21:35:48,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:48,187 INFO L93 Difference]: Finished difference Result 13749 states and 22058 transitions. [2025-02-05 21:35:48,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 21:35:48,190 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 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 459 [2025-02-05 21:35:48,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:48,270 INFO L225 Difference]: With dead ends: 13749 [2025-02-05 21:35:48,270 INFO L226 Difference]: Without dead ends: 9017 [2025-02-05 21:35:48,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2025-02-05 21:35:48,292 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 461 mSDsluCounter, 1655 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 1979 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:48,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 1979 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 21:35:48,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9017 states. [2025-02-05 21:35:48,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9017 to 7121. [2025-02-05 21:35:48,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7121 states, 5696 states have (on average 1.5244030898876404) internal successors, (8683), 5724 states have internal predecessors, (8683), 1379 states have call successors, (1379), 45 states have call predecessors, (1379), 45 states have return successors, (1379), 1351 states have call predecessors, (1379), 1379 states have call successors, (1379) [2025-02-05 21:35:48,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7121 states to 7121 states and 11441 transitions. [2025-02-05 21:35:48,963 INFO L78 Accepts]: Start accepts. Automaton has 7121 states and 11441 transitions. Word has length 459 [2025-02-05 21:35:48,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:48,965 INFO L471 AbstractCegarLoop]: Abstraction has 7121 states and 11441 transitions. [2025-02-05 21:35:48,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 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-05 21:35:48,966 INFO L276 IsEmpty]: Start isEmpty. Operand 7121 states and 11441 transitions. [2025-02-05 21:35:48,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-02-05 21:35:48,975 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:48,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] [2025-02-05 21:35:48,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:35:48,975 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:48,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:48,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1618299211, now seen corresponding path program 1 times [2025-02-05 21:35:48,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:48,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955735850] [2025-02-05 21:35:48,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:48,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:49,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-02-05 21:35:49,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-02-05 21:35:49,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:49,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:49,506 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 9 proven. 207 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-02-05 21:35:49,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:49,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955735850] [2025-02-05 21:35:49,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955735850] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:35:49,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130924638] [2025-02-05 21:35:49,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:49,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:35:49,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:35:49,510 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:35:49,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 21:35:49,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-02-05 21:35:49,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-02-05 21:35:49,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:49,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:49,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 1019 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 21:35:49,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:35:50,246 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 5196 proven. 90 refuted. 0 times theorem prover too weak. 5226 trivial. 0 not checked. [2025-02-05 21:35:50,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:35:50,732 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 126 proven. 90 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-02-05 21:35:50,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130924638] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:35:50,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:35:50,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 9 [2025-02-05 21:35:50,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665766034] [2025-02-05 21:35:50,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:35:50,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 21:35:50,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:50,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 21:35:50,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:35:50,735 INFO L87 Difference]: Start difference. First operand 7121 states and 11441 transitions. Second operand has 9 states, 9 states have (on average 20.22222222222222) internal successors, (182), 9 states have internal predecessors, (182), 3 states have call successors, (172), 2 states have call predecessors, (172), 4 states have return successors, (174), 3 states have call predecessors, (174), 3 states have call successors, (174) [2025-02-05 21:35:52,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:52,129 INFO L93 Difference]: Finished difference Result 14005 states and 22186 transitions. [2025-02-05 21:35:52,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-05 21:35:52,134 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 20.22222222222222) internal successors, (182), 9 states have internal predecessors, (182), 3 states have call successors, (172), 2 states have call predecessors, (172), 4 states have return successors, (174), 3 states have call predecessors, (174), 3 states have call successors, (174) Word has length 460 [2025-02-05 21:35:52,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:52,177 INFO L225 Difference]: With dead ends: 14005 [2025-02-05 21:35:52,177 INFO L226 Difference]: Without dead ends: 7305 [2025-02-05 21:35:52,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 942 GetRequests, 916 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=452, Unknown=0, NotChecked=0, Total=650 [2025-02-05 21:35:52,203 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 552 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:52,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 775 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 21:35:52,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7305 states. [2025-02-05 21:35:52,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7305 to 3864. [2025-02-05 21:35:52,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3864 states, 2904 states have (on average 1.4517906336088153) internal successors, (4216), 2916 states have internal predecessors, (4216), 891 states have call successors, (891), 68 states have call predecessors, (891), 68 states have return successors, (891), 879 states have call predecessors, (891), 891 states have call successors, (891) [2025-02-05 21:35:52,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3864 states to 3864 states and 5998 transitions. [2025-02-05 21:35:52,839 INFO L78 Accepts]: Start accepts. Automaton has 3864 states and 5998 transitions. Word has length 460 [2025-02-05 21:35:52,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:52,840 INFO L471 AbstractCegarLoop]: Abstraction has 3864 states and 5998 transitions. [2025-02-05 21:35:52,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.22222222222222) internal successors, (182), 9 states have internal predecessors, (182), 3 states have call successors, (172), 2 states have call predecessors, (172), 4 states have return successors, (174), 3 states have call predecessors, (174), 3 states have call successors, (174) [2025-02-05 21:35:52,840 INFO L276 IsEmpty]: Start isEmpty. Operand 3864 states and 5998 transitions. [2025-02-05 21:35:52,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-02-05 21:35:52,845 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:52,845 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] [2025-02-05 21:35:52,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 21:35:53,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:35:53,047 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:53,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:53,048 INFO L85 PathProgramCache]: Analyzing trace with hash -715209482, now seen corresponding path program 1 times [2025-02-05 21:35:53,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:53,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891231452] [2025-02-05 21:35:53,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:53,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:53,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-02-05 21:35:53,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-02-05 21:35:53,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:53,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:53,433 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-05 21:35:53,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:53,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891231452] [2025-02-05 21:35:53,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891231452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:35:53,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:35:53,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:35:53,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956443508] [2025-02-05 21:35:53,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:35:53,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:35:53,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:53,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:35:53,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:35:53,436 INFO L87 Difference]: Start difference. First operand 3864 states and 5998 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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-05 21:35:54,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:54,411 INFO L93 Difference]: Finished difference Result 9234 states and 14318 transitions. [2025-02-05 21:35:54,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:35:54,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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 460 [2025-02-05 21:35:54,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:54,442 INFO L225 Difference]: With dead ends: 9234 [2025-02-05 21:35:54,442 INFO L226 Difference]: Without dead ends: 6485 [2025-02-05 21:35:54,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:35:54,454 INFO L435 NwaCegarLoop]: 641 mSDtfsCounter, 341 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1448 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:54,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 1448 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:35:54,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6485 states. [2025-02-05 21:35:55,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6485 to 6467. [2025-02-05 21:35:55,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6467 states, 4629 states have (on average 1.4264419961114712) internal successors, (6603), 4653 states have internal predecessors, (6603), 1709 states have call successors, (1709), 128 states have call predecessors, (1709), 128 states have return successors, (1709), 1685 states have call predecessors, (1709), 1709 states have call successors, (1709) [2025-02-05 21:35:55,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6467 states to 6467 states and 10021 transitions. [2025-02-05 21:35:55,163 INFO L78 Accepts]: Start accepts. Automaton has 6467 states and 10021 transitions. Word has length 460 [2025-02-05 21:35:55,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:55,164 INFO L471 AbstractCegarLoop]: Abstraction has 6467 states and 10021 transitions. [2025-02-05 21:35:55,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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-05 21:35:55,164 INFO L276 IsEmpty]: Start isEmpty. Operand 6467 states and 10021 transitions. [2025-02-05 21:35:55,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-02-05 21:35:55,169 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:55,169 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] [2025-02-05 21:35:55,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:35:55,170 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:55,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:55,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1772303351, now seen corresponding path program 1 times [2025-02-05 21:35:55,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:55,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749030607] [2025-02-05 21:35:55,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:55,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:55,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-02-05 21:35:55,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-02-05 21:35:55,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:55,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:56,302 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 81 proven. 135 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-02-05 21:35:56,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:56,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749030607] [2025-02-05 21:35:56,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749030607] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:35:56,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536647868] [2025-02-05 21:35:56,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:56,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:35:56,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:35:56,306 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:35:56,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 21:35:56,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-02-05 21:35:56,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-02-05 21:35:56,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:56,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:56,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 21:35:56,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:35:56,884 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 3768 proven. 48 refuted. 0 times theorem prover too weak. 6696 trivial. 0 not checked. [2025-02-05 21:35:56,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:35:58,068 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 168 proven. 48 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-02-05 21:35:58,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536647868] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:35:58,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:35:58,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2025-02-05 21:35:58,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017096815] [2025-02-05 21:35:58,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:35:58,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 21:35:58,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:58,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 21:35:58,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-02-05 21:35:58,073 INFO L87 Difference]: Start difference. First operand 6467 states and 10021 transitions. Second operand has 17 states, 16 states have (on average 12.25) internal successors, (196), 17 states have internal predecessors, (196), 5 states have call successors, (135), 2 states have call predecessors, (135), 4 states have return successors, (136), 4 states have call predecessors, (136), 5 states have call successors, (136) [2025-02-05 21:36:02,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:36:02,779 INFO L93 Difference]: Finished difference Result 15413 states and 23315 transitions. [2025-02-05 21:36:02,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-02-05 21:36:02,780 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 12.25) internal successors, (196), 17 states have internal predecessors, (196), 5 states have call successors, (135), 2 states have call predecessors, (135), 4 states have return successors, (136), 4 states have call predecessors, (136), 5 states have call successors, (136) Word has length 460 [2025-02-05 21:36:02,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:36:02,819 INFO L225 Difference]: With dead ends: 15413 [2025-02-05 21:36:02,820 INFO L226 Difference]: Without dead ends: 9279 [2025-02-05 21:36:02,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 972 GetRequests, 918 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=785, Invalid=2295, Unknown=0, NotChecked=0, Total=3080 [2025-02-05 21:36:02,838 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 2610 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 1758 mSolverCounterSat, 2259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2610 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 4017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2259 IncrementalHoareTripleChecker+Valid, 1758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 21:36:02,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2610 Valid, 1202 Invalid, 4017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2259 Valid, 1758 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 21:36:02,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9279 states. [2025-02-05 21:36:03,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9279 to 6185. [2025-02-05 21:36:03,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6185 states, 4378 states have (on average 1.3636363636363635) internal successors, (5970), 4406 states have internal predecessors, (5970), 1637 states have call successors, (1637), 169 states have call predecessors, (1637), 169 states have return successors, (1637), 1609 states have call predecessors, (1637), 1637 states have call successors, (1637) [2025-02-05 21:36:04,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6185 states to 6185 states and 9244 transitions. [2025-02-05 21:36:04,031 INFO L78 Accepts]: Start accepts. Automaton has 6185 states and 9244 transitions. Word has length 460 [2025-02-05 21:36:04,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:36:04,032 INFO L471 AbstractCegarLoop]: Abstraction has 6185 states and 9244 transitions. [2025-02-05 21:36:04,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 12.25) internal successors, (196), 17 states have internal predecessors, (196), 5 states have call successors, (135), 2 states have call predecessors, (135), 4 states have return successors, (136), 4 states have call predecessors, (136), 5 states have call successors, (136) [2025-02-05 21:36:04,033 INFO L276 IsEmpty]: Start isEmpty. Operand 6185 states and 9244 transitions. [2025-02-05 21:36:04,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-02-05 21:36:04,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:36:04,038 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] [2025-02-05 21:36:04,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 21:36:04,238 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-05 21:36:04,238 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:36:04,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:36:04,239 INFO L85 PathProgramCache]: Analyzing trace with hash 417476466, now seen corresponding path program 1 times [2025-02-05 21:36:04,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:36:04,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959886212] [2025-02-05 21:36:04,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:04,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:36:04,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-02-05 21:36:04,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-02-05 21:36:04,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:04,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:04,679 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 114 proven. 102 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-02-05 21:36:04,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:36:04,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959886212] [2025-02-05 21:36:04,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959886212] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:36:04,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340954284] [2025-02-05 21:36:04,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:04,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:36:04,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:36:04,683 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:36:04,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 21:36:04,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-02-05 21:36:04,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-02-05 21:36:04,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:04,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:04,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 21:36:04,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:36:05,356 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 5316 proven. 102 refuted. 0 times theorem prover too weak. 5094 trivial. 0 not checked. [2025-02-05 21:36:05,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:36:05,744 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 114 proven. 102 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-02-05 21:36:05,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340954284] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:36:05,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:36:05,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-05 21:36:05,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743972665] [2025-02-05 21:36:05,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:36:05,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:36:05,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:36:05,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:36:05,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:36:05,748 INFO L87 Difference]: Start difference. First operand 6185 states and 9244 transitions. Second operand has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 2 states have call successors, (107), 2 states have call predecessors, (107), 4 states have return successors, (108), 2 states have call predecessors, (108), 2 states have call successors, (108) [2025-02-05 21:36:06,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:36:06,832 INFO L93 Difference]: Finished difference Result 12433 states and 18332 transitions. [2025-02-05 21:36:06,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 21:36:06,833 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 2 states have call successors, (107), 2 states have call predecessors, (107), 4 states have return successors, (108), 2 states have call predecessors, (108), 2 states have call successors, (108) Word has length 461 [2025-02-05 21:36:06,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:36:06,869 INFO L225 Difference]: With dead ends: 12433 [2025-02-05 21:36:06,870 INFO L226 Difference]: Without dead ends: 6573 [2025-02-05 21:36:06,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 929 GetRequests, 919 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:36:06,890 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 478 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:36:06,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 609 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:36:06,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6573 states. [2025-02-05 21:36:07,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6573 to 6285. [2025-02-05 21:36:07,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6285 states, 4453 states have (on average 1.3467325398607681) internal successors, (5997), 4481 states have internal predecessors, (5997), 1637 states have call successors, (1637), 194 states have call predecessors, (1637), 194 states have return successors, (1637), 1609 states have call predecessors, (1637), 1637 states have call successors, (1637) [2025-02-05 21:36:07,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6285 states to 6285 states and 9271 transitions. [2025-02-05 21:36:07,777 INFO L78 Accepts]: Start accepts. Automaton has 6285 states and 9271 transitions. Word has length 461 [2025-02-05 21:36:07,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:36:07,778 INFO L471 AbstractCegarLoop]: Abstraction has 6285 states and 9271 transitions. [2025-02-05 21:36:07,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 2 states have call successors, (107), 2 states have call predecessors, (107), 4 states have return successors, (108), 2 states have call predecessors, (108), 2 states have call successors, (108) [2025-02-05 21:36:07,778 INFO L276 IsEmpty]: Start isEmpty. Operand 6285 states and 9271 transitions. [2025-02-05 21:36:07,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-02-05 21:36:07,783 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:36:07,783 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] [2025-02-05 21:36:07,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 21:36:07,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-05 21:36:07,985 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:36:07,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:36:07,985 INFO L85 PathProgramCache]: Analyzing trace with hash 428792593, now seen corresponding path program 1 times [2025-02-05 21:36:07,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:36:07,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126660882] [2025-02-05 21:36:07,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:07,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:36:08,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-02-05 21:36:08,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-02-05 21:36:08,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:08,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:08,341 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-05 21:36:08,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:36:08,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126660882] [2025-02-05 21:36:08,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126660882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:36:08,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:36:08,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:36:08,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356190777] [2025-02-05 21:36:08,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:36:08,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:36:08,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:36:08,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:36:08,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:36:08,344 INFO L87 Difference]: Start difference. First operand 6285 states and 9271 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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-05 21:36:10,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:36:10,737 INFO L93 Difference]: Finished difference Result 21302 states and 31520 transitions. [2025-02-05 21:36:10,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:36:10,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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 461 [2025-02-05 21:36:10,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:36:10,808 INFO L225 Difference]: With dead ends: 21302 [2025-02-05 21:36:10,808 INFO L226 Difference]: Without dead ends: 15198 [2025-02-05 21:36:10,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:36:10,830 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 655 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 1562 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:36:10,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 1562 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:36:10,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15198 states. [2025-02-05 21:36:12,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15198 to 11550. [2025-02-05 21:36:12,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11550 states, 8470 states have (on average 1.3689492325855963) internal successors, (11595), 8530 states have internal predecessors, (11595), 2757 states have call successors, (2757), 322 states have call predecessors, (2757), 322 states have return successors, (2757), 2697 states have call predecessors, (2757), 2757 states have call successors, (2757) [2025-02-05 21:36:12,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11550 states to 11550 states and 17109 transitions. [2025-02-05 21:36:12,255 INFO L78 Accepts]: Start accepts. Automaton has 11550 states and 17109 transitions. Word has length 461 [2025-02-05 21:36:12,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:36:12,256 INFO L471 AbstractCegarLoop]: Abstraction has 11550 states and 17109 transitions. [2025-02-05 21:36:12,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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-05 21:36:12,256 INFO L276 IsEmpty]: Start isEmpty. Operand 11550 states and 17109 transitions. [2025-02-05 21:36:12,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-02-05 21:36:12,263 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:36:12,263 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] [2025-02-05 21:36:12,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 21:36:12,263 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:36:12,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:36:12,263 INFO L85 PathProgramCache]: Analyzing trace with hash -45287695, now seen corresponding path program 1 times [2025-02-05 21:36:12,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:36:12,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195409779] [2025-02-05 21:36:12,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:12,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:36:12,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-02-05 21:36:12,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-02-05 21:36:12,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:12,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat