./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label52.c --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/eca-rers2012/Problem19_label52.c -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 7d08753ec3d09588e14fe223037879a9e4c26dd4e0293239a5101a4dc04bd1c9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 12:19:27,906 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 12:19:27,958 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 12:19:27,964 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 12:19:27,966 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 12:19:27,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 12:19:27,988 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 12:19:27,988 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 12:19:27,988 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 12:19:27,988 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 12:19:27,989 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 12:19:27,989 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 12:19:27,989 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 12:19:27,990 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 12:19:27,990 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 12:19:27,990 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 12:19:27,990 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 12:19:27,990 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 12:19:27,990 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 12:19:27,990 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 12:19:27,991 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 12:19:27,991 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 12:19:27,991 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 12:19:27,991 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 12:19:27,991 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 12:19:27,991 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 12:19:27,991 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 12:19:27,991 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 12:19:27,991 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 12:19:27,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 12:19:27,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 12:19:27,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 12:19:27,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:19:27,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 12:19:27,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 12:19:27,992 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 12:19:27,992 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 12:19:27,992 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 12:19:27,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 12:19:27,992 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 12:19:27,993 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 12:19:27,993 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 12:19:27,993 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 12:19:27,993 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 -> 7d08753ec3d09588e14fe223037879a9e4c26dd4e0293239a5101a4dc04bd1c9 [2025-02-05 12:19:28,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 12:19:28,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 12:19:28,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 12:19:28,223 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 12:19:28,223 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 12:19:28,224 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label52.c [2025-02-05 12:19:29,337 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dc21caf3c/e5e778ef01ba4443aa7fbc4f520e27e3/FLAG414a7b43b [2025-02-05 12:19:29,757 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 12:19:29,758 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label52.c [2025-02-05 12:19:29,796 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dc21caf3c/e5e778ef01ba4443aa7fbc4f520e27e3/FLAG414a7b43b [2025-02-05 12:19:29,810 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dc21caf3c/e5e778ef01ba4443aa7fbc4f520e27e3 [2025-02-05 12:19:29,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 12:19:29,814 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 12:19:29,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 12:19:29,815 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 12:19:29,818 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 12:19:29,819 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:19:29" (1/1) ... [2025-02-05 12:19:29,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f773c06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:19:29, skipping insertion in model container [2025-02-05 12:19:29,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:19:29" (1/1) ... [2025-02-05 12:19:29,918 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 12:19:30,151 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/eca-rers2012/Problem19_label52.c[7226,7239] [2025-02-05 12:19:30,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:19:30,848 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 12:19:30,864 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/eca-rers2012/Problem19_label52.c[7226,7239] [2025-02-05 12:19:31,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:19:31,287 INFO L204 MainTranslator]: Completed translation [2025-02-05 12:19:31,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:19:31 WrapperNode [2025-02-05 12:19:31,289 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 12:19:31,289 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 12:19:31,289 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 12:19:31,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 12:19:31,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:19:31" (1/1) ... [2025-02-05 12:19:31,367 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:19:31" (1/1) ... [2025-02-05 12:19:32,037 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9428 [2025-02-05 12:19:32,038 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 12:19:32,038 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 12:19:32,038 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 12:19:32,039 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 12:19:32,045 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:19:31" (1/1) ... [2025-02-05 12:19:32,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:19:31" (1/1) ... [2025-02-05 12:19:32,128 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:19:31" (1/1) ... [2025-02-05 12:19:32,368 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 12:19:32,369 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:19:31" (1/1) ... [2025-02-05 12:19:32,369 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:19:31" (1/1) ... [2025-02-05 12:19:32,582 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:19:31" (1/1) ... [2025-02-05 12:19:32,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:19:31" (1/1) ... [2025-02-05 12:19:32,628 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:19:31" (1/1) ... [2025-02-05 12:19:32,651 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:19:31" (1/1) ... [2025-02-05 12:19:32,713 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 12:19:32,714 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 12:19:32,715 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 12:19:32,715 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 12:19:32,715 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:19:31" (1/1) ... [2025-02-05 12:19:32,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:19:32,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:19:32,739 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 12:19:32,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 12:19:32,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 12:19:32,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 12:19:32,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 12:19:32,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 12:19:32,807 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 12:19:32,809 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 12:19:38,484 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6717: havoc calculate_output4_#t~ret14#1; [2025-02-05 12:19:38,484 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3435: havoc calculate_output2_#t~ret12#1; [2025-02-05 12:19:38,485 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1859: havoc calculate_output_#t~ret11#1; [2025-02-05 12:19:38,485 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8350: havoc calculate_output5_#t~ret15#1; [2025-02-05 12:19:38,485 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5079: havoc calculate_output3_#t~ret13#1; [2025-02-05 12:19:38,688 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2025-02-05 12:19:38,689 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 12:19:38,729 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 12:19:38,730 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 12:19:38,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:19:38 BoogieIcfgContainer [2025-02-05 12:19:38,730 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 12:19:38,731 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 12:19:38,731 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 12:19:38,735 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 12:19:38,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:19:29" (1/3) ... [2025-02-05 12:19:38,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@531d7c6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:19:38, skipping insertion in model container [2025-02-05 12:19:38,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:19:31" (2/3) ... [2025-02-05 12:19:38,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@531d7c6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:19:38, skipping insertion in model container [2025-02-05 12:19:38,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:19:38" (3/3) ... [2025-02-05 12:19:38,738 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem19_label52.c [2025-02-05 12:19:38,748 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 12:19:38,751 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem19_label52.c that has 1 procedures, 1748 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 12:19:38,818 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 12:19:38,828 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;@7ed69f3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 12:19:38,828 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 12:19:38,837 INFO L276 IsEmpty]: Start isEmpty. Operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:19:38,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-05 12:19:38,844 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:19:38,844 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:19:38,845 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:19:38,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:19:38,849 INFO L85 PathProgramCache]: Analyzing trace with hash 202954615, now seen corresponding path program 1 times [2025-02-05 12:19:38,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:19:38,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390664433] [2025-02-05 12:19:38,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:19:38,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:19:38,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-05 12:19:38,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-05 12:19:38,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:19:38,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:19:39,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:19:39,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:19:39,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390664433] [2025-02-05 12:19:39,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390664433] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:19:39,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:19:39,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:19:39,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192614801] [2025-02-05 12:19:39,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:19:39,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:19:39,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:19:39,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:19:39,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:19:39,305 INFO L87 Difference]: Start difference. First operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:19:47,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:19:47,420 INFO L93 Difference]: Finished difference Result 6287 states and 12039 transitions. [2025-02-05 12:19:47,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:19:47,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-02-05 12:19:47,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:19:47,451 INFO L225 Difference]: With dead ends: 6287 [2025-02-05 12:19:47,451 INFO L226 Difference]: Without dead ends: 4470 [2025-02-05 12:19:47,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 12:19:47,460 INFO L435 NwaCegarLoop]: 717 mSDtfsCounter, 4581 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 7115 mSolverCounterSat, 3689 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4581 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 10804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3689 IncrementalHoareTripleChecker+Valid, 7115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2025-02-05 12:19:47,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4581 Valid, 998 Invalid, 10804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3689 Valid, 7115 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2025-02-05 12:19:47,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4470 states. [2025-02-05 12:19:47,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4470 to 4467. [2025-02-05 12:19:47,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4467 states, 4466 states have (on average 1.5685176892073445) internal successors, (7005), 4466 states have internal predecessors, (7005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:19:47,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4467 states to 4467 states and 7005 transitions. [2025-02-05 12:19:47,616 INFO L78 Accepts]: Start accepts. Automaton has 4467 states and 7005 transitions. Word has length 55 [2025-02-05 12:19:47,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:19:47,618 INFO L471 AbstractCegarLoop]: Abstraction has 4467 states and 7005 transitions. [2025-02-05 12:19:47,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:19:47,618 INFO L276 IsEmpty]: Start isEmpty. Operand 4467 states and 7005 transitions. [2025-02-05 12:19:47,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-02-05 12:19:47,628 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:19:47,628 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:19:47,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 12:19:47,629 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:19:47,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:19:47,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1547778027, now seen corresponding path program 1 times [2025-02-05 12:19:47,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:19:47,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029077209] [2025-02-05 12:19:47,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:19:47,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:19:47,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-02-05 12:19:47,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-02-05 12:19:47,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:19:47,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:19:48,654 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-02-05 12:19:48,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:19:48,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029077209] [2025-02-05 12:19:48,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029077209] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:19:48,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:19:48,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:19:48,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256526365] [2025-02-05 12:19:48,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:19:48,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:19:48,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:19:48,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:19:48,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:19:48,657 INFO L87 Difference]: Start difference. First operand 4467 states and 7005 transitions. Second operand has 4 states, 4 states have (on average 69.25) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:19:55,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:19:55,996 INFO L93 Difference]: Finished difference Result 11709 states and 20252 transitions. [2025-02-05 12:19:55,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:19:55,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.25) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 329 [2025-02-05 12:19:55,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:19:56,071 INFO L225 Difference]: With dead ends: 11709 [2025-02-05 12:19:56,071 INFO L226 Difference]: Without dead ends: 8609 [2025-02-05 12:19:56,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 12:19:56,077 INFO L435 NwaCegarLoop]: 1805 mSDtfsCounter, 3756 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 9457 mSolverCounterSat, 1343 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3756 SdHoareTripleChecker+Valid, 2160 SdHoareTripleChecker+Invalid, 10800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1343 IncrementalHoareTripleChecker+Valid, 9457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:19:56,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3756 Valid, 2160 Invalid, 10800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1343 Valid, 9457 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2025-02-05 12:19:56,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8609 states. [2025-02-05 12:19:56,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8609 to 8595. [2025-02-05 12:19:56,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8595 states, 8594 states have (on average 1.350942518035839) internal successors, (11610), 8594 states have internal predecessors, (11610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:19:56,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8595 states to 8595 states and 11610 transitions. [2025-02-05 12:19:56,226 INFO L78 Accepts]: Start accepts. Automaton has 8595 states and 11610 transitions. Word has length 329 [2025-02-05 12:19:56,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:19:56,227 INFO L471 AbstractCegarLoop]: Abstraction has 8595 states and 11610 transitions. [2025-02-05 12:19:56,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.25) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:19:56,227 INFO L276 IsEmpty]: Start isEmpty. Operand 8595 states and 11610 transitions. [2025-02-05 12:19:56,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-02-05 12:19:56,232 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:19:56,232 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:19:56,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 12:19:56,233 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:19:56,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:19:56,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1250842493, now seen corresponding path program 1 times [2025-02-05 12:19:56,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:19:56,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75776429] [2025-02-05 12:19:56,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:19:56,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:19:56,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-02-05 12:19:56,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-02-05 12:19:56,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:19:56,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:19:56,723 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-05 12:19:56,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:19:56,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75776429] [2025-02-05 12:19:56,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75776429] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:19:56,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:19:56,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:19:56,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933921451] [2025-02-05 12:19:56,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:19:56,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:19:56,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:19:56,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:19:56,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:19:56,725 INFO L87 Difference]: Start difference. First operand 8595 states and 11610 transitions. Second operand has 4 states, 4 states have (on average 82.75) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:01,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:20:01,336 INFO L93 Difference]: Finished difference Result 14489 states and 20501 transitions. [2025-02-05 12:20:01,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:20:01,339 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.75) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 357 [2025-02-05 12:20:01,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:20:01,361 INFO L225 Difference]: With dead ends: 14489 [2025-02-05 12:20:01,362 INFO L226 Difference]: Without dead ends: 8595 [2025-02-05 12:20:01,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-05 12:20:01,371 INFO L435 NwaCegarLoop]: 1776 mSDtfsCounter, 1138 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 7327 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 2118 SdHoareTripleChecker+Invalid, 7335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 7327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:20:01,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 2118 Invalid, 7335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 7327 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-02-05 12:20:01,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8595 states. [2025-02-05 12:20:01,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8595 to 8595. [2025-02-05 12:20:01,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8595 states, 8594 states have (on average 1.349429834768443) internal successors, (11597), 8594 states have internal predecessors, (11597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:01,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8595 states to 8595 states and 11597 transitions. [2025-02-05 12:20:01,479 INFO L78 Accepts]: Start accepts. Automaton has 8595 states and 11597 transitions. Word has length 357 [2025-02-05 12:20:01,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:20:01,479 INFO L471 AbstractCegarLoop]: Abstraction has 8595 states and 11597 transitions. [2025-02-05 12:20:01,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.75) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:01,480 INFO L276 IsEmpty]: Start isEmpty. Operand 8595 states and 11597 transitions. [2025-02-05 12:20:01,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2025-02-05 12:20:01,489 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:20:01,491 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:20:01,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 12:20:01,491 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:20:01,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:20:01,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1421958924, now seen corresponding path program 1 times [2025-02-05 12:20:01,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:20:01,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070088990] [2025-02-05 12:20:01,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:20:01,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:20:01,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 609 statements into 1 equivalence classes. [2025-02-05 12:20:01,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 609 of 609 statements. [2025-02-05 12:20:01,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:20:01,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:20:02,166 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 105 proven. 37 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-05 12:20:02,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:20:02,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070088990] [2025-02-05 12:20:02,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070088990] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:20:02,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992247946] [2025-02-05 12:20:02,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:20:02,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:20:02,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:20:02,169 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 12:20:02,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 12:20:02,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 609 statements into 1 equivalence classes. [2025-02-05 12:20:02,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 609 of 609 statements. [2025-02-05 12:20:02,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:20:02,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:20:02,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 12:20:02,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:20:02,468 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:20:02,469 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 12:20:02,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992247946] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:20:02,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 12:20:02,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-02-05 12:20:02,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181593011] [2025-02-05 12:20:02,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:20:02,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:20:02,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:20:02,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:20:02,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 12:20:02,471 INFO L87 Difference]: Start difference. First operand 8595 states and 11597 transitions. Second operand has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:06,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:20:06,741 INFO L93 Difference]: Finished difference Result 19939 states and 28772 transitions. [2025-02-05 12:20:06,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:20:06,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 609 [2025-02-05 12:20:06,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:20:06,773 INFO L225 Difference]: With dead ends: 19939 [2025-02-05 12:20:06,773 INFO L226 Difference]: Without dead ends: 14076 [2025-02-05 12:20:06,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 611 GetRequests, 608 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 12:20:06,780 INFO L435 NwaCegarLoop]: 1364 mSDtfsCounter, 1743 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 3871 mSolverCounterSat, 1728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1743 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 5599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1728 IncrementalHoareTripleChecker+Valid, 3871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:20:06,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1743 Valid, 1502 Invalid, 5599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1728 Valid, 3871 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-02-05 12:20:06,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14076 states. [2025-02-05 12:20:06,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14076 to 14076. [2025-02-05 12:20:06,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14076 states, 14075 states have (on average 1.2716873889875666) internal successors, (17899), 14075 states have internal predecessors, (17899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:06,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14076 states to 14076 states and 17899 transitions. [2025-02-05 12:20:06,942 INFO L78 Accepts]: Start accepts. Automaton has 14076 states and 17899 transitions. Word has length 609 [2025-02-05 12:20:06,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:20:06,942 INFO L471 AbstractCegarLoop]: Abstraction has 14076 states and 17899 transitions. [2025-02-05 12:20:06,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:06,943 INFO L276 IsEmpty]: Start isEmpty. Operand 14076 states and 17899 transitions. [2025-02-05 12:20:06,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 612 [2025-02-05 12:20:06,951 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:20:06,951 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:20:06,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 12:20:07,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:20:07,152 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:20:07,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:20:07,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1654055605, now seen corresponding path program 1 times [2025-02-05 12:20:07,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:20:07,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999059954] [2025-02-05 12:20:07,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:20:07,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:20:07,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 611 statements into 1 equivalence classes. [2025-02-05 12:20:07,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 611 of 611 statements. [2025-02-05 12:20:07,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:20:07,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:20:07,610 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-02-05 12:20:07,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:20:07,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999059954] [2025-02-05 12:20:07,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999059954] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:20:07,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:20:07,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:20:07,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36816037] [2025-02-05 12:20:07,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:20:07,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:20:07,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:20:07,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:20:07,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:20:07,613 INFO L87 Difference]: Start difference. First operand 14076 states and 17899 transitions. Second operand has 3 states, 3 states have (on average 182.0) internal successors, (546), 2 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:12,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:20:12,179 INFO L93 Difference]: Finished difference Result 36509 states and 47896 transitions. [2025-02-05 12:20:12,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:20:12,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 2 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 611 [2025-02-05 12:20:12,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:20:12,218 INFO L225 Difference]: With dead ends: 36509 [2025-02-05 12:20:12,218 INFO L226 Difference]: Without dead ends: 25165 [2025-02-05 12:20:12,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:20:12,230 INFO L435 NwaCegarLoop]: 697 mSDtfsCounter, 2111 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 5097 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2111 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 5531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:20:12,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2111 Valid, 967 Invalid, 5531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5097 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-02-05 12:20:12,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25165 states. [2025-02-05 12:20:12,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25165 to 23797. [2025-02-05 12:20:12,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23797 states, 23796 states have (on average 1.2691208606488484) internal successors, (30200), 23796 states have internal predecessors, (30200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:12,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23797 states to 23797 states and 30200 transitions. [2025-02-05 12:20:12,460 INFO L78 Accepts]: Start accepts. Automaton has 23797 states and 30200 transitions. Word has length 611 [2025-02-05 12:20:12,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:20:12,460 INFO L471 AbstractCegarLoop]: Abstraction has 23797 states and 30200 transitions. [2025-02-05 12:20:12,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 2 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:12,461 INFO L276 IsEmpty]: Start isEmpty. Operand 23797 states and 30200 transitions. [2025-02-05 12:20:12,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 695 [2025-02-05 12:20:12,465 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:20:12,465 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:20:12,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 12:20:12,466 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:20:12,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:20:12,467 INFO L85 PathProgramCache]: Analyzing trace with hash 179113797, now seen corresponding path program 1 times [2025-02-05 12:20:12,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:20:12,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581896038] [2025-02-05 12:20:12,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:20:12,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:20:12,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 694 statements into 1 equivalence classes. [2025-02-05 12:20:12,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 694 of 694 statements. [2025-02-05 12:20:12,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:20:12,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:20:12,760 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-02-05 12:20:12,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:20:12,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581896038] [2025-02-05 12:20:12,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581896038] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:20:12,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:20:12,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:20:12,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396957407] [2025-02-05 12:20:12,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:20:12,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:20:12,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:20:12,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:20:12,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:20:12,764 INFO L87 Difference]: Start difference. First operand 23797 states and 30200 transitions. Second operand has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 2 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:16,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:20:16,978 INFO L93 Difference]: Finished difference Result 50352 states and 65559 transitions. [2025-02-05 12:20:16,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:20:16,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 2 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 694 [2025-02-05 12:20:16,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:20:17,028 INFO L225 Difference]: With dead ends: 50352 [2025-02-05 12:20:17,028 INFO L226 Difference]: Without dead ends: 29287 [2025-02-05 12:20:17,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:20:17,049 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 1376 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 3925 mSolverCounterSat, 2127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 6052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2127 IncrementalHoareTripleChecker+Valid, 3925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-02-05 12:20:17,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 725 Invalid, 6052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2127 Valid, 3925 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-02-05 12:20:17,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29287 states. [2025-02-05 12:20:17,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29287 to 29272. [2025-02-05 12:20:17,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29272 states, 29271 states have (on average 1.2570462232243518) internal successors, (36795), 29271 states have internal predecessors, (36795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:17,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29272 states to 29272 states and 36795 transitions. [2025-02-05 12:20:17,333 INFO L78 Accepts]: Start accepts. Automaton has 29272 states and 36795 transitions. Word has length 694 [2025-02-05 12:20:17,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:20:17,334 INFO L471 AbstractCegarLoop]: Abstraction has 29272 states and 36795 transitions. [2025-02-05 12:20:17,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 2 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:17,334 INFO L276 IsEmpty]: Start isEmpty. Operand 29272 states and 36795 transitions. [2025-02-05 12:20:17,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 762 [2025-02-05 12:20:17,338 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:20:17,339 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:20:17,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 12:20:17,339 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:20:17,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:20:17,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1250630436, now seen corresponding path program 1 times [2025-02-05 12:20:17,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:20:17,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729399044] [2025-02-05 12:20:17,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:20:17,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:20:17,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 761 statements into 1 equivalence classes. [2025-02-05 12:20:17,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 761 of 761 statements. [2025-02-05 12:20:17,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:20:17,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:20:18,594 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 105 proven. 218 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:20:18,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:20:18,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729399044] [2025-02-05 12:20:18,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729399044] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:20:18,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688270154] [2025-02-05 12:20:18,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:20:18,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:20:18,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:20:18,596 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 12:20:18,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 12:20:18,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 761 statements into 1 equivalence classes. [2025-02-05 12:20:18,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 761 of 761 statements. [2025-02-05 12:20:18,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:20:18,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:20:18,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 12:20:18,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:20:18,835 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-02-05 12:20:18,835 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 12:20:18,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688270154] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:20:18,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 12:20:18,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-02-05 12:20:18,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359814311] [2025-02-05 12:20:18,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:20:18,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:20:18,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:20:18,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:20:18,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 12:20:18,837 INFO L87 Difference]: Start difference. First operand 29272 states and 36795 transitions. Second operand has 3 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:23,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:20:23,622 INFO L93 Difference]: Finished difference Result 81847 states and 104291 transitions. [2025-02-05 12:20:23,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:20:23,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 761 [2025-02-05 12:20:23,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:20:23,681 INFO L225 Difference]: With dead ends: 81847 [2025-02-05 12:20:23,682 INFO L226 Difference]: Without dead ends: 55307 [2025-02-05 12:20:23,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 766 GetRequests, 760 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 12:20:23,698 INFO L435 NwaCegarLoop]: 3188 mSDtfsCounter, 1416 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 5079 mSolverCounterSat, 983 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1416 SdHoareTripleChecker+Valid, 3359 SdHoareTripleChecker+Invalid, 6062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 983 IncrementalHoareTripleChecker+Valid, 5079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:20:23,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1416 Valid, 3359 Invalid, 6062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [983 Valid, 5079 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-02-05 12:20:23,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55307 states. [2025-02-05 12:20:24,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55307 to 53874. [2025-02-05 12:20:24,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53874 states, 53873 states have (on average 1.1928609878789003) internal successors, (64263), 53873 states have internal predecessors, (64263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:24,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53874 states to 53874 states and 64263 transitions. [2025-02-05 12:20:24,159 INFO L78 Accepts]: Start accepts. Automaton has 53874 states and 64263 transitions. Word has length 761 [2025-02-05 12:20:24,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:20:24,160 INFO L471 AbstractCegarLoop]: Abstraction has 53874 states and 64263 transitions. [2025-02-05 12:20:24,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:24,160 INFO L276 IsEmpty]: Start isEmpty. Operand 53874 states and 64263 transitions. [2025-02-05 12:20:24,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 907 [2025-02-05 12:20:24,167 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:20:24,167 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:20:24,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 12:20:24,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:20:24,368 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:20:24,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:20:24,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1709995373, now seen corresponding path program 1 times [2025-02-05 12:20:24,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:20:24,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199876435] [2025-02-05 12:20:24,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:20:24,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:20:24,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 906 statements into 1 equivalence classes. [2025-02-05 12:20:24,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 906 of 906 statements. [2025-02-05 12:20:24,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:20:24,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:20:24,733 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 521 proven. 0 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2025-02-05 12:20:24,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:20:24,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199876435] [2025-02-05 12:20:24,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199876435] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:20:24,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:20:24,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:20:24,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766117331] [2025-02-05 12:20:24,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:20:24,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:20:24,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:20:24,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:20:24,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:20:24,734 INFO L87 Difference]: Start difference. First operand 53874 states and 64263 transitions. Second operand has 4 states, 4 states have (on average 161.5) internal successors, (646), 4 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:32,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:20:32,629 INFO L93 Difference]: Finished difference Result 177540 states and 216084 transitions. [2025-02-05 12:20:32,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:20:32,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 161.5) internal successors, (646), 4 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 906 [2025-02-05 12:20:32,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:20:32,756 INFO L225 Difference]: With dead ends: 177540 [2025-02-05 12:20:32,756 INFO L226 Difference]: Without dead ends: 126398 [2025-02-05 12:20:32,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:20:32,786 INFO L435 NwaCegarLoop]: 932 mSDtfsCounter, 3375 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 8600 mSolverCounterSat, 3120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3375 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 11720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3120 IncrementalHoareTripleChecker+Valid, 8600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:20:32,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3375 Valid, 1189 Invalid, 11720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3120 Valid, 8600 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2025-02-05 12:20:32,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126398 states. [2025-02-05 12:20:33,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126398 to 124933. [2025-02-05 12:20:33,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124933 states, 124932 states have (on average 1.1720616015112222) internal successors, (146428), 124932 states have internal predecessors, (146428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:34,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124933 states to 124933 states and 146428 transitions. [2025-02-05 12:20:34,114 INFO L78 Accepts]: Start accepts. Automaton has 124933 states and 146428 transitions. Word has length 906 [2025-02-05 12:20:34,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:20:34,115 INFO L471 AbstractCegarLoop]: Abstraction has 124933 states and 146428 transitions. [2025-02-05 12:20:34,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 161.5) internal successors, (646), 4 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:34,116 INFO L276 IsEmpty]: Start isEmpty. Operand 124933 states and 146428 transitions. [2025-02-05 12:20:34,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 916 [2025-02-05 12:20:34,143 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:20:34,143 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:20:34,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 12:20:34,144 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:20:34,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:20:34,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1190450515, now seen corresponding path program 1 times [2025-02-05 12:20:34,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:20:34,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723958427] [2025-02-05 12:20:34,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:20:34,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:20:34,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 915 statements into 1 equivalence classes. [2025-02-05 12:20:34,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 915 of 915 statements. [2025-02-05 12:20:34,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:20:34,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:20:35,337 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 341 proven. 366 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-02-05 12:20:35,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:20:35,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723958427] [2025-02-05 12:20:35,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723958427] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:20:35,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120948445] [2025-02-05 12:20:35,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:20:35,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:20:35,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:20:35,340 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 12:20:35,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 12:20:35,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 915 statements into 1 equivalence classes. [2025-02-05 12:20:35,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 915 of 915 statements. [2025-02-05 12:20:35,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:20:35,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:20:35,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 1074 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 12:20:35,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:20:35,594 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-02-05 12:20:35,594 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 12:20:35,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120948445] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:20:35,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 12:20:35,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 12:20:35,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81159791] [2025-02-05 12:20:35,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:20:35,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:20:35,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:20:35,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:20:35,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 12:20:35,596 INFO L87 Difference]: Start difference. First operand 124933 states and 146428 transitions. Second operand has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:40,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:20:40,457 INFO L93 Difference]: Finished difference Result 305934 states and 364073 transitions. [2025-02-05 12:20:40,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:20:40,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 915 [2025-02-05 12:20:40,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:20:40,654 INFO L225 Difference]: With dead ends: 305934 [2025-02-05 12:20:40,654 INFO L226 Difference]: Without dead ends: 183733 [2025-02-05 12:20:40,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 920 GetRequests, 917 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-05 12:20:40,706 INFO L435 NwaCegarLoop]: 1399 mSDtfsCounter, 1527 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 4211 mSolverCounterSat, 1686 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1527 SdHoareTripleChecker+Valid, 1523 SdHoareTripleChecker+Invalid, 5897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1686 IncrementalHoareTripleChecker+Valid, 4211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:20:40,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1527 Valid, 1523 Invalid, 5897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1686 Valid, 4211 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-02-05 12:20:40,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183733 states. [2025-02-05 12:20:42,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183733 to 179540. [2025-02-05 12:20:42,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179540 states, 179539 states have (on average 1.175115156038521) internal successors, (210979), 179539 states have internal predecessors, (210979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:42,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179540 states to 179540 states and 210979 transitions. [2025-02-05 12:20:42,698 INFO L78 Accepts]: Start accepts. Automaton has 179540 states and 210979 transitions. Word has length 915 [2025-02-05 12:20:42,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:20:42,698 INFO L471 AbstractCegarLoop]: Abstraction has 179540 states and 210979 transitions. [2025-02-05 12:20:42,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:42,698 INFO L276 IsEmpty]: Start isEmpty. Operand 179540 states and 210979 transitions. [2025-02-05 12:20:42,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 965 [2025-02-05 12:20:42,706 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:20:42,706 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:20:42,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 12:20:42,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:20:42,906 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:20:42,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:20:42,907 INFO L85 PathProgramCache]: Analyzing trace with hash -954989465, now seen corresponding path program 1 times [2025-02-05 12:20:42,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:20:42,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421145446] [2025-02-05 12:20:42,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:20:42,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:20:43,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 964 statements into 1 equivalence classes. [2025-02-05 12:20:43,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 964 of 964 statements. [2025-02-05 12:20:43,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:20:43,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:20:43,592 INFO L134 CoverageAnalysis]: Checked inductivity of 932 backedges. 536 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-02-05 12:20:43,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:20:43,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421145446] [2025-02-05 12:20:43,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421145446] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:20:43,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:20:43,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:20:43,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284712359] [2025-02-05 12:20:43,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:20:43,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:20:43,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:20:43,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:20:43,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:20:43,595 INFO L87 Difference]: Start difference. First operand 179540 states and 210979 transitions. Second operand has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:48,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:20:48,407 INFO L93 Difference]: Finished difference Result 421880 states and 494305 transitions. [2025-02-05 12:20:48,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:20:48,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 964 [2025-02-05 12:20:48,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:20:48,702 INFO L225 Difference]: With dead ends: 421880 [2025-02-05 12:20:48,702 INFO L226 Difference]: Without dead ends: 245072 [2025-02-05 12:20:48,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:20:48,765 INFO L435 NwaCegarLoop]: 2961 mSDtfsCounter, 1420 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 3698 mSolverCounterSat, 1420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1420 SdHoareTripleChecker+Valid, 3139 SdHoareTripleChecker+Invalid, 5118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1420 IncrementalHoareTripleChecker+Valid, 3698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:20:48,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1420 Valid, 3139 Invalid, 5118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1420 Valid, 3698 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-02-05 12:20:48,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245072 states. [2025-02-05 12:20:50,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245072 to 235503. [2025-02-05 12:20:50,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235503 states, 235502 states have (on average 1.145310867848256) internal successors, (269723), 235502 states have internal predecessors, (269723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:51,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235503 states to 235503 states and 269723 transitions. [2025-02-05 12:20:51,283 INFO L78 Accepts]: Start accepts. Automaton has 235503 states and 269723 transitions. Word has length 964 [2025-02-05 12:20:51,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:20:51,284 INFO L471 AbstractCegarLoop]: Abstraction has 235503 states and 269723 transitions. [2025-02-05 12:20:51,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:20:51,284 INFO L276 IsEmpty]: Start isEmpty. Operand 235503 states and 269723 transitions. [2025-02-05 12:20:51,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1032 [2025-02-05 12:20:51,299 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:20:51,299 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:20:51,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 12:20:51,300 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:20:51,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:20:51,300 INFO L85 PathProgramCache]: Analyzing trace with hash 795562036, now seen corresponding path program 1 times [2025-02-05 12:20:51,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:20:51,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802432503] [2025-02-05 12:20:51,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:20:51,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:20:51,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1031 statements into 1 equivalence classes. [2025-02-05 12:20:51,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1031 of 1031 statements. [2025-02-05 12:20:51,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:20:51,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:20:51,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1244 backedges. 654 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-02-05 12:20:51,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:20:51,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802432503] [2025-02-05 12:20:51,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802432503] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:20:51,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:20:51,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:20:51,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113026796] [2025-02-05 12:20:51,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:20:51,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:20:51,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:20:51,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:20:51,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:20:51,981 INFO L87 Difference]: Start difference. First operand 235503 states and 269723 transitions. Second operand has 4 states, 4 states have (on average 166.5) internal successors, (666), 4 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)