./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-79.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-100_file-79.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 68466dc8851e15d5c55e16cb6abd8cdccbbd4db381e8ec074cd8097ac9916cb7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:16:22,404 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:16:22,450 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:16:22,453 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:16:22,453 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:16:22,470 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:16:22,471 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:16:22,471 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:16:22,471 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:16:22,471 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:16:22,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:16:22,471 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:16:22,473 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:16:22,473 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:16:22,474 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:16:22,474 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:16:22,474 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:16:22,474 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:16:22,474 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:16:22,474 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:16:22,474 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:16:22,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:16:22,475 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:16:22,475 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:16:22,475 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:16:22,475 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:16:22,475 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:16:22,475 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:16:22,475 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:16:22,475 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:16:22,475 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:16:22,475 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:16:22,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:16:22,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:16:22,476 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:16:22,476 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:16:22,476 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:16:22,476 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:16:22,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:16:22,476 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:16:22,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:16:22,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:16:22,477 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:16:22,477 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 -> 68466dc8851e15d5c55e16cb6abd8cdccbbd4db381e8ec074cd8097ac9916cb7 [2025-02-05 21:16:22,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:16:22,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:16:22,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:16:22,710 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:16:22,710 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:16:22,711 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-100_file-79.i [2025-02-05 21:16:23,856 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c58f0ee5d/21826c630c9445d08f6b2839db3a1810/FLAG2d912b05e [2025-02-05 21:16:24,106 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:16:24,107 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-79.i [2025-02-05 21:16:24,117 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c58f0ee5d/21826c630c9445d08f6b2839db3a1810/FLAG2d912b05e [2025-02-05 21:16:24,130 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c58f0ee5d/21826c630c9445d08f6b2839db3a1810 [2025-02-05 21:16:24,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:16:24,134 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:16:24,135 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:16:24,135 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:16:24,138 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:16:24,139 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:16:24" (1/1) ... [2025-02-05 21:16:24,139 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a79486c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:16:24, skipping insertion in model container [2025-02-05 21:16:24,140 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:16:24" (1/1) ... [2025-02-05 21:16:24,161 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:16:24,271 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-100_file-79.i[916,929] [2025-02-05 21:16:24,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:16:24,401 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:16:24,411 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-100_file-79.i[916,929] [2025-02-05 21:16:24,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:16:24,500 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:16:24,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:16:24 WrapperNode [2025-02-05 21:16:24,502 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:16:24,503 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:16:24,503 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:16:24,503 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:16:24,509 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:16:24" (1/1) ... [2025-02-05 21:16:24,525 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:16:24" (1/1) ... [2025-02-05 21:16:24,559 INFO L138 Inliner]: procedures = 26, calls = 86, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 418 [2025-02-05 21:16:24,559 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:16:24,560 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:16:24,560 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:16:24,560 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:16:24,566 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:16:24" (1/1) ... [2025-02-05 21:16:24,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:16:24" (1/1) ... [2025-02-05 21:16:24,572 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:16:24" (1/1) ... [2025-02-05 21:16:24,591 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:16:24,592 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:16:24" (1/1) ... [2025-02-05 21:16:24,593 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:16:24" (1/1) ... [2025-02-05 21:16:24,603 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:16:24" (1/1) ... [2025-02-05 21:16:24,605 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:16:24" (1/1) ... [2025-02-05 21:16:24,607 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:16:24" (1/1) ... [2025-02-05 21:16:24,610 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:16:24" (1/1) ... [2025-02-05 21:16:24,618 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:16:24,622 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:16:24,622 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:16:24,622 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:16:24,623 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:16:24" (1/1) ... [2025-02-05 21:16:24,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:16:24,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:16:24,649 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:16:24,654 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:16:24,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:16:24,670 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:16:24,670 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:16:24,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:16:24,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:16:24,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:16:24,759 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:16:24,760 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:16:25,275 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-02-05 21:16:25,276 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:16:25,297 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:16:25,299 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:16:25,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:16:25 BoogieIcfgContainer [2025-02-05 21:16:25,300 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:16:25,302 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:16:25,303 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:16:25,306 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:16:25,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:16:24" (1/3) ... [2025-02-05 21:16:25,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b25e9f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:16:25, skipping insertion in model container [2025-02-05 21:16:25,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:16:24" (2/3) ... [2025-02-05 21:16:25,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b25e9f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:16:25, skipping insertion in model container [2025-02-05 21:16:25,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:16:25" (3/3) ... [2025-02-05 21:16:25,309 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-79.i [2025-02-05 21:16:25,321 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:16:25,326 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-79.i that has 2 procedures, 176 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:16:25,381 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:16:25,390 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;@bb248f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:16:25,390 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:16:25,394 INFO L276 IsEmpty]: Start isEmpty. Operand has 176 states, 100 states have (on average 1.38) internal successors, (138), 101 states have internal predecessors, (138), 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:16:25,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-02-05 21:16:25,411 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:16:25,412 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] [2025-02-05 21:16:25,413 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:16:25,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:16:25,420 INFO L85 PathProgramCache]: Analyzing trace with hash -367379070, now seen corresponding path program 1 times [2025-02-05 21:16:25,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:16:25,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990830655] [2025-02-05 21:16:25,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:16:25,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:16:25,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-02-05 21:16:25,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-02-05 21:16:25,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:16:25,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:16:25,859 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:16:25,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:16:25,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990830655] [2025-02-05 21:16:25,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990830655] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:16:25,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769375198] [2025-02-05 21:16:25,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:16:25,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:16:25,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:16:25,864 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:16:25,866 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:16:25,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-02-05 21:16:26,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-02-05 21:16:26,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:16:26,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:16:26,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 961 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:16:26,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:16:26,164 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:16:26,164 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:16:26,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769375198] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:16:26,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:16:26,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:16:26,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098785849] [2025-02-05 21:16:26,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:16:26,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:16:26,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:16:26,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:16:26,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:16:26,186 INFO L87 Difference]: Start difference. First operand has 176 states, 100 states have (on average 1.38) internal successors, (138), 101 states have internal predecessors, (138), 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 40.5) internal successors, (81), 2 states have internal predecessors, (81), 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:16:26,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:16:26,232 INFO L93 Difference]: Finished difference Result 346 states and 636 transitions. [2025-02-05 21:16:26,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:16:26,235 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 40.5) internal successors, (81), 2 states have internal predecessors, (81), 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 441 [2025-02-05 21:16:26,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:16:26,242 INFO L225 Difference]: With dead ends: 346 [2025-02-05 21:16:26,242 INFO L226 Difference]: Without dead ends: 173 [2025-02-05 21:16:26,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 442 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:16:26,246 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:16:26,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 274 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:16:26,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-02-05 21:16:26,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-02-05 21:16:26,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 98 states have (on average 1.346938775510204) internal successors, (132), 98 states have internal predecessors, (132), 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:16:26,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 278 transitions. [2025-02-05 21:16:26,297 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 278 transitions. Word has length 441 [2025-02-05 21:16:26,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:16:26,297 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 278 transitions. [2025-02-05 21:16:26,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 40.5) internal successors, (81), 2 states have internal predecessors, (81), 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:16:26,298 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 278 transitions. [2025-02-05 21:16:26,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-02-05 21:16:26,304 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:16:26,304 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] [2025-02-05 21:16:26,312 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:16:26,504 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:16:26,505 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:16:26,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:16:26,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1978580879, now seen corresponding path program 1 times [2025-02-05 21:16:26,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:16:26,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145895530] [2025-02-05 21:16:26,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:16:26,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:16:26,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-02-05 21:16:26,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-02-05 21:16:26,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:16:26,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:16:27,195 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:16:27,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:16:27,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145895530] [2025-02-05 21:16:27,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145895530] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:16:27,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:16:27,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:16:27,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670428659] [2025-02-05 21:16:27,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:16:27,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:16:27,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:16:27,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:16:27,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:16:27,201 INFO L87 Difference]: Start difference. First operand 173 states and 278 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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:16:27,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:16:27,279 INFO L93 Difference]: Finished difference Result 513 states and 828 transitions. [2025-02-05 21:16:27,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:16:27,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 441 [2025-02-05 21:16:27,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:16:27,287 INFO L225 Difference]: With dead ends: 513 [2025-02-05 21:16:27,287 INFO L226 Difference]: Without dead ends: 343 [2025-02-05 21:16:27,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:16:27,289 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 132 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:16:27,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 542 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:16:27,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-02-05 21:16:27,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2025-02-05 21:16:27,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 192 states have (on average 1.34375) internal successors, (258), 192 states have internal predecessors, (258), 146 states have call successors, (146), 2 states have call predecessors, (146), 2 states have return successors, (146), 146 states have call predecessors, (146), 146 states have call successors, (146) [2025-02-05 21:16:27,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 550 transitions. [2025-02-05 21:16:27,359 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 550 transitions. Word has length 441 [2025-02-05 21:16:27,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:16:27,361 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 550 transitions. [2025-02-05 21:16:27,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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:16:27,362 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 550 transitions. [2025-02-05 21:16:27,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-02-05 21:16:27,366 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:16:27,367 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] [2025-02-05 21:16:27,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:16:27,367 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:16:27,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:16:27,368 INFO L85 PathProgramCache]: Analyzing trace with hash 2048163797, now seen corresponding path program 1 times [2025-02-05 21:16:27,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:16:27,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389475493] [2025-02-05 21:16:27,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:16:27,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:16:27,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-02-05 21:16:27,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-02-05 21:16:27,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:16:27,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:16:27,925 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:16:27,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:16:27,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389475493] [2025-02-05 21:16:27,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389475493] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:16:27,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:16:27,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:16:27,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573212239] [2025-02-05 21:16:27,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:16:27,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:16:27,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:16:27,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:16:27,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:16:27,929 INFO L87 Difference]: Start difference. First operand 341 states and 550 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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:16:28,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:16:28,298 INFO L93 Difference]: Finished difference Result 695 states and 1118 transitions. [2025-02-05 21:16:28,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:16:28,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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 442 [2025-02-05 21:16:28,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:16:28,302 INFO L225 Difference]: With dead ends: 695 [2025-02-05 21:16:28,302 INFO L226 Difference]: Without dead ends: 357 [2025-02-05 21:16:28,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:16:28,306 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 202 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:16:28,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 933 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:16:28,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-02-05 21:16:28,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 341. [2025-02-05 21:16:28,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 192 states have (on average 1.3385416666666667) internal successors, (257), 192 states have internal predecessors, (257), 146 states have call successors, (146), 2 states have call predecessors, (146), 2 states have return successors, (146), 146 states have call predecessors, (146), 146 states have call successors, (146) [2025-02-05 21:16:28,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 549 transitions. [2025-02-05 21:16:28,341 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 549 transitions. Word has length 442 [2025-02-05 21:16:28,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:16:28,342 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 549 transitions. [2025-02-05 21:16:28,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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:16:28,343 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 549 transitions. [2025-02-05 21:16:28,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-02-05 21:16:28,345 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:16:28,345 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] [2025-02-05 21:16:28,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:16:28,345 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:16:28,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:16:28,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1220857391, now seen corresponding path program 1 times [2025-02-05 21:16:28,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:16:28,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139651355] [2025-02-05 21:16:28,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:16:28,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:16:28,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-02-05 21:16:28,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-02-05 21:16:28,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:16:28,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:16:28,573 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:16:28,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:16:28,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139651355] [2025-02-05 21:16:28,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139651355] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:16:28,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:16:28,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:16:28,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127742585] [2025-02-05 21:16:28,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:16:28,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:16:28,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:16:28,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:16:28,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:16:28,574 INFO L87 Difference]: Start difference. First operand 341 states and 549 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:16:28,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:16:28,607 INFO L93 Difference]: Finished difference Result 689 states and 1113 transitions. [2025-02-05 21:16:28,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:16:28,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 443 [2025-02-05 21:16:28,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:16:28,611 INFO L225 Difference]: With dead ends: 689 [2025-02-05 21:16:28,611 INFO L226 Difference]: Without dead ends: 351 [2025-02-05 21:16:28,612 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:16:28,612 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 18 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 555 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:16:28,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 555 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:16:28,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-02-05 21:16:28,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 341. [2025-02-05 21:16:28,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 192 states have (on average 1.328125) internal successors, (255), 192 states have internal predecessors, (255), 146 states have call successors, (146), 2 states have call predecessors, (146), 2 states have return successors, (146), 146 states have call predecessors, (146), 146 states have call successors, (146) [2025-02-05 21:16:28,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 547 transitions. [2025-02-05 21:16:28,639 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 547 transitions. Word has length 443 [2025-02-05 21:16:28,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:16:28,640 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 547 transitions. [2025-02-05 21:16:28,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:16:28,641 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 547 transitions. [2025-02-05 21:16:28,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-02-05 21:16:28,642 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:16:28,643 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] [2025-02-05 21:16:28,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:16:28,643 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:16:28,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:16:28,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1091774672, now seen corresponding path program 1 times [2025-02-05 21:16:28,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:16:28,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791556367] [2025-02-05 21:16:28,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:16:28,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:16:28,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-02-05 21:16:28,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-02-05 21:16:28,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:16:28,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:16:28,932 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:16:28,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:16:28,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791556367] [2025-02-05 21:16:28,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791556367] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:16:28,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:16:28,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:16:28,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528035627] [2025-02-05 21:16:28,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:16:28,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:16:28,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:16:28,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:16:28,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:16:28,936 INFO L87 Difference]: Start difference. First operand 341 states and 547 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:16:28,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:16:28,976 INFO L93 Difference]: Finished difference Result 695 states and 1109 transitions. [2025-02-05 21:16:28,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:16:28,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 443 [2025-02-05 21:16:28,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:16:28,979 INFO L225 Difference]: With dead ends: 695 [2025-02-05 21:16:28,980 INFO L226 Difference]: Without dead ends: 357 [2025-02-05 21:16:28,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:16:28,982 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 32 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:16:28,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 527 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:16:28,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-02-05 21:16:29,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 356. [2025-02-05 21:16:29,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 201 states have (on average 1.3034825870646767) internal successors, (262), 202 states have internal predecessors, (262), 150 states have call successors, (150), 4 states have call predecessors, (150), 4 states have return successors, (150), 149 states have call predecessors, (150), 150 states have call successors, (150) [2025-02-05 21:16:29,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 562 transitions. [2025-02-05 21:16:29,012 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 562 transitions. Word has length 443 [2025-02-05 21:16:29,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:16:29,013 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 562 transitions. [2025-02-05 21:16:29,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:16:29,013 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 562 transitions. [2025-02-05 21:16:29,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-02-05 21:16:29,015 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:16:29,015 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] [2025-02-05 21:16:29,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:16:29,016 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:16:29,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:16:29,016 INFO L85 PathProgramCache]: Analyzing trace with hash -146924397, now seen corresponding path program 1 times [2025-02-05 21:16:29,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:16:29,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926999341] [2025-02-05 21:16:29,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:16:29,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:16:29,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-02-05 21:16:29,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-02-05 21:16:29,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:16:29,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:16:29,540 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:16:29,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:16:29,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926999341] [2025-02-05 21:16:29,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926999341] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:16:29,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:16:29,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:16:29,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347765989] [2025-02-05 21:16:29,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:16:29,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:16:29,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:16:29,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:16:29,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:16:29,545 INFO L87 Difference]: Start difference. First operand 356 states and 562 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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:16:30,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:16:30,107 INFO L93 Difference]: Finished difference Result 1092 states and 1716 transitions. [2025-02-05 21:16:30,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:16:30,108 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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 444 [2025-02-05 21:16:30,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:16:30,114 INFO L225 Difference]: With dead ends: 1092 [2025-02-05 21:16:30,114 INFO L226 Difference]: Without dead ends: 746 [2025-02-05 21:16:30,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:16:30,116 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 543 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:16:30,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 944 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:16:30,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2025-02-05 21:16:30,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 649. [2025-02-05 21:16:30,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 407 states have (on average 1.366093366093366) internal successors, (556), 411 states have internal predecessors, (556), 231 states have call successors, (231), 10 states have call predecessors, (231), 10 states have return successors, (231), 227 states have call predecessors, (231), 231 states have call successors, (231) [2025-02-05 21:16:30,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1018 transitions. [2025-02-05 21:16:30,197 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1018 transitions. Word has length 444 [2025-02-05 21:16:30,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:16:30,197 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 1018 transitions. [2025-02-05 21:16:30,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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:16:30,197 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1018 transitions. [2025-02-05 21:16:30,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-02-05 21:16:30,199 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:16:30,199 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] [2025-02-05 21:16:30,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:16:30,200 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:16:30,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:16:30,200 INFO L85 PathProgramCache]: Analyzing trace with hash -135608270, now seen corresponding path program 1 times [2025-02-05 21:16:30,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:16:30,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550437646] [2025-02-05 21:16:30,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:16:30,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:16:30,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-02-05 21:16:30,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-02-05 21:16:30,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:16:30,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:16:30,408 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:16:30,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:16:30,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550437646] [2025-02-05 21:16:30,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550437646] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:16:30,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:16:30,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:16:30,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979476117] [2025-02-05 21:16:30,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:16:30,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:16:30,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:16:30,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:16:30,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:16:30,412 INFO L87 Difference]: Start difference. First operand 649 states and 1018 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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:16:30,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:16:30,536 INFO L93 Difference]: Finished difference Result 1676 states and 2634 transitions. [2025-02-05 21:16:30,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:16:30,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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 444 [2025-02-05 21:16:30,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:16:30,544 INFO L225 Difference]: With dead ends: 1676 [2025-02-05 21:16:30,544 INFO L226 Difference]: Without dead ends: 1037 [2025-02-05 21:16:30,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:16:30,548 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 149 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:16:30,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 598 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:16:30,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2025-02-05 21:16:30,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 946. [2025-02-05 21:16:30,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 559 states have (on average 1.3273703041144902) internal successors, (742), 562 states have internal predecessors, (742), 373 states have call successors, (373), 13 states have call predecessors, (373), 13 states have return successors, (373), 370 states have call predecessors, (373), 373 states have call successors, (373) [2025-02-05 21:16:30,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1488 transitions. [2025-02-05 21:16:30,661 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1488 transitions. Word has length 444 [2025-02-05 21:16:30,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:16:30,662 INFO L471 AbstractCegarLoop]: Abstraction has 946 states and 1488 transitions. [2025-02-05 21:16:30,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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:16:30,663 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1488 transitions. [2025-02-05 21:16:30,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-02-05 21:16:30,665 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:16:30,665 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] [2025-02-05 21:16:30,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:16:30,665 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:16:30,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:16:30,666 INFO L85 PathProgramCache]: Analyzing trace with hash -198895398, now seen corresponding path program 1 times [2025-02-05 21:16:30,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:16:30,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829812877] [2025-02-05 21:16:30,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:16:30,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:16:30,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-02-05 21:16:30,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-02-05 21:16:30,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:16:30,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:16:30,797 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:16:30,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:16:30,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829812877] [2025-02-05 21:16:30,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829812877] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:16:30,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:16:30,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:16:30,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831566369] [2025-02-05 21:16:30,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:16:30,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:16:30,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:16:30,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:16:30,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:16:30,799 INFO L87 Difference]: Start difference. First operand 946 states and 1488 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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:16:34,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 21:16:38,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 21:16:38,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:16:38,948 INFO L93 Difference]: Finished difference Result 2018 states and 3178 transitions. [2025-02-05 21:16:38,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:16:38,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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 445 [2025-02-05 21:16:38,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:16:38,958 INFO L225 Difference]: With dead ends: 2018 [2025-02-05 21:16:38,958 INFO L226 Difference]: Without dead ends: 1468 [2025-02-05 21:16:38,960 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:16:38,960 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 264 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:16:38,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 732 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 2 Unknown, 0 Unchecked, 8.0s Time] [2025-02-05 21:16:38,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2025-02-05 21:16:39,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1466. [2025-02-05 21:16:39,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1466 states, 871 states have (on average 1.3295063145809414) internal successors, (1158), 876 states have internal predecessors, (1158), 573 states have call successors, (573), 21 states have call predecessors, (573), 21 states have return successors, (573), 568 states have call predecessors, (573), 573 states have call successors, (573) [2025-02-05 21:16:39,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 2304 transitions. [2025-02-05 21:16:39,100 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 2304 transitions. Word has length 445 [2025-02-05 21:16:39,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:16:39,101 INFO L471 AbstractCegarLoop]: Abstraction has 1466 states and 2304 transitions. [2025-02-05 21:16:39,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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:16:39,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 2304 transitions. [2025-02-05 21:16:39,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-02-05 21:16:39,103 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:16:39,103 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] [2025-02-05 21:16:39,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:16:39,103 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:16:39,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:16:39,104 INFO L85 PathProgramCache]: Analyzing trace with hash -265902151, now seen corresponding path program 1 times [2025-02-05 21:16:39,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:16:39,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459585101] [2025-02-05 21:16:39,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:16:39,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:16:39,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-02-05 21:16:39,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-02-05 21:16:39,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:16:39,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:16:39,420 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 132 proven. 84 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-02-05 21:16:39,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:16:39,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459585101] [2025-02-05 21:16:39,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459585101] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:16:39,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802637541] [2025-02-05 21:16:39,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:16:39,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:16:39,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:16:39,423 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:16:39,425 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:16:39,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-02-05 21:16:39,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-02-05 21:16:39,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:16:39,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:16:39,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 21:16:39,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:16:41,007 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 3348 proven. 174 refuted. 0 times theorem prover too weak. 6990 trivial. 0 not checked. [2025-02-05 21:16:41,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:16:41,781 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 42 proven. 174 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-02-05 21:16:41,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802637541] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:16:41,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:16:41,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 17 [2025-02-05 21:16:41,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969457358] [2025-02-05 21:16:41,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:16:41,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 21:16:41,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:16:41,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 21:16:41,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-02-05 21:16:41,785 INFO L87 Difference]: Start difference. First operand 1466 states and 2304 transitions. Second operand has 17 states, 17 states have (on average 13.588235294117647) internal successors, (231), 17 states have internal predecessors, (231), 5 states have call successors, (204), 3 states have call predecessors, (204), 6 states have return successors, (205), 5 states have call predecessors, (205), 5 states have call successors, (205) [2025-02-05 21:16:42,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:16:42,613 INFO L93 Difference]: Finished difference Result 3014 states and 4637 transitions. [2025-02-05 21:16:42,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 21:16:42,613 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 13.588235294117647) internal successors, (231), 17 states have internal predecessors, (231), 5 states have call successors, (204), 3 states have call predecessors, (204), 6 states have return successors, (205), 5 states have call predecessors, (205), 5 states have call successors, (205) Word has length 445 [2025-02-05 21:16:42,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:16:42,625 INFO L225 Difference]: With dead ends: 3014 [2025-02-05 21:16:42,625 INFO L226 Difference]: Without dead ends: 1600 [2025-02-05 21:16:42,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 907 GetRequests, 878 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=254, Invalid=616, Unknown=0, NotChecked=0, Total=870 [2025-02-05 21:16:42,631 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 695 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 536 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 536 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:16:42,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 615 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [536 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:16:42,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2025-02-05 21:16:42,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 791. [2025-02-05 21:16:42,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 470 states have (on average 1.2680851063829788) internal successors, (596), 473 states have internal predecessors, (596), 300 states have call successors, (300), 20 states have call predecessors, (300), 20 states have return successors, (300), 297 states have call predecessors, (300), 300 states have call successors, (300) [2025-02-05 21:16:42,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1196 transitions. [2025-02-05 21:16:42,753 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1196 transitions. Word has length 445 [2025-02-05 21:16:42,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:16:42,753 INFO L471 AbstractCegarLoop]: Abstraction has 791 states and 1196 transitions. [2025-02-05 21:16:42,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 13.588235294117647) internal successors, (231), 17 states have internal predecessors, (231), 5 states have call successors, (204), 3 states have call predecessors, (204), 6 states have return successors, (205), 5 states have call predecessors, (205), 5 states have call successors, (205) [2025-02-05 21:16:42,754 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1196 transitions. [2025-02-05 21:16:42,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2025-02-05 21:16:42,756 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:16:42,756 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] [2025-02-05 21:16:42,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 21:16:42,956 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:16:42,957 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:16:42,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:16:42,958 INFO L85 PathProgramCache]: Analyzing trace with hash -474848594, now seen corresponding path program 1 times [2025-02-05 21:16:42,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:16:42,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511033627] [2025-02-05 21:16:42,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:16:42,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:16:42,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-02-05 21:16:43,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-02-05 21:16:43,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:16:43,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:16:43,227 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 147 proven. 69 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-02-05 21:16:43,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:16:43,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511033627] [2025-02-05 21:16:43,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511033627] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:16:43,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944498279] [2025-02-05 21:16:43,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:16:43,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:16:43,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:16:43,230 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:16:43,231 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:16:43,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-02-05 21:16:43,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-02-05 21:16:43,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:16:43,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:16:43,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 21:16:43,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:16:43,683 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 4678 proven. 69 refuted. 0 times theorem prover too weak. 5765 trivial. 0 not checked. [2025-02-05 21:16:43,683 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:16:44,137 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 147 proven. 69 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-02-05 21:16:44,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944498279] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:16:44,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:16:44,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-05 21:16:44,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432281388] [2025-02-05 21:16:44,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:16:44,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 21:16:44,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:16:44,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 21:16:44,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:16:44,139 INFO L87 Difference]: Start difference. First operand 791 states and 1196 transitions. Second operand has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 3 states have call successors, (119), 2 states have call predecessors, (119), 4 states have return successors, (120), 3 states have call predecessors, (120), 3 states have call successors, (120) [2025-02-05 21:16:44,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:16:44,591 INFO L93 Difference]: Finished difference Result 1578 states and 2360 transitions. [2025-02-05 21:16:44,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 21:16:44,592 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 3 states have call successors, (119), 2 states have call predecessors, (119), 4 states have return successors, (120), 3 states have call predecessors, (120), 3 states have call successors, (120) Word has length 446 [2025-02-05 21:16:44,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:16:44,597 INFO L225 Difference]: With dead ends: 1578 [2025-02-05 21:16:44,598 INFO L226 Difference]: Without dead ends: 843 [2025-02-05 21:16:44,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 898 GetRequests, 889 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:16:44,600 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 326 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:16:44,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 399 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:16:44,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2025-02-05 21:16:44,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 803. [2025-02-05 21:16:44,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 479 states have (on average 1.2421711899791232) internal successors, (595), 482 states have internal predecessors, (595), 300 states have call successors, (300), 23 states have call predecessors, (300), 23 states have return successors, (300), 297 states have call predecessors, (300), 300 states have call successors, (300) [2025-02-05 21:16:44,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1195 transitions. [2025-02-05 21:16:44,697 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1195 transitions. Word has length 446 [2025-02-05 21:16:44,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:16:44,697 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1195 transitions. [2025-02-05 21:16:44,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 3 states have call successors, (119), 2 states have call predecessors, (119), 4 states have return successors, (120), 3 states have call predecessors, (120), 3 states have call successors, (120) [2025-02-05 21:16:44,698 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1195 transitions. [2025-02-05 21:16:44,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-02-05 21:16:44,700 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:16:44,700 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] [2025-02-05 21:16:44,708 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:16:44,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:16:44,901 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:16:44,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:16:44,901 INFO L85 PathProgramCache]: Analyzing trace with hash 331296368, now seen corresponding path program 1 times [2025-02-05 21:16:44,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:16:44,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350178956] [2025-02-05 21:16:44,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:16:44,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:16:44,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-02-05 21:16:44,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-02-05 21:16:44,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:16:44,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:16:45,673 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 264 proven. 162 refuted. 0 times theorem prover too weak. 10086 trivial. 0 not checked. [2025-02-05 21:16:45,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:16:45,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350178956] [2025-02-05 21:16:45,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350178956] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:16:45,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068197535] [2025-02-05 21:16:45,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:16:45,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:16:45,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:16:45,676 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:16:45,678 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:16:45,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-02-05 21:16:45,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-02-05 21:16:45,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:16:45,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:16:45,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 976 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-05 21:16:45,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:16:48,545 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 7503 proven. 381 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2025-02-05 21:16:48,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:16:53,249 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 381 proven. 258 refuted. 0 times theorem prover too weak. 9873 trivial. 0 not checked. [2025-02-05 21:16:53,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068197535] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:16:53,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:16:53,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21, 19] total 49 [2025-02-05 21:16:53,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203060886] [2025-02-05 21:16:53,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:16:53,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-02-05 21:16:53,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:16:53,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-02-05 21:16:53,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=1955, Unknown=0, NotChecked=0, Total=2352 [2025-02-05 21:16:53,252 INFO L87 Difference]: Start difference. First operand 803 states and 1195 transitions. Second operand has 49 states, 48 states have (on average 4.125) internal successors, (198), 49 states have internal predecessors, (198), 13 states have call successors, (155), 7 states have call predecessors, (155), 13 states have return successors, (155), 12 states have call predecessors, (155), 13 states have call successors, (155) [2025-02-05 21:17:00,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 21:17:04,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 21:17:08,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 21:17:12,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 21:17:16,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 21:17:20,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 21:17:24,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 21:17:28,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 21:17:32,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 21:17:36,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 21:17:40,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 21:17:44,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 21:17:48,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 21:17:52,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 21:17:56,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []