./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-56.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 de52c08fb0028bef519c22f81b06d40dd6144270e7f5fea59e5bb117b888da23 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:19:08,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:19:09,064 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:19:09,068 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:19:09,069 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:19:09,086 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:19:09,087 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:19:09,087 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:19:09,088 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:19:09,088 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:19:09,088 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:19:09,088 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:19:09,088 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:19:09,089 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:19:09,089 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:19:09,089 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:19:09,089 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:19:09,089 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:19:09,089 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:19:09,089 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:19:09,090 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:19:09,090 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:19:09,090 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:19:09,090 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:19:09,090 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:19:09,090 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:19:09,090 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:19:09,090 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:19:09,090 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:19:09,091 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:19:09,091 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:19:09,091 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:19:09,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:19:09,091 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:19:09,091 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:19:09,091 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:19:09,091 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:19:09,092 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:19:09,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:19:09,092 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:19:09,092 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:19:09,092 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:19:09,092 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:19:09,092 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 -> de52c08fb0028bef519c22f81b06d40dd6144270e7f5fea59e5bb117b888da23 [2025-02-06 02:19:09,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:19:09,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:19:09,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:19:09,457 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:19:09,457 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:19:09,458 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-56.i [2025-02-06 02:19:10,732 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b07f3aee9/f14ae47fdcb84dfb980fe3d1716f0b8b/FLAG74e6d3e8e [2025-02-06 02:19:11,111 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:19:11,114 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-56.i [2025-02-06 02:19:11,131 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b07f3aee9/f14ae47fdcb84dfb980fe3d1716f0b8b/FLAG74e6d3e8e [2025-02-06 02:19:11,148 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b07f3aee9/f14ae47fdcb84dfb980fe3d1716f0b8b [2025-02-06 02:19:11,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:19:11,153 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:19:11,154 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:19:11,154 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:19:11,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:19:11,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:19:11" (1/1) ... [2025-02-06 02:19:11,159 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4414e23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:11, skipping insertion in model container [2025-02-06 02:19:11,161 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:19:11" (1/1) ... [2025-02-06 02:19:11,201 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:19:11,343 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-56.i[916,929] [2025-02-06 02:19:11,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:19:11,512 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:19:11,524 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-56.i[916,929] [2025-02-06 02:19:11,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:19:11,638 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:19:11,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:11 WrapperNode [2025-02-06 02:19:11,640 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:19:11,642 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:19:11,642 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:19:11,642 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:19:11,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:11" (1/1) ... [2025-02-06 02:19:11,668 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:11" (1/1) ... [2025-02-06 02:19:11,720 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 367 [2025-02-06 02:19:11,720 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:19:11,721 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:19:11,721 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:19:11,721 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:19:11,729 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:11" (1/1) ... [2025-02-06 02:19:11,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:11" (1/1) ... [2025-02-06 02:19:11,744 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:11" (1/1) ... [2025-02-06 02:19:11,772 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 02:19:11,772 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:11" (1/1) ... [2025-02-06 02:19:11,772 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:11" (1/1) ... [2025-02-06 02:19:11,788 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:11" (1/1) ... [2025-02-06 02:19:11,793 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:11" (1/1) ... [2025-02-06 02:19:11,802 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:11" (1/1) ... [2025-02-06 02:19:11,806 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:11" (1/1) ... [2025-02-06 02:19:11,817 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:19:11,817 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:19:11,818 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:19:11,818 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:19:11,819 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:11" (1/1) ... [2025-02-06 02:19:11,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:19:11,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:19:11,850 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:19:11,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:19:11,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:19:11,873 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:19:11,873 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:19:11,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:19:11,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:19:11,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:19:11,986 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:19:11,989 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:19:12,728 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L345: havoc property_#t~bitwise34#1;havoc property_#t~short35#1; [2025-02-06 02:19:12,819 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-02-06 02:19:12,819 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:19:12,841 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:19:12,844 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:19:12,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:19:12 BoogieIcfgContainer [2025-02-06 02:19:12,846 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:19:12,848 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:19:12,849 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:19:12,853 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:19:12,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:19:11" (1/3) ... [2025-02-06 02:19:12,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ea5da3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:19:12, skipping insertion in model container [2025-02-06 02:19:12,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:19:11" (2/3) ... [2025-02-06 02:19:12,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ea5da3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:19:12, skipping insertion in model container [2025-02-06 02:19:12,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:19:12" (3/3) ... [2025-02-06 02:19:12,857 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-56.i [2025-02-06 02:19:12,870 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:19:12,873 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-56.i that has 2 procedures, 156 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:19:12,936 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:19:12,948 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;@7659ecdd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:19:12,949 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:19:12,954 INFO L276 IsEmpty]: Start isEmpty. Operand has 156 states, 103 states have (on average 1.4757281553398058) internal successors, (152), 104 states have internal predecessors, (152), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-06 02:19:12,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-02-06 02:19:12,972 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:12,973 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:19:12,973 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:12,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:12,979 INFO L85 PathProgramCache]: Analyzing trace with hash -681760163, now seen corresponding path program 1 times [2025-02-06 02:19:12,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:12,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76040974] [2025-02-06 02:19:12,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:12,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:13,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-02-06 02:19:13,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-02-06 02:19:13,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:13,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:13,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2025-02-06 02:19:13,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:13,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76040974] [2025-02-06 02:19:13,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76040974] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:19:13,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956547847] [2025-02-06 02:19:13,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:13,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:19:13,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:19:13,548 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:19:13,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 02:19:13,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-02-06 02:19:13,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-02-06 02:19:13,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:13,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:13,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:19:13,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:19:13,919 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2025-02-06 02:19:13,920 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:19:13,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956547847] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:13,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:19:13,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:19:13,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417867648] [2025-02-06 02:19:13,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:13,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:19:13,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:13,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:19:13,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:19:13,950 INFO L87 Difference]: Start difference. First operand has 156 states, 103 states have (on average 1.4757281553398058) internal successors, (152), 104 states have internal predecessors, (152), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-02-06 02:19:13,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:13,987 INFO L93 Difference]: Finished difference Result 303 states and 543 transitions. [2025-02-06 02:19:13,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:19:13,989 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 324 [2025-02-06 02:19:13,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:13,995 INFO L225 Difference]: With dead ends: 303 [2025-02-06 02:19:13,996 INFO L226 Difference]: Without dead ends: 150 [2025-02-06 02:19:14,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:19:14,002 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:14,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 238 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:19:14,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-02-06 02:19:14,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2025-02-06 02:19:14,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 98 states have internal predecessors, (140), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-06 02:19:14,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 240 transitions. [2025-02-06 02:19:14,076 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 240 transitions. Word has length 324 [2025-02-06 02:19:14,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:14,076 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 240 transitions. [2025-02-06 02:19:14,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-02-06 02:19:14,077 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 240 transitions. [2025-02-06 02:19:14,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-02-06 02:19:14,083 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:14,084 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:19:14,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 02:19:14,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 02:19:14,288 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:14,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:14,289 INFO L85 PathProgramCache]: Analyzing trace with hash -2032726745, now seen corresponding path program 1 times [2025-02-06 02:19:14,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:14,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805852977] [2025-02-06 02:19:14,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:14,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:14,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-02-06 02:19:14,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-02-06 02:19:14,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:14,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:14,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-06 02:19:14,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:14,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805852977] [2025-02-06 02:19:14,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805852977] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:14,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:14,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:19:14,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238458059] [2025-02-06 02:19:14,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:14,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:19:14,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:14,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:19:14,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:19:14,717 INFO L87 Difference]: Start difference. First operand 150 states and 240 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-06 02:19:14,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:14,885 INFO L93 Difference]: Finished difference Result 438 states and 703 transitions. [2025-02-06 02:19:14,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:19:14,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 324 [2025-02-06 02:19:14,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:14,894 INFO L225 Difference]: With dead ends: 438 [2025-02-06 02:19:14,894 INFO L226 Difference]: Without dead ends: 291 [2025-02-06 02:19:14,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:19:14,899 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 211 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:14,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 620 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:19:14,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-02-06 02:19:14,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 190. [2025-02-06 02:19:14,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 138 states have (on average 1.4855072463768115) internal successors, (205), 138 states have internal predecessors, (205), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-06 02:19:14,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 305 transitions. [2025-02-06 02:19:14,941 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 305 transitions. Word has length 324 [2025-02-06 02:19:14,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:14,945 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 305 transitions. [2025-02-06 02:19:14,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-06 02:19:14,945 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 305 transitions. [2025-02-06 02:19:14,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-02-06 02:19:14,951 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:14,951 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:19:14,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:19:14,952 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:14,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:14,953 INFO L85 PathProgramCache]: Analyzing trace with hash -82426490, now seen corresponding path program 1 times [2025-02-06 02:19:14,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:14,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768485832] [2025-02-06 02:19:14,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:14,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:14,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-02-06 02:19:15,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-02-06 02:19:15,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:15,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:15,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-06 02:19:15,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:15,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768485832] [2025-02-06 02:19:15,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768485832] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:15,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:15,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:19:15,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141292468] [2025-02-06 02:19:15,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:15,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:19:15,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:15,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:19:15,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:19:15,328 INFO L87 Difference]: Start difference. First operand 190 states and 305 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-06 02:19:15,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:15,415 INFO L93 Difference]: Finished difference Result 560 states and 901 transitions. [2025-02-06 02:19:15,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:19:15,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 324 [2025-02-06 02:19:15,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:15,423 INFO L225 Difference]: With dead ends: 560 [2025-02-06 02:19:15,423 INFO L226 Difference]: Without dead ends: 373 [2025-02-06 02:19:15,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:19:15,426 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 214 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:15,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 445 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:19:15,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-02-06 02:19:15,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 247. [2025-02-06 02:19:15,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 195 states have (on average 1.5179487179487179) internal successors, (296), 195 states have internal predecessors, (296), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-06 02:19:15,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 396 transitions. [2025-02-06 02:19:15,464 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 396 transitions. Word has length 324 [2025-02-06 02:19:15,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:15,465 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 396 transitions. [2025-02-06 02:19:15,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-06 02:19:15,466 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 396 transitions. [2025-02-06 02:19:15,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-02-06 02:19:15,470 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:15,470 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:19:15,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:19:15,471 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:15,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:15,472 INFO L85 PathProgramCache]: Analyzing trace with hash -983359990, now seen corresponding path program 1 times [2025-02-06 02:19:15,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:15,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738218141] [2025-02-06 02:19:15,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:15,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:15,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-02-06 02:19:15,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-02-06 02:19:15,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:15,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:16,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-06 02:19:16,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:16,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738218141] [2025-02-06 02:19:16,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738218141] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:16,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:16,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:19:16,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336845470] [2025-02-06 02:19:16,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:16,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:19:16,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:16,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:19:16,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:19:16,477 INFO L87 Difference]: Start difference. First operand 247 states and 396 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-06 02:19:16,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:16,896 INFO L93 Difference]: Finished difference Result 791 states and 1261 transitions. [2025-02-06 02:19:16,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:19:16,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 325 [2025-02-06 02:19:16,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:16,905 INFO L225 Difference]: With dead ends: 791 [2025-02-06 02:19:16,906 INFO L226 Difference]: Without dead ends: 547 [2025-02-06 02:19:16,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:19:16,907 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 410 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:16,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 744 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:19:16,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-02-06 02:19:16,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 466. [2025-02-06 02:19:16,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 377 states have (on average 1.530503978779841) internal successors, (577), 378 states have internal predecessors, (577), 86 states have call successors, (86), 2 states have call predecessors, (86), 2 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-06 02:19:16,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 749 transitions. [2025-02-06 02:19:16,967 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 749 transitions. Word has length 325 [2025-02-06 02:19:16,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:16,969 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 749 transitions. [2025-02-06 02:19:16,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-06 02:19:16,969 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 749 transitions. [2025-02-06 02:19:16,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-02-06 02:19:16,975 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:16,975 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:19:16,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:19:16,976 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:16,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:16,977 INFO L85 PathProgramCache]: Analyzing trace with hash 649444009, now seen corresponding path program 1 times [2025-02-06 02:19:16,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:16,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720390785] [2025-02-06 02:19:16,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:16,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:17,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-02-06 02:19:17,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-02-06 02:19:17,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:17,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:18,178 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-06 02:19:18,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:18,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720390785] [2025-02-06 02:19:18,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720390785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:18,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:18,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:19:18,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777209285] [2025-02-06 02:19:18,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:18,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:19:18,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:18,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:19:18,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:19:18,182 INFO L87 Difference]: Start difference. First operand 466 states and 749 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-06 02:19:18,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:18,737 INFO L93 Difference]: Finished difference Result 1010 states and 1613 transitions. [2025-02-06 02:19:18,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:19:18,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 325 [2025-02-06 02:19:18,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:18,745 INFO L225 Difference]: With dead ends: 1010 [2025-02-06 02:19:18,746 INFO L226 Difference]: Without dead ends: 547 [2025-02-06 02:19:18,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:19:18,751 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 370 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:18,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 889 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:19:18,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-02-06 02:19:18,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 466. [2025-02-06 02:19:18,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 377 states have (on average 1.5172413793103448) internal successors, (572), 378 states have internal predecessors, (572), 86 states have call successors, (86), 2 states have call predecessors, (86), 2 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-06 02:19:18,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 744 transitions. [2025-02-06 02:19:18,806 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 744 transitions. Word has length 325 [2025-02-06 02:19:18,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:18,807 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 744 transitions. [2025-02-06 02:19:18,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-06 02:19:18,809 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 744 transitions. [2025-02-06 02:19:18,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-02-06 02:19:18,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:18,815 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:19:18,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:19:18,815 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:18,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:18,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1920042390, now seen corresponding path program 1 times [2025-02-06 02:19:18,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:18,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502344365] [2025-02-06 02:19:18,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:18,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:18,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-02-06 02:19:18,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-02-06 02:19:18,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:18,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:19,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-06 02:19:19,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:19,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502344365] [2025-02-06 02:19:19,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502344365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:19,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:19,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:19:19,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623700792] [2025-02-06 02:19:19,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:19,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:19:19,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:19,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:19:19,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:19:19,842 INFO L87 Difference]: Start difference. First operand 466 states and 744 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-06 02:19:20,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:20,383 INFO L93 Difference]: Finished difference Result 1010 states and 1603 transitions. [2025-02-06 02:19:20,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:19:20,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 325 [2025-02-06 02:19:20,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:20,389 INFO L225 Difference]: With dead ends: 1010 [2025-02-06 02:19:20,389 INFO L226 Difference]: Without dead ends: 547 [2025-02-06 02:19:20,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:19:20,391 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 451 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:20,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 865 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:19:20,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-02-06 02:19:20,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 466. [2025-02-06 02:19:20,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 377 states have (on average 1.5145888594164456) internal successors, (571), 378 states have internal predecessors, (571), 86 states have call successors, (86), 2 states have call predecessors, (86), 2 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-06 02:19:20,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 743 transitions. [2025-02-06 02:19:20,439 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 743 transitions. Word has length 325 [2025-02-06 02:19:20,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:20,440 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 743 transitions. [2025-02-06 02:19:20,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-06 02:19:20,440 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 743 transitions. [2025-02-06 02:19:20,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-02-06 02:19:20,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:20,445 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:19:20,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:19:20,445 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:20,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:20,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1569242453, now seen corresponding path program 1 times [2025-02-06 02:19:20,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:20,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325521905] [2025-02-06 02:19:20,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:20,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:20,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-02-06 02:19:20,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-02-06 02:19:20,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:20,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:22,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-06 02:19:22,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:22,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325521905] [2025-02-06 02:19:22,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325521905] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:22,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:22,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 02:19:22,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248454589] [2025-02-06 02:19:22,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:22,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 02:19:22,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:22,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 02:19:22,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:19:22,367 INFO L87 Difference]: Start difference. First operand 466 states and 743 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-02-06 02:19:27,094 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-06 02:19:31,146 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-06 02:19:32,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:32,637 INFO L93 Difference]: Finished difference Result 2043 states and 3254 transitions. [2025-02-06 02:19:32,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:19:32,638 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 325 [2025-02-06 02:19:32,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:32,650 INFO L225 Difference]: With dead ends: 2043 [2025-02-06 02:19:32,651 INFO L226 Difference]: Without dead ends: 1580 [2025-02-06 02:19:32,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:19:32,654 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 772 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 251 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:32,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 1382 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 967 Invalid, 2 Unknown, 0 Unchecked, 10.0s Time] [2025-02-06 02:19:32,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2025-02-06 02:19:32,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1559. [2025-02-06 02:19:32,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1206 states have (on average 1.494195688225539) internal successors, (1802), 1210 states have internal predecessors, (1802), 344 states have call successors, (344), 8 states have call predecessors, (344), 8 states have return successors, (344), 340 states have call predecessors, (344), 344 states have call successors, (344) [2025-02-06 02:19:32,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2490 transitions. [2025-02-06 02:19:32,819 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2490 transitions. Word has length 325 [2025-02-06 02:19:32,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:32,821 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2490 transitions. [2025-02-06 02:19:32,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-02-06 02:19:32,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2490 transitions. [2025-02-06 02:19:32,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-02-06 02:19:32,827 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:32,827 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:19:32,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:19:32,828 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:32,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:32,828 INFO L85 PathProgramCache]: Analyzing trace with hash 857044838, now seen corresponding path program 1 times [2025-02-06 02:19:32,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:32,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976658033] [2025-02-06 02:19:32,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:32,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:32,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-02-06 02:19:33,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-02-06 02:19:33,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:33,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:34,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-06 02:19:34,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:34,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976658033] [2025-02-06 02:19:34,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976658033] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:34,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:34,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:19:34,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068800339] [2025-02-06 02:19:34,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:34,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:19:34,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:34,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:19:34,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:19:34,541 INFO L87 Difference]: Start difference. First operand 1559 states and 2490 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-02-06 02:19:39,574 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-06 02:19:40,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:40,737 INFO L93 Difference]: Finished difference Result 3855 states and 6155 transitions. [2025-02-06 02:19:40,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:19:40,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 325 [2025-02-06 02:19:40,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:40,758 INFO L225 Difference]: With dead ends: 3855 [2025-02-06 02:19:40,759 INFO L226 Difference]: Without dead ends: 2299 [2025-02-06 02:19:40,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:19:40,767 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 548 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 150 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:40,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 996 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 546 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2025-02-06 02:19:40,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2299 states. [2025-02-06 02:19:40,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2299 to 2285. [2025-02-06 02:19:40,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2285 states, 1756 states have (on average 1.4908883826879271) internal successors, (2618), 1762 states have internal predecessors, (2618), 516 states have call successors, (516), 12 states have call predecessors, (516), 12 states have return successors, (516), 510 states have call predecessors, (516), 516 states have call successors, (516) [2025-02-06 02:19:40,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2285 states to 2285 states and 3650 transitions. [2025-02-06 02:19:40,994 INFO L78 Accepts]: Start accepts. Automaton has 2285 states and 3650 transitions. Word has length 325 [2025-02-06 02:19:40,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:40,995 INFO L471 AbstractCegarLoop]: Abstraction has 2285 states and 3650 transitions. [2025-02-06 02:19:40,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-02-06 02:19:40,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2285 states and 3650 transitions. [2025-02-06 02:19:41,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-02-06 02:19:41,001 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:41,001 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:19:41,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:19:41,002 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:41,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:41,002 INFO L85 PathProgramCache]: Analyzing trace with hash 478220009, now seen corresponding path program 1 times [2025-02-06 02:19:41,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:41,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895057075] [2025-02-06 02:19:41,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:41,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:41,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-02-06 02:19:41,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-02-06 02:19:41,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:41,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:41,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-06 02:19:41,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:41,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895057075] [2025-02-06 02:19:41,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895057075] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:41,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:41,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:19:41,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390462207] [2025-02-06 02:19:41,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:41,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:19:41,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:41,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:19:41,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:19:41,626 INFO L87 Difference]: Start difference. First operand 2285 states and 3650 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-06 02:19:42,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:42,453 INFO L93 Difference]: Finished difference Result 4918 states and 7834 transitions. [2025-02-06 02:19:42,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:19:42,454 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 325 [2025-02-06 02:19:42,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:42,478 INFO L225 Difference]: With dead ends: 4918 [2025-02-06 02:19:42,478 INFO L226 Difference]: Without dead ends: 2636 [2025-02-06 02:19:42,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:19:42,488 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 430 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:42,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 1027 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 02:19:42,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2025-02-06 02:19:42,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2459. [2025-02-06 02:19:42,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2459 states, 1828 states have (on average 1.4715536105032823) internal successors, (2690), 1835 states have internal predecessors, (2690), 612 states have call successors, (612), 18 states have call predecessors, (612), 18 states have return successors, (612), 605 states have call predecessors, (612), 612 states have call successors, (612) [2025-02-06 02:19:42,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 3914 transitions. [2025-02-06 02:19:42,741 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 3914 transitions. Word has length 325 [2025-02-06 02:19:42,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:42,742 INFO L471 AbstractCegarLoop]: Abstraction has 2459 states and 3914 transitions. [2025-02-06 02:19:42,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-06 02:19:42,743 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 3914 transitions. [2025-02-06 02:19:42,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-02-06 02:19:42,748 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:42,749 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:19:42,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:19:42,750 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:42,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:42,750 INFO L85 PathProgramCache]: Analyzing trace with hash 2111024008, now seen corresponding path program 1 times [2025-02-06 02:19:42,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:42,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433002288] [2025-02-06 02:19:42,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:42,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:42,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-02-06 02:19:42,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-02-06 02:19:42,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:42,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:43,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-06 02:19:43,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:43,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433002288] [2025-02-06 02:19:43,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433002288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:43,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:43,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:19:43,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503016144] [2025-02-06 02:19:43,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:43,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:19:43,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:43,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:19:43,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:19:43,360 INFO L87 Difference]: Start difference. First operand 2459 states and 3914 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-06 02:19:44,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:44,682 INFO L93 Difference]: Finished difference Result 4747 states and 7541 transitions. [2025-02-06 02:19:44,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:19:44,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 325 [2025-02-06 02:19:44,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:44,703 INFO L225 Difference]: With dead ends: 4747 [2025-02-06 02:19:44,704 INFO L226 Difference]: Without dead ends: 2350 [2025-02-06 02:19:44,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:19:44,713 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 469 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:44,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 929 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 02:19:44,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2350 states. [2025-02-06 02:19:44,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2350 to 2171. [2025-02-06 02:19:44,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2171 states, 1576 states have (on average 1.4378172588832487) internal successors, (2266), 1582 states have internal predecessors, (2266), 576 states have call successors, (576), 18 states have call predecessors, (576), 18 states have return successors, (576), 570 states have call predecessors, (576), 576 states have call successors, (576) [2025-02-06 02:19:44,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2171 states to 2171 states and 3418 transitions. [2025-02-06 02:19:44,967 INFO L78 Accepts]: Start accepts. Automaton has 2171 states and 3418 transitions. Word has length 325 [2025-02-06 02:19:44,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:44,967 INFO L471 AbstractCegarLoop]: Abstraction has 2171 states and 3418 transitions. [2025-02-06 02:19:44,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-06 02:19:44,968 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 3418 transitions. [2025-02-06 02:19:44,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-02-06 02:19:44,971 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:44,971 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:19:44,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:19:44,972 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:44,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:44,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1822661304, now seen corresponding path program 1 times [2025-02-06 02:19:44,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:44,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658199170] [2025-02-06 02:19:44,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:44,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:45,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-02-06 02:19:45,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-02-06 02:19:45,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:45,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:46,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-06 02:19:46,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:46,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658199170] [2025-02-06 02:19:46,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658199170] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:46,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:46,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:19:46,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089023770] [2025-02-06 02:19:46,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:46,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:19:46,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:46,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:19:46,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:19:46,650 INFO L87 Difference]: Start difference. First operand 2171 states and 3418 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-06 02:19:48,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-06 02:19:49,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-06 02:19:51,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:51,199 INFO L93 Difference]: Finished difference Result 3522 states and 5539 transitions. [2025-02-06 02:19:51,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:19:51,200 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 326 [2025-02-06 02:19:51,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:51,219 INFO L225 Difference]: With dead ends: 3522 [2025-02-06 02:19:51,219 INFO L226 Difference]: Without dead ends: 3039 [2025-02-06 02:19:51,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:19:51,223 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 395 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:51,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1328 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-02-06 02:19:51,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3039 states. [2025-02-06 02:19:51,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3039 to 2012. [2025-02-06 02:19:51,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2012 states, 1516 states have (on average 1.4538258575197889) internal successors, (2204), 1521 states have internal predecessors, (2204), 480 states have call successors, (480), 15 states have call predecessors, (480), 15 states have return successors, (480), 475 states have call predecessors, (480), 480 states have call successors, (480) [2025-02-06 02:19:51,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 3164 transitions. [2025-02-06 02:19:51,435 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 3164 transitions. Word has length 326 [2025-02-06 02:19:51,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:51,436 INFO L471 AbstractCegarLoop]: Abstraction has 2012 states and 3164 transitions. [2025-02-06 02:19:51,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-06 02:19:51,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 3164 transitions. [2025-02-06 02:19:51,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-02-06 02:19:51,440 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:51,441 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:19:51,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:19:51,441 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:51,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:51,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1987749710, now seen corresponding path program 1 times [2025-02-06 02:19:51,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:51,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961849166] [2025-02-06 02:19:51,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:51,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:51,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-02-06 02:19:51,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-02-06 02:19:51,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:51,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:52,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-06 02:19:52,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:52,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961849166] [2025-02-06 02:19:52,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961849166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:19:52,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:19:52,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:19:52,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525031414] [2025-02-06 02:19:52,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:19:52,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:19:52,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:52,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:19:52,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:19:52,596 INFO L87 Difference]: Start difference. First operand 2012 states and 3164 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-06 02:19:53,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:19:53,631 INFO L93 Difference]: Finished difference Result 4703 states and 7396 transitions. [2025-02-06 02:19:53,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:19:53,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 326 [2025-02-06 02:19:53,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:19:53,653 INFO L225 Difference]: With dead ends: 4703 [2025-02-06 02:19:53,653 INFO L226 Difference]: Without dead ends: 2694 [2025-02-06 02:19:53,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:19:53,663 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 222 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 02:19:53,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 522 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 02:19:53,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2694 states. [2025-02-06 02:19:53,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2694 to 951. [2025-02-06 02:19:53,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 752 states have (on average 1.476063829787234) internal successors, (1110), 754 states have internal predecessors, (1110), 192 states have call successors, (192), 6 states have call predecessors, (192), 6 states have return successors, (192), 190 states have call predecessors, (192), 192 states have call successors, (192) [2025-02-06 02:19:53,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1494 transitions. [2025-02-06 02:19:53,827 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1494 transitions. Word has length 326 [2025-02-06 02:19:53,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:19:53,829 INFO L471 AbstractCegarLoop]: Abstraction has 951 states and 1494 transitions. [2025-02-06 02:19:53,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-06 02:19:53,830 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1494 transitions. [2025-02-06 02:19:53,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-02-06 02:19:53,832 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:19:53,832 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:19:53,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:19:53,833 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:19:53,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:19:53,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1947233529, now seen corresponding path program 1 times [2025-02-06 02:19:53,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:19:53,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131061559] [2025-02-06 02:19:53,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:53,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:19:53,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-02-06 02:19:54,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-02-06 02:19:54,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:54,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:54,584 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 108 proven. 39 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-02-06 02:19:54,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:19:54,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131061559] [2025-02-06 02:19:54,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131061559] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:19:54,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210705839] [2025-02-06 02:19:54,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:19:54,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:19:54,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:19:54,591 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:19:54,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 02:19:54,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-02-06 02:19:54,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-02-06 02:19:54,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:19:54,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:19:54,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 02:19:54,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:19:55,231 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2074 proven. 39 refuted. 0 times theorem prover too weak. 2787 trivial. 0 not checked. [2025-02-06 02:19:55,231 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:19:55,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 108 proven. 39 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-02-06 02:19:55,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210705839] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:19:55,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:19:55,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 8] total 18 [2025-02-06 02:19:55,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381734220] [2025-02-06 02:19:55,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:19:55,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 02:19:55,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:19:55,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 02:19:55,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-02-06 02:19:55,827 INFO L87 Difference]: Start difference. First operand 951 states and 1494 transitions. Second operand has 18 states, 18 states have (on average 7.166666666666667) internal successors, (129), 18 states have internal predecessors, (129), 4 states have call successors, (76), 3 states have call predecessors, (76), 6 states have return successors, (77), 4 states have call predecessors, (77), 4 states have call successors, (77) [2025-02-06 02:20:02,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:20:02,181 INFO L93 Difference]: Finished difference Result 3165 states and 4766 transitions. [2025-02-06 02:20:02,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-02-06 02:20:02,182 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.166666666666667) internal successors, (129), 18 states have internal predecessors, (129), 4 states have call successors, (76), 3 states have call predecessors, (76), 6 states have return successors, (77), 4 states have call predecessors, (77), 4 states have call successors, (77) Word has length 326 [2025-02-06 02:20:02,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:20:02,199 INFO L225 Difference]: With dead ends: 3165 [2025-02-06 02:20:02,200 INFO L226 Difference]: Without dead ends: 2217 [2025-02-06 02:20:02,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 729 GetRequests, 653 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=906, Invalid=5100, Unknown=0, NotChecked=0, Total=6006 [2025-02-06 02:20:02,206 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 1598 mSDsluCounter, 3769 mSDsCounter, 0 mSdLazyCounter, 4093 mSolverCounterSat, 893 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1638 SdHoareTripleChecker+Valid, 4399 SdHoareTripleChecker+Invalid, 4986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 893 IncrementalHoareTripleChecker+Valid, 4093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-02-06 02:20:02,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1638 Valid, 4399 Invalid, 4986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [893 Valid, 4093 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-02-06 02:20:02,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2025-02-06 02:20:02,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 871. [2025-02-06 02:20:02,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 652 states have (on average 1.366564417177914) internal successors, (891), 654 states have internal predecessors, (891), 200 states have call successors, (200), 18 states have call predecessors, (200), 18 states have return successors, (200), 198 states have call predecessors, (200), 200 states have call successors, (200) [2025-02-06 02:20:02,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1291 transitions. [2025-02-06 02:20:02,395 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1291 transitions. Word has length 326 [2025-02-06 02:20:02,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:20:02,401 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 1291 transitions. [2025-02-06 02:20:02,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.166666666666667) internal successors, (129), 18 states have internal predecessors, (129), 4 states have call successors, (76), 3 states have call predecessors, (76), 6 states have return successors, (77), 4 states have call predecessors, (77), 4 states have call successors, (77) [2025-02-06 02:20:02,402 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1291 transitions. [2025-02-06 02:20:02,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-02-06 02:20:02,409 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:20:02,409 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:20:02,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 02:20:02,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:20:02,613 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:20:02,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:20:02,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1872789975, now seen corresponding path program 1 times [2025-02-06 02:20:02,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:20:02,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067166946] [2025-02-06 02:20:02,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:02,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:20:02,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-02-06 02:20:02,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-02-06 02:20:02,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:02,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:03,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-02-06 02:20:03,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:20:03,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067166946] [2025-02-06 02:20:03,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067166946] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:20:03,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:20:03,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:20:03,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526809684] [2025-02-06 02:20:03,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:20:03,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:20:03,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:20:03,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:20:03,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:20:03,128 INFO L87 Difference]: Start difference. First operand 871 states and 1291 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-06 02:20:03,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:20:03,874 INFO L93 Difference]: Finished difference Result 1883 states and 2784 transitions. [2025-02-06 02:20:03,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:20:03,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 326 [2025-02-06 02:20:03,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:20:03,881 INFO L225 Difference]: With dead ends: 1883 [2025-02-06 02:20:03,882 INFO L226 Difference]: Without dead ends: 1015 [2025-02-06 02:20:03,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:20:03,885 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 503 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:20:03,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 742 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 02:20:03,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2025-02-06 02:20:04,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 813. [2025-02-06 02:20:04,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 594 states have (on average 1.3468013468013469) internal successors, (800), 596 states have internal predecessors, (800), 200 states have call successors, (200), 18 states have call predecessors, (200), 18 states have return successors, (200), 198 states have call predecessors, (200), 200 states have call successors, (200) [2025-02-06 02:20:04,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1200 transitions. [2025-02-06 02:20:04,105 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1200 transitions. Word has length 326 [2025-02-06 02:20:04,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:20:04,105 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 1200 transitions. [2025-02-06 02:20:04,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-02-06 02:20:04,106 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1200 transitions. [2025-02-06 02:20:04,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-02-06 02:20:04,110 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:20:04,110 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:20:04,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 02:20:04,110 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:20:04,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:20:04,111 INFO L85 PathProgramCache]: Analyzing trace with hash 412073480, now seen corresponding path program 1 times [2025-02-06 02:20:04,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:20:04,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902990478] [2025-02-06 02:20:04,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:04,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:20:04,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-02-06 02:20:04,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-02-06 02:20:04,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:04,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:04,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 138 proven. 9 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-02-06 02:20:04,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:20:04,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902990478] [2025-02-06 02:20:04,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902990478] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:20:04,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877457564] [2025-02-06 02:20:04,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:04,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:20:04,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:20:04,676 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:20:04,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 02:20:04,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-02-06 02:20:04,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-02-06 02:20:04,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:04,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:04,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:20:04,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:20:05,034 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 693 proven. 9 refuted. 0 times theorem prover too weak. 4198 trivial. 0 not checked. [2025-02-06 02:20:05,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:20:05,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 138 proven. 9 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-02-06 02:20:05,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877457564] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:20:05,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:20:05,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-06 02:20:05,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530702100] [2025-02-06 02:20:05,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:20:05,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 02:20:05,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:20:05,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 02:20:05,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:20:05,308 INFO L87 Difference]: Start difference. First operand 813 states and 1200 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2025-02-06 02:20:05,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:20:05,817 INFO L93 Difference]: Finished difference Result 1555 states and 2280 transitions. [2025-02-06 02:20:05,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 02:20:05,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) Word has length 326 [2025-02-06 02:20:05,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:20:05,822 INFO L225 Difference]: With dead ends: 1555 [2025-02-06 02:20:05,822 INFO L226 Difference]: Without dead ends: 745 [2025-02-06 02:20:05,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 657 GetRequests, 649 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:20:05,827 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 286 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:20:05,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 413 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:20:05,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2025-02-06 02:20:05,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 442. [2025-02-06 02:20:05,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 330 states have (on average 1.3333333333333333) internal successors, (440), 331 states have internal predecessors, (440), 100 states have call successors, (100), 11 states have call predecessors, (100), 11 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-06 02:20:05,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 640 transitions. [2025-02-06 02:20:05,940 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 640 transitions. Word has length 326 [2025-02-06 02:20:05,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:20:05,941 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 640 transitions. [2025-02-06 02:20:05,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2025-02-06 02:20:05,941 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 640 transitions. [2025-02-06 02:20:05,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-02-06 02:20:05,943 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:20:05,943 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:20:05,953 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-06 02:20:06,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:20:06,144 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:20:06,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:20:06,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1213283318, now seen corresponding path program 1 times [2025-02-06 02:20:06,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:20:06,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897614976] [2025-02-06 02:20:06,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:06,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:20:06,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-02-06 02:20:06,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-02-06 02:20:06,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:06,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:07,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 132 proven. 15 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-02-06 02:20:07,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:20:07,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897614976] [2025-02-06 02:20:07,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897614976] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:20:07,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130377342] [2025-02-06 02:20:07,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:07,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:20:07,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:20:07,362 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-06 02:20:07,381 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-06 02:20:07,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-02-06 02:20:07,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-02-06 02:20:07,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:07,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:07,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 02:20:07,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:20:08,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 1017 proven. 15 refuted. 0 times theorem prover too weak. 3868 trivial. 0 not checked. [2025-02-06 02:20:08,317 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:20:09,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 132 proven. 15 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-02-06 02:20:09,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130377342] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:20:09,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:20:09,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 23 [2025-02-06 02:20:09,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395475166] [2025-02-06 02:20:09,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:20:09,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 02:20:09,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:20:09,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 02:20:09,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2025-02-06 02:20:09,086 INFO L87 Difference]: Start difference. First operand 442 states and 640 transitions. Second operand has 23 states, 23 states have (on average 6.391304347826087) internal successors, (147), 23 states have internal predecessors, (147), 4 states have call successors, (150), 3 states have call predecessors, (150), 6 states have return successors, (150), 4 states have call predecessors, (150), 4 states have call successors, (150) [2025-02-06 02:20:12,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:20:12,248 INFO L93 Difference]: Finished difference Result 1784 states and 2541 transitions. [2025-02-06 02:20:12,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-06 02:20:12,248 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.391304347826087) internal successors, (147), 23 states have internal predecessors, (147), 4 states have call successors, (150), 3 states have call predecessors, (150), 6 states have return successors, (150), 4 states have call predecessors, (150), 4 states have call successors, (150) Word has length 327 [2025-02-06 02:20:12,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:20:12,256 INFO L225 Difference]: With dead ends: 1784 [2025-02-06 02:20:12,256 INFO L226 Difference]: Without dead ends: 1345 [2025-02-06 02:20:12,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 698 GetRequests, 647 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=509, Invalid=2247, Unknown=0, NotChecked=0, Total=2756 [2025-02-06 02:20:12,260 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 1854 mSDsluCounter, 2194 mSDsCounter, 0 mSdLazyCounter, 2631 mSolverCounterSat, 975 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1856 SdHoareTripleChecker+Valid, 2498 SdHoareTripleChecker+Invalid, 3606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 975 IncrementalHoareTripleChecker+Valid, 2631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:20:12,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1856 Valid, 2498 Invalid, 3606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [975 Valid, 2631 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-06 02:20:12,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2025-02-06 02:20:12,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 810. [2025-02-06 02:20:12,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 535 states have (on average 1.2429906542056075) internal successors, (665), 538 states have internal predecessors, (665), 245 states have call successors, (245), 29 states have call predecessors, (245), 29 states have return successors, (245), 242 states have call predecessors, (245), 245 states have call successors, (245) [2025-02-06 02:20:12,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1155 transitions. [2025-02-06 02:20:12,459 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1155 transitions. Word has length 327 [2025-02-06 02:20:12,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:20:12,460 INFO L471 AbstractCegarLoop]: Abstraction has 810 states and 1155 transitions. [2025-02-06 02:20:12,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.391304347826087) internal successors, (147), 23 states have internal predecessors, (147), 4 states have call successors, (150), 3 states have call predecessors, (150), 6 states have return successors, (150), 4 states have call predecessors, (150), 4 states have call successors, (150) [2025-02-06 02:20:12,460 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1155 transitions. [2025-02-06 02:20:12,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-02-06 02:20:12,462 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:20:12,462 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:20:12,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 02:20:12,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-06 02:20:12,663 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:20:12,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:20:12,664 INFO L85 PathProgramCache]: Analyzing trace with hash -2131988608, now seen corresponding path program 1 times [2025-02-06 02:20:12,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:20:12,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042202631] [2025-02-06 02:20:12,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:12,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:20:12,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-02-06 02:20:12,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-02-06 02:20:12,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:12,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:14,165 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 303 proven. 249 refuted. 0 times theorem prover too weak. 4348 trivial. 0 not checked. [2025-02-06 02:20:14,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:20:14,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042202631] [2025-02-06 02:20:14,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042202631] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:20:14,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951111739] [2025-02-06 02:20:14,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:14,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:20:14,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:20:14,169 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:20:14,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 02:20:14,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-02-06 02:20:14,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-02-06 02:20:14,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:14,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:14,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 02:20:14,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:20:15,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 3340 proven. 249 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2025-02-06 02:20:15,954 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:20:17,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 303 proven. 267 refuted. 0 times theorem prover too weak. 4330 trivial. 0 not checked. [2025-02-06 02:20:17,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951111739] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:20:17,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:20:17,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 14] total 30 [2025-02-06 02:20:17,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675789569] [2025-02-06 02:20:17,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:20:17,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-06 02:20:17,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:20:17,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-06 02:20:17,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=602, Unknown=0, NotChecked=0, Total=870 [2025-02-06 02:20:17,215 INFO L87 Difference]: Start difference. First operand 810 states and 1155 transitions. Second operand has 30 states, 27 states have (on average 7.37037037037037) internal successors, (199), 27 states have internal predecessors, (199), 13 states have call successors, (108), 5 states have call predecessors, (108), 12 states have return successors, (109), 12 states have call predecessors, (109), 13 states have call successors, (109)