./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/Problem18_label04.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 3c0864484c3fbf854768e10eb10840f6301266ef3080d1cd3d797df7c0e5ed88 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:16:26,515 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:16:26,565 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:16:26,568 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:16:26,569 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:16:26,582 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:16:26,583 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:16:26,583 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:16:26,583 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:16:26,583 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:16:26,584 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:16:26,584 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:16:26,584 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:16:26,584 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:16:26,584 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:16:26,584 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:16:26,584 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:16:26,584 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:16:26,584 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:16:26,585 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:16:26,585 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:16:26,585 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:16:26,585 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:16:26,585 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:16:26,585 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:16:26,585 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:16:26,585 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:16:26,585 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:16:26,585 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:16:26,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:16:26,586 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:16:26,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:16:26,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:16:26,586 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:16:26,586 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:16:26,586 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:16:26,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:16:26,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:16:26,586 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:16:26,586 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:16:26,586 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:16:26,587 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:16:26,587 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:16:26,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:16:26,587 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:16:26,587 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:16:26,587 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:16:26,587 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:16:26,587 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 -> 3c0864484c3fbf854768e10eb10840f6301266ef3080d1cd3d797df7c0e5ed88 [2025-01-09 00:16:26,758 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:16:26,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:16:26,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:16:26,765 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:16:26,766 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:16:26,766 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label04.c [2025-01-09 00:16:27,996 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/40d9f44a9/1a321211ce9d4801b7bc8b4ea32c3199/FLAGd5d8a3953 [2025-01-09 00:16:28,439 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:16:28,440 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label04.c [2025-01-09 00:16:28,465 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/40d9f44a9/1a321211ce9d4801b7bc8b4ea32c3199/FLAGd5d8a3953 [2025-01-09 00:16:28,573 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/40d9f44a9/1a321211ce9d4801b7bc8b4ea32c3199 [2025-01-09 00:16:28,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:16:28,577 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:16:28,578 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:16:28,579 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:16:28,582 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:16:28,583 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:16:28" (1/1) ... [2025-01-09 00:16:28,583 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2959b12a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:16:28, skipping insertion in model container [2025-01-09 00:16:28,583 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:16:28" (1/1) ... [2025-01-09 00:16:28,649 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:16:28,812 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/Problem18_label04.c[5507,5520] [2025-01-09 00:16:29,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:16:29,166 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:16:29,181 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/Problem18_label04.c[5507,5520] [2025-01-09 00:16:29,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:16:29,387 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:16:29,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:16:29 WrapperNode [2025-01-09 00:16:29,388 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:16:29,389 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:16:29,390 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:16:29,390 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:16:29,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:16:29" (1/1) ... [2025-01-09 00:16:29,433 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:16:29" (1/1) ... [2025-01-09 00:16:29,591 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132 [2025-01-09 00:16:29,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:16:29,592 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:16:29,592 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:16:29,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:16:29,599 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:16:29" (1/1) ... [2025-01-09 00:16:29,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:16:29" (1/1) ... [2025-01-09 00:16:29,617 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:16:29" (1/1) ... [2025-01-09 00:16:29,674 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-01-09 00:16:29,678 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:16:29" (1/1) ... [2025-01-09 00:16:29,679 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:16:29" (1/1) ... [2025-01-09 00:16:29,740 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:16:29" (1/1) ... [2025-01-09 00:16:29,751 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:16:29" (1/1) ... [2025-01-09 00:16:29,825 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:16:29" (1/1) ... [2025-01-09 00:16:29,837 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:16:29" (1/1) ... [2025-01-09 00:16:29,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:16:29" (1/1) ... [2025-01-09 00:16:29,872 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:16:29,873 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:16:29,873 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:16:29,873 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:16:29,874 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:16:29" (1/1) ... [2025-01-09 00:16:29,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:16:29,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:16:29,906 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-01-09 00:16:29,916 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-01-09 00:16:29,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:16:29,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:16:29,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:16:29,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:16:29,984 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:16:29,986 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:16:32,606 INFO L? ?]: Removed 639 outVars from TransFormulas that were not future-live. [2025-01-09 00:16:32,606 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:16:32,633 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:16:32,634 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:16:32,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:16:32 BoogieIcfgContainer [2025-01-09 00:16:32,634 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:16:32,636 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:16:32,636 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:16:32,639 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:16:32,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:16:28" (1/3) ... [2025-01-09 00:16:32,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b7c9f64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:16:32, skipping insertion in model container [2025-01-09 00:16:32,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:16:29" (2/3) ... [2025-01-09 00:16:32,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b7c9f64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:16:32, skipping insertion in model container [2025-01-09 00:16:32,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:16:32" (3/3) ... [2025-01-09 00:16:32,641 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem18_label04.c [2025-01-09 00:16:32,659 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:16:32,663 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem18_label04.c that has 1 procedures, 757 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:16:32,761 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:16:32,778 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;@403c6423, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:16:32,781 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:16:32,786 INFO L276 IsEmpty]: Start isEmpty. Operand has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 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-01-09 00:16:32,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 00:16:32,798 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:32,799 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] [2025-01-09 00:16:32,803 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:32,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:32,810 INFO L85 PathProgramCache]: Analyzing trace with hash -238033406, now seen corresponding path program 1 times [2025-01-09 00:16:32,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:32,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94065312] [2025-01-09 00:16:32,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:32,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:32,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 00:16:32,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 00:16:32,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:32,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:33,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:16:33,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:33,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94065312] [2025-01-09 00:16:33,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94065312] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:33,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:33,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:33,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981725678] [2025-01-09 00:16:33,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:33,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:16:33,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:33,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:16:33,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:16:33,179 INFO L87 Difference]: Start difference. First operand has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 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.0) internal successors, (52), 3 states have internal predecessors, (52), 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-01-09 00:16:37,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:37,929 INFO L93 Difference]: Finished difference Result 2900 states and 5644 transitions. [2025-01-09 00:16:37,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:16:37,931 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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 52 [2025-01-09 00:16:37,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:37,946 INFO L225 Difference]: With dead ends: 2900 [2025-01-09 00:16:37,946 INFO L226 Difference]: Without dead ends: 2074 [2025-01-09 00:16:37,954 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-01-09 00:16:37,956 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 2002 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 5262 mSolverCounterSat, 1069 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2002 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 6331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1069 IncrementalHoareTripleChecker+Valid, 5262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:37,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2002 Valid, 712 Invalid, 6331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1069 Valid, 5262 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-01-09 00:16:37,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2025-01-09 00:16:38,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 2074. [2025-01-09 00:16:38,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2074 states, 2073 states have (on average 1.5533043897732755) internal successors, (3220), 2073 states have internal predecessors, (3220), 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-01-09 00:16:38,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 3220 transitions. [2025-01-09 00:16:38,051 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 3220 transitions. Word has length 52 [2025-01-09 00:16:38,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:38,052 INFO L471 AbstractCegarLoop]: Abstraction has 2074 states and 3220 transitions. [2025-01-09 00:16:38,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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-01-09 00:16:38,052 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 3220 transitions. [2025-01-09 00:16:38,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 00:16:38,055 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:38,055 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:16:38,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:16:38,056 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:38,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:38,056 INFO L85 PathProgramCache]: Analyzing trace with hash 991374375, now seen corresponding path program 1 times [2025-01-09 00:16:38,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:38,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903576300] [2025-01-09 00:16:38,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:38,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:38,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 00:16:38,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 00:16:38,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:38,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:38,488 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:16:38,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:38,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903576300] [2025-01-09 00:16:38,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903576300] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:38,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:38,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:38,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322645725] [2025-01-09 00:16:38,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:38,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:16:38,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:38,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:16:38,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:16:38,493 INFO L87 Difference]: Start difference. First operand 2074 states and 3220 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 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-01-09 00:16:42,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:42,684 INFO L93 Difference]: Finished difference Result 6906 states and 10855 transitions. [2025-01-09 00:16:42,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:16:42,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 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 145 [2025-01-09 00:16:42,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:42,697 INFO L225 Difference]: With dead ends: 6906 [2025-01-09 00:16:42,697 INFO L226 Difference]: Without dead ends: 4834 [2025-01-09 00:16:42,699 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-01-09 00:16:42,700 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 1923 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4378 mSolverCounterSat, 622 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1923 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 5000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 622 IncrementalHoareTripleChecker+Valid, 4378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:42,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1923 Valid, 647 Invalid, 5000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [622 Valid, 4378 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 00:16:42,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4834 states. [2025-01-09 00:16:42,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4834 to 4144. [2025-01-09 00:16:42,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4144 states, 4143 states have (on average 1.3376780111030655) internal successors, (5542), 4143 states have internal predecessors, (5542), 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-01-09 00:16:42,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 5542 transitions. [2025-01-09 00:16:42,772 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 5542 transitions. Word has length 145 [2025-01-09 00:16:42,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:42,774 INFO L471 AbstractCegarLoop]: Abstraction has 4144 states and 5542 transitions. [2025-01-09 00:16:42,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 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-01-09 00:16:42,774 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 5542 transitions. [2025-01-09 00:16:42,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-01-09 00:16:42,778 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:42,778 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:16:42,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:16:42,779 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:42,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:42,779 INFO L85 PathProgramCache]: Analyzing trace with hash -974378615, now seen corresponding path program 1 times [2025-01-09 00:16:42,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:42,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380533577] [2025-01-09 00:16:42,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:42,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:42,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 00:16:42,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 00:16:42,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:42,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:43,022 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-01-09 00:16:43,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:43,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380533577] [2025-01-09 00:16:43,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380533577] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:43,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:43,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:16:43,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630199825] [2025-01-09 00:16:43,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:43,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:43,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:43,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:43,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:43,025 INFO L87 Difference]: Start difference. First operand 4144 states and 5542 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 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-01-09 00:16:45,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:45,112 INFO L93 Difference]: Finished difference Result 9666 states and 13597 transitions. [2025-01-09 00:16:45,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:45,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 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 234 [2025-01-09 00:16:45,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:45,129 INFO L225 Difference]: With dead ends: 9666 [2025-01-09 00:16:45,129 INFO L226 Difference]: Without dead ends: 5524 [2025-01-09 00:16:45,133 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-01-09 00:16:45,133 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 590 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 673 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 673 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:45,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 435 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [673 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 00:16:45,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5524 states. [2025-01-09 00:16:45,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5524 to 5524. [2025-01-09 00:16:45,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5524 states, 5523 states have (on average 1.320659062103929) internal successors, (7294), 5523 states have internal predecessors, (7294), 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-01-09 00:16:45,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5524 states to 5524 states and 7294 transitions. [2025-01-09 00:16:45,226 INFO L78 Accepts]: Start accepts. Automaton has 5524 states and 7294 transitions. Word has length 234 [2025-01-09 00:16:45,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:45,227 INFO L471 AbstractCegarLoop]: Abstraction has 5524 states and 7294 transitions. [2025-01-09 00:16:45,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 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-01-09 00:16:45,228 INFO L276 IsEmpty]: Start isEmpty. Operand 5524 states and 7294 transitions. [2025-01-09 00:16:45,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-01-09 00:16:45,230 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:45,230 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, 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] [2025-01-09 00:16:45,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:16:45,230 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:45,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:45,233 INFO L85 PathProgramCache]: Analyzing trace with hash -425526852, now seen corresponding path program 1 times [2025-01-09 00:16:45,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:45,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037520877] [2025-01-09 00:16:45,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:45,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:45,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-01-09 00:16:45,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-01-09 00:16:45,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:45,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:45,641 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:16:45,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:45,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037520877] [2025-01-09 00:16:45,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037520877] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:45,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:45,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:45,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095484343] [2025-01-09 00:16:45,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:45,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:16:45,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:45,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:16:45,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:16:45,643 INFO L87 Difference]: Start difference. First operand 5524 states and 7294 transitions. Second operand has 4 states, 4 states have (on average 75.75) internal successors, (303), 3 states have internal predecessors, (303), 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-01-09 00:16:47,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:47,597 INFO L93 Difference]: Finished difference Result 13169 states and 17027 transitions. [2025-01-09 00:16:47,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:16:47,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.75) internal successors, (303), 3 states have internal predecessors, (303), 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 303 [2025-01-09 00:16:47,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:47,613 INFO L225 Difference]: With dead ends: 13169 [2025-01-09 00:16:47,613 INFO L226 Difference]: Without dead ends: 7594 [2025-01-09 00:16:47,617 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-01-09 00:16:47,618 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 529 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2590 mSolverCounterSat, 549 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 3139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 549 IncrementalHoareTripleChecker+Valid, 2590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:47,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 636 Invalid, 3139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [549 Valid, 2590 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:16:47,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7594 states. [2025-01-09 00:16:47,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7594 to 6904. [2025-01-09 00:16:47,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6904 states, 6903 states have (on average 1.206431986093003) internal successors, (8328), 6903 states have internal predecessors, (8328), 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-01-09 00:16:47,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6904 states to 6904 states and 8328 transitions. [2025-01-09 00:16:47,694 INFO L78 Accepts]: Start accepts. Automaton has 6904 states and 8328 transitions. Word has length 303 [2025-01-09 00:16:47,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:47,694 INFO L471 AbstractCegarLoop]: Abstraction has 6904 states and 8328 transitions. [2025-01-09 00:16:47,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.75) internal successors, (303), 3 states have internal predecessors, (303), 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-01-09 00:16:47,695 INFO L276 IsEmpty]: Start isEmpty. Operand 6904 states and 8328 transitions. [2025-01-09 00:16:47,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 933 [2025-01-09 00:16:47,710 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:47,711 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:16:47,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:16:47,711 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:47,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:47,712 INFO L85 PathProgramCache]: Analyzing trace with hash -841574333, now seen corresponding path program 1 times [2025-01-09 00:16:47,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:47,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77321134] [2025-01-09 00:16:47,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:47,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:47,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 932 statements into 1 equivalence classes. [2025-01-09 00:16:47,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 932 of 932 statements. [2025-01-09 00:16:47,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:47,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:48,382 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-01-09 00:16:48,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:48,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77321134] [2025-01-09 00:16:48,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77321134] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:48,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:48,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:48,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436448869] [2025-01-09 00:16:48,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:48,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:48,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:48,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:48,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:48,384 INFO L87 Difference]: Start difference. First operand 6904 states and 8328 transitions. Second operand has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 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-01-09 00:16:50,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:50,596 INFO L93 Difference]: Finished difference Result 17946 states and 22074 transitions. [2025-01-09 00:16:50,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:50,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 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 932 [2025-01-09 00:16:50,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:50,619 INFO L225 Difference]: With dead ends: 17946 [2025-01-09 00:16:50,619 INFO L226 Difference]: Without dead ends: 11044 [2025-01-09 00:16:50,623 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-01-09 00:16:50,623 INFO L435 NwaCegarLoop]: 771 mSDtfsCounter, 639 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1998 mSolverCounterSat, 429 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 2427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 429 IncrementalHoareTripleChecker+Valid, 1998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:50,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 778 Invalid, 2427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [429 Valid, 1998 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 00:16:50,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11044 states. [2025-01-09 00:16:50,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11044 to 11044. [2025-01-09 00:16:50,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11044 states, 11043 states have (on average 1.2234899936611427) internal successors, (13511), 11043 states have internal predecessors, (13511), 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-01-09 00:16:50,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11044 states to 11044 states and 13511 transitions. [2025-01-09 00:16:50,736 INFO L78 Accepts]: Start accepts. Automaton has 11044 states and 13511 transitions. Word has length 932 [2025-01-09 00:16:50,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:50,737 INFO L471 AbstractCegarLoop]: Abstraction has 11044 states and 13511 transitions. [2025-01-09 00:16:50,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 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-01-09 00:16:50,738 INFO L276 IsEmpty]: Start isEmpty. Operand 11044 states and 13511 transitions. [2025-01-09 00:16:50,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 940 [2025-01-09 00:16:50,755 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:50,755 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:16:50,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:16:50,756 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:50,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:50,757 INFO L85 PathProgramCache]: Analyzing trace with hash -200823679, now seen corresponding path program 1 times [2025-01-09 00:16:50,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:50,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512980873] [2025-01-09 00:16:50,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:50,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:50,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 939 statements into 1 equivalence classes. [2025-01-09 00:16:50,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 939 of 939 statements. [2025-01-09 00:16:50,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:50,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:51,790 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 149 proven. 82 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2025-01-09 00:16:51,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:51,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512980873] [2025-01-09 00:16:51,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512980873] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:16:51,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523368876] [2025-01-09 00:16:51,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:51,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:16:51,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:16:51,798 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-01-09 00:16:51,799 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-01-09 00:16:51,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 939 statements into 1 equivalence classes. [2025-01-09 00:16:52,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 939 of 939 statements. [2025-01-09 00:16:52,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:52,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:52,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 1078 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:16:52,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:16:52,194 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2025-01-09 00:16:52,194 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:16:52,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523368876] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:52,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:16:52,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-09 00:16:52,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659547370] [2025-01-09 00:16:52,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:52,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:52,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:52,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:52,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:16:52,197 INFO L87 Difference]: Start difference. First operand 11044 states and 13511 transitions. Second operand has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 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-01-09 00:16:54,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:54,069 INFO L93 Difference]: Finished difference Result 24846 states and 31289 transitions. [2025-01-09 00:16:54,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:54,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 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 939 [2025-01-09 00:16:54,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:54,094 INFO L225 Difference]: With dead ends: 24846 [2025-01-09 00:16:54,095 INFO L226 Difference]: Without dead ends: 13804 [2025-01-09 00:16:54,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 941 GetRequests, 938 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-01-09 00:16:54,104 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 651 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1933 mSolverCounterSat, 406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 2339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 406 IncrementalHoareTripleChecker+Valid, 1933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:54,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 449 Invalid, 2339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [406 Valid, 1933 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:16:54,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13804 states. [2025-01-09 00:16:54,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13804 to 11044. [2025-01-09 00:16:54,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11044 states, 11043 states have (on average 1.2234899936611427) internal successors, (13511), 11043 states have internal predecessors, (13511), 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-01-09 00:16:54,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11044 states to 11044 states and 13511 transitions. [2025-01-09 00:16:54,216 INFO L78 Accepts]: Start accepts. Automaton has 11044 states and 13511 transitions. Word has length 939 [2025-01-09 00:16:54,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:54,217 INFO L471 AbstractCegarLoop]: Abstraction has 11044 states and 13511 transitions. [2025-01-09 00:16:54,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 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-01-09 00:16:54,218 INFO L276 IsEmpty]: Start isEmpty. Operand 11044 states and 13511 transitions. [2025-01-09 00:16:54,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 940 [2025-01-09 00:16:54,226 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:54,227 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:16:54,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 00:16:54,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:16:54,428 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:54,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:54,428 INFO L85 PathProgramCache]: Analyzing trace with hash 606128647, now seen corresponding path program 1 times [2025-01-09 00:16:54,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:54,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283001730] [2025-01-09 00:16:54,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:54,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:54,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 939 statements into 1 equivalence classes. [2025-01-09 00:16:54,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 939 of 939 statements. [2025-01-09 00:16:54,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:54,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:55,016 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2025-01-09 00:16:55,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:55,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283001730] [2025-01-09 00:16:55,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283001730] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:55,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:55,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:16:55,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760814540] [2025-01-09 00:16:55,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:55,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:55,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:55,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:55,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:55,019 INFO L87 Difference]: Start difference. First operand 11044 states and 13511 transitions. Second operand has 3 states, 3 states have (on average 190.0) internal successors, (570), 2 states have internal predecessors, (570), 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-01-09 00:16:56,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:56,793 INFO L93 Difference]: Finished difference Result 28296 states and 35480 transitions. [2025-01-09 00:16:56,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:56,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 2 states have internal predecessors, (570), 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 939 [2025-01-09 00:16:56,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:56,875 INFO L225 Difference]: With dead ends: 28296 [2025-01-09 00:16:56,876 INFO L226 Difference]: Without dead ends: 17254 [2025-01-09 00:16:56,880 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-01-09 00:16:56,880 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 227 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 2269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 1667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:56,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 388 Invalid, 2269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [602 Valid, 1667 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:16:56,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17254 states. [2025-01-09 00:16:56,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17254 to 14494. [2025-01-09 00:16:56,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14494 states, 14493 states have (on average 1.188573794245498) internal successors, (17226), 14493 states have internal predecessors, (17226), 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-01-09 00:16:56,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14494 states to 14494 states and 17226 transitions. [2025-01-09 00:16:56,987 INFO L78 Accepts]: Start accepts. Automaton has 14494 states and 17226 transitions. Word has length 939 [2025-01-09 00:16:56,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:56,987 INFO L471 AbstractCegarLoop]: Abstraction has 14494 states and 17226 transitions. [2025-01-09 00:16:56,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 2 states have internal predecessors, (570), 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-01-09 00:16:56,988 INFO L276 IsEmpty]: Start isEmpty. Operand 14494 states and 17226 transitions. [2025-01-09 00:16:56,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 960 [2025-01-09 00:16:56,993 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:56,993 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:16:56,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:16:56,994 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:56,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:56,994 INFO L85 PathProgramCache]: Analyzing trace with hash 686700687, now seen corresponding path program 1 times [2025-01-09 00:16:56,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:56,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96463130] [2025-01-09 00:16:56,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:56,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:57,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 959 statements into 1 equivalence classes. [2025-01-09 00:16:57,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 959 of 959 statements. [2025-01-09 00:16:57,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:57,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:57,651 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 335 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-01-09 00:16:57,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:57,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96463130] [2025-01-09 00:16:57,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96463130] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:57,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:57,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:57,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300944286] [2025-01-09 00:16:57,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:57,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:57,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:57,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:57,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:57,654 INFO L87 Difference]: Start difference. First operand 14494 states and 17226 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-01-09 00:16:59,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:59,608 INFO L93 Difference]: Finished difference Result 34506 states and 41110 transitions. [2025-01-09 00:16:59,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:59,609 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 959 [2025-01-09 00:16:59,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:59,637 INFO L225 Difference]: With dead ends: 34506 [2025-01-09 00:16:59,637 INFO L226 Difference]: Without dead ends: 20014 [2025-01-09 00:16:59,651 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-01-09 00:16:59,652 INFO L435 NwaCegarLoop]: 1108 mSDtfsCounter, 598 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2069 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 2324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 2069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:59,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 1115 Invalid, 2324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 2069 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:16:59,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20014 states. [2025-01-09 00:16:59,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20014 to 19324. [2025-01-09 00:16:59,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19324 states, 19323 states have (on average 1.1694353878797288) internal successors, (22597), 19323 states have internal predecessors, (22597), 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-01-09 00:16:59,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19324 states to 19324 states and 22597 transitions. [2025-01-09 00:16:59,872 INFO L78 Accepts]: Start accepts. Automaton has 19324 states and 22597 transitions. Word has length 959 [2025-01-09 00:16:59,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:59,874 INFO L471 AbstractCegarLoop]: Abstraction has 19324 states and 22597 transitions. [2025-01-09 00:16:59,874 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-01-09 00:16:59,874 INFO L276 IsEmpty]: Start isEmpty. Operand 19324 states and 22597 transitions. [2025-01-09 00:16:59,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 965 [2025-01-09 00:16:59,885 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:59,886 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:16:59,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:16:59,886 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:59,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:59,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1189318643, now seen corresponding path program 1 times [2025-01-09 00:16:59,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:59,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663473990] [2025-01-09 00:16:59,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:59,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:59,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 964 statements into 1 equivalence classes. [2025-01-09 00:16:59,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 964 of 964 statements. [2025-01-09 00:16:59,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:59,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:17:00,377 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2025-01-09 00:17:00,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:17:00,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663473990] [2025-01-09 00:17:00,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663473990] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:17:00,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:17:00,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:17:00,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654741868] [2025-01-09 00:17:00,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:17:00,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:17:00,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:17:00,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:17:00,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:17:00,379 INFO L87 Difference]: Start difference. First operand 19324 states and 22597 transitions. Second operand has 3 states, 3 states have (on average 190.0) internal successors, (570), 2 states have internal predecessors, (570), 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-01-09 00:17:02,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:17:02,159 INFO L93 Difference]: Finished difference Result 45546 states and 53320 transitions. [2025-01-09 00:17:02,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:17:02,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 2 states have internal predecessors, (570), 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-01-09 00:17:02,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:17:02,221 INFO L225 Difference]: With dead ends: 45546 [2025-01-09 00:17:02,221 INFO L226 Difference]: Without dead ends: 26224 [2025-01-09 00:17:02,249 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-01-09 00:17:02,251 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 249 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 688 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 2479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 688 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:17:02,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 77 Invalid, 2479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [688 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:17:02,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26224 states. [2025-01-09 00:17:02,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26224 to 26224. [2025-01-09 00:17:02,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26224 states, 26223 states have (on average 1.1497540327193685) internal successors, (30150), 26223 states have internal predecessors, (30150), 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-01-09 00:17:02,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26224 states to 26224 states and 30150 transitions. [2025-01-09 00:17:02,693 INFO L78 Accepts]: Start accepts. Automaton has 26224 states and 30150 transitions. Word has length 964 [2025-01-09 00:17:02,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:17:02,693 INFO L471 AbstractCegarLoop]: Abstraction has 26224 states and 30150 transitions. [2025-01-09 00:17:02,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 2 states have internal predecessors, (570), 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-01-09 00:17:02,694 INFO L276 IsEmpty]: Start isEmpty. Operand 26224 states and 30150 transitions. [2025-01-09 00:17:02,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 967 [2025-01-09 00:17:02,702 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:17:02,703 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:17:02,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:17:02,704 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:17:02,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:17:02,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1764291509, now seen corresponding path program 1 times [2025-01-09 00:17:02,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:17:02,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466656474] [2025-01-09 00:17:02,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:17:02,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:17:02,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 966 statements into 1 equivalence classes. [2025-01-09 00:17:02,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 966 of 966 statements. [2025-01-09 00:17:02,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:17:02,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:17:03,692 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 335 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2025-01-09 00:17:03,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:17:03,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466656474] [2025-01-09 00:17:03,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466656474] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:17:03,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:17:03,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:17:03,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114812189] [2025-01-09 00:17:03,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:17:03,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:17:03,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:17:03,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:17:03,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:17:03,694 INFO L87 Difference]: Start difference. First operand 26224 states and 30150 transitions. Second operand has 4 states, 4 states have (on average 165.75) 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-01-09 00:17:06,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:17:06,615 INFO L93 Difference]: Finished difference Result 55896 states and 64653 transitions. [2025-01-09 00:17:06,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:17:06,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 165.75) 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 966 [2025-01-09 00:17:06,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:17:06,650 INFO L225 Difference]: With dead ends: 55896 [2025-01-09 00:17:06,651 INFO L226 Difference]: Without dead ends: 29674 [2025-01-09 00:17:06,668 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-01-09 00:17:06,668 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 1028 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 3050 mSolverCounterSat, 967 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 4017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 967 IncrementalHoareTripleChecker+Valid, 3050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:17:06,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1028 Valid, 100 Invalid, 4017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [967 Valid, 3050 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-09 00:17:06,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29674 states. [2025-01-09 00:17:06,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29674 to 28984. [2025-01-09 00:17:06,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28984 states, 28983 states have (on average 1.1450850498568126) internal successors, (33188), 28983 states have internal predecessors, (33188), 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-01-09 00:17:06,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28984 states to 28984 states and 33188 transitions. [2025-01-09 00:17:06,897 INFO L78 Accepts]: Start accepts. Automaton has 28984 states and 33188 transitions. Word has length 966 [2025-01-09 00:17:06,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:17:06,898 INFO L471 AbstractCegarLoop]: Abstraction has 28984 states and 33188 transitions. [2025-01-09 00:17:06,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 165.75) 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-01-09 00:17:06,898 INFO L276 IsEmpty]: Start isEmpty. Operand 28984 states and 33188 transitions. [2025-01-09 00:17:06,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 981 [2025-01-09 00:17:06,904 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:17:06,905 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, 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, 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, 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] [2025-01-09 00:17:06,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:17:06,905 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:17:06,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:17:06,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1766093877, now seen corresponding path program 1 times [2025-01-09 00:17:06,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:17:06,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880268697] [2025-01-09 00:17:06,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:17:06,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:17:06,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 980 statements into 1 equivalence classes. [2025-01-09 00:17:06,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 980 of 980 statements. [2025-01-09 00:17:06,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:17:06,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:17:07,531 INFO L134 CoverageAnalysis]: Checked inductivity of 674 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-01-09 00:17:07,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:17:07,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880268697] [2025-01-09 00:17:07,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880268697] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:17:07,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:17:07,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:17:07,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327373540] [2025-01-09 00:17:07,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:17:07,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:17:07,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:17:07,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:17:07,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:17:07,535 INFO L87 Difference]: Start difference. First operand 28984 states and 33188 transitions. Second operand has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 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-01-09 00:17:09,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:17:09,654 INFO L93 Difference]: Finished difference Result 70386 states and 81394 transitions. [2025-01-09 00:17:09,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:17:09,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 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 980 [2025-01-09 00:17:09,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:17:09,697 INFO L225 Difference]: With dead ends: 70386 [2025-01-09 00:17:09,697 INFO L226 Difference]: Without dead ends: 41404 [2025-01-09 00:17:09,722 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-01-09 00:17:09,722 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 657 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1898 mSolverCounterSat, 458 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 2356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 458 IncrementalHoareTripleChecker+Valid, 1898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:17:09,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 253 Invalid, 2356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [458 Valid, 1898 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:17:09,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41404 states. [2025-01-09 00:17:09,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41404 to 41404. [2025-01-09 00:17:09,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41404 states, 41403 states have (on average 1.138081781513417) internal successors, (47120), 41403 states have internal predecessors, (47120), 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-01-09 00:17:10,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41404 states to 41404 states and 47120 transitions. [2025-01-09 00:17:10,033 INFO L78 Accepts]: Start accepts. Automaton has 41404 states and 47120 transitions. Word has length 980 [2025-01-09 00:17:10,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:17:10,034 INFO L471 AbstractCegarLoop]: Abstraction has 41404 states and 47120 transitions. [2025-01-09 00:17:10,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 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-01-09 00:17:10,035 INFO L276 IsEmpty]: Start isEmpty. Operand 41404 states and 47120 transitions. [2025-01-09 00:17:10,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1099 [2025-01-09 00:17:10,042 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:17:10,042 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:17:10,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:17:10,042 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:17:10,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:17:10,043 INFO L85 PathProgramCache]: Analyzing trace with hash -697978131, now seen corresponding path program 1 times [2025-01-09 00:17:10,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:17:10,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768313717] [2025-01-09 00:17:10,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:17:10,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:17:10,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1098 statements into 1 equivalence classes. [2025-01-09 00:17:10,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1098 of 1098 statements. [2025-01-09 00:17:10,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:17:10,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:17:11,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 521 proven. 531 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:17:11,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:17:11,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768313717] [2025-01-09 00:17:11,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768313717] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:17:11,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623325161] [2025-01-09 00:17:11,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:17:11,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:17:11,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:17:11,542 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-01-09 00:17:11,544 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-01-09 00:17:11,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1098 statements into 1 equivalence classes. [2025-01-09 00:17:11,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1098 of 1098 statements. [2025-01-09 00:17:11,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:17:11,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:17:11,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 1256 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:17:11,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:17:12,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-01-09 00:17:12,909 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:17:12,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623325161] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:17:12,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:17:12,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2025-01-09 00:17:12,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782707937] [2025-01-09 00:17:12,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:17:12,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:17:12,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:17:12,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:17:12,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-09 00:17:12,913 INFO L87 Difference]: Start difference. First operand 41404 states and 47120 transitions. Second operand has 4 states, 4 states have (on average 165.75) 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-01-09 00:17:15,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:17:15,989 INFO L93 Difference]: Finished difference Result 92466 states and 105514 transitions. [2025-01-09 00:17:15,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:17:15,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 165.75) 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 1098 [2025-01-09 00:17:15,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:17:16,045 INFO L225 Difference]: With dead ends: 92466 [2025-01-09 00:17:16,045 INFO L226 Difference]: Without dead ends: 51064 [2025-01-09 00:17:16,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1105 GetRequests, 1096 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-09 00:17:16,068 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 1062 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2807 mSolverCounterSat, 1317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 4124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1317 IncrementalHoareTripleChecker+Valid, 2807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:17:16,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 105 Invalid, 4124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1317 Valid, 2807 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-09 00:17:16,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51064 states. [2025-01-09 00:17:16,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51064 to 49684. [2025-01-09 00:17:16,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49684 states, 49683 states have (on average 1.1371092727894854) internal successors, (56495), 49683 states have internal predecessors, (56495), 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-01-09 00:17:16,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49684 states to 49684 states and 56495 transitions. [2025-01-09 00:17:16,490 INFO L78 Accepts]: Start accepts. Automaton has 49684 states and 56495 transitions. Word has length 1098 [2025-01-09 00:17:16,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:17:16,490 INFO L471 AbstractCegarLoop]: Abstraction has 49684 states and 56495 transitions. [2025-01-09 00:17:16,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 165.75) 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-01-09 00:17:16,491 INFO L276 IsEmpty]: Start isEmpty. Operand 49684 states and 56495 transitions. [2025-01-09 00:17:16,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1185 [2025-01-09 00:17:16,499 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:17:16,499 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:17:16,506 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-01-09 00:17:16,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:17:16,700 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:17:16,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:17:16,701 INFO L85 PathProgramCache]: Analyzing trace with hash 365776214, now seen corresponding path program 1 times [2025-01-09 00:17:16,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:17:16,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993257072] [2025-01-09 00:17:16,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:17:16,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:17:16,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1184 statements into 1 equivalence classes. [2025-01-09 00:17:16,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1184 of 1184 statements. [2025-01-09 00:17:16,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:17:16,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:17:18,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 870 proven. 0 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-01-09 00:17:18,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:17:18,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993257072] [2025-01-09 00:17:18,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993257072] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:17:18,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:17:18,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 00:17:18,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532072784] [2025-01-09 00:17:18,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:17:18,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:17:18,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:17:18,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:17:18,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:17:18,186 INFO L87 Difference]: Start difference. First operand 49684 states and 56495 transitions. Second operand has 5 states, 5 states have (on average 149.8) internal successors, (749), 5 states have internal predecessors, (749), 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-01-09 00:17:21,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:17:21,929 INFO L93 Difference]: Finished difference Result 135938 states and 154818 transitions. [2025-01-09 00:17:21,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 00:17:21,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 149.8) internal successors, (749), 5 states have internal predecessors, (749), 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 1184 [2025-01-09 00:17:21,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:17:22,021 INFO L225 Difference]: With dead ends: 135938 [2025-01-09 00:17:22,022 INFO L226 Difference]: Without dead ends: 86256 [2025-01-09 00:17:22,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-01-09 00:17:22,062 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 2039 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 4879 mSolverCounterSat, 781 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2039 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 5660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 781 IncrementalHoareTripleChecker+Valid, 4879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:17:22,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2039 Valid, 252 Invalid, 5660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [781 Valid, 4879 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-01-09 00:17:22,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86256 states. [2025-01-09 00:17:22,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86256 to 74524. [2025-01-09 00:17:22,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74524 states, 74523 states have (on average 1.1415267769681843) internal successors, (85070), 74523 states have internal predecessors, (85070), 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-01-09 00:17:22,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74524 states to 74524 states and 85070 transitions. [2025-01-09 00:17:22,764 INFO L78 Accepts]: Start accepts. Automaton has 74524 states and 85070 transitions. Word has length 1184 [2025-01-09 00:17:22,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:17:22,765 INFO L471 AbstractCegarLoop]: Abstraction has 74524 states and 85070 transitions. [2025-01-09 00:17:22,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 149.8) internal successors, (749), 5 states have internal predecessors, (749), 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-01-09 00:17:22,765 INFO L276 IsEmpty]: Start isEmpty. Operand 74524 states and 85070 transitions. [2025-01-09 00:17:22,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1192 [2025-01-09 00:17:22,875 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:17:22,875 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:17:22,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 00:17:22,875 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:17:22,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:17:22,876 INFO L85 PathProgramCache]: Analyzing trace with hash 159429575, now seen corresponding path program 1 times [2025-01-09 00:17:22,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:17:22,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985140706] [2025-01-09 00:17:22,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:17:22,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:17:22,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1191 statements into 1 equivalence classes. [2025-01-09 00:17:22,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1191 of 1191 statements. [2025-01-09 00:17:22,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:17:22,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:17:23,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 662 proven. 0 refuted. 0 times theorem prover too weak. 790 trivial. 0 not checked. [2025-01-09 00:17:23,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:17:23,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985140706] [2025-01-09 00:17:23,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985140706] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:17:23,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:17:23,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:17:23,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465968665] [2025-01-09 00:17:23,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:17:23,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:17:23,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:17:23,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:17:23,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:17:23,376 INFO L87 Difference]: Start difference. First operand 74524 states and 85070 transitions. Second operand has 4 states, 4 states have (on average 171.25) internal successors, (685), 4 states have internal predecessors, (685), 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-01-09 00:17:26,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:17:26,744 INFO L93 Difference]: Finished difference Result 175956 states and 201129 transitions. [2025-01-09 00:17:26,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:17:26,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 171.25) internal successors, (685), 4 states have internal predecessors, (685), 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 1191 [2025-01-09 00:17:26,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:17:26,889 INFO L225 Difference]: With dead ends: 175956 [2025-01-09 00:17:26,889 INFO L226 Difference]: Without dead ends: 101434 [2025-01-09 00:17:26,940 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-01-09 00:17:26,941 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 1384 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 4108 mSolverCounterSat, 720 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1384 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 4828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 720 IncrementalHoareTripleChecker+Valid, 4108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:17:26,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1384 Valid, 239 Invalid, 4828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [720 Valid, 4108 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-09 00:17:27,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101434 states. [2025-01-09 00:17:27,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101434 to 85564. [2025-01-09 00:17:27,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85564 states, 85563 states have (on average 1.1498311185909798) internal successors, (98383), 85563 states have internal predecessors, (98383), 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-01-09 00:17:28,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85564 states to 85564 states and 98383 transitions. [2025-01-09 00:17:28,060 INFO L78 Accepts]: Start accepts. Automaton has 85564 states and 98383 transitions. Word has length 1191 [2025-01-09 00:17:28,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:17:28,063 INFO L471 AbstractCegarLoop]: Abstraction has 85564 states and 98383 transitions. [2025-01-09 00:17:28,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 171.25) internal successors, (685), 4 states have internal predecessors, (685), 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-01-09 00:17:28,063 INFO L276 IsEmpty]: Start isEmpty. Operand 85564 states and 98383 transitions. [2025-01-09 00:17:28,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1206 [2025-01-09 00:17:28,072 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:17:28,072 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:17:28,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 00:17:28,073 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:17:28,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:17:28,075 INFO L85 PathProgramCache]: Analyzing trace with hash 384824703, now seen corresponding path program 1 times [2025-01-09 00:17:28,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:17:28,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897326232] [2025-01-09 00:17:28,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:17:28,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:17:28,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1205 statements into 1 equivalence classes. [2025-01-09 00:17:28,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1205 of 1205 statements. [2025-01-09 00:17:28,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:17:28,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:17:29,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1515 backedges. 847 proven. 93 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-01-09 00:17:29,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:17:29,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897326232] [2025-01-09 00:17:29,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897326232] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:17:29,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258051369] [2025-01-09 00:17:29,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:17:29,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:17:29,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:17:29,807 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-01-09 00:17:29,809 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-01-09 00:17:29,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1205 statements into 1 equivalence classes. [2025-01-09 00:17:30,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1205 of 1205 statements. [2025-01-09 00:17:30,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:17:30,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:17:30,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 1385 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 00:17:30,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:17:30,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1515 backedges. 620 proven. 0 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2025-01-09 00:17:30,382 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:17:30,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258051369] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:17:30,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:17:30,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 00:17:30,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737466377] [2025-01-09 00:17:30,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:17:30,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:17:30,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:17:30,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:17:30,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:17:30,385 INFO L87 Difference]: Start difference. First operand 85564 states and 98383 transitions. Second operand has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 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-01-09 00:17:32,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:17:32,413 INFO L93 Difference]: Finished difference Result 170436 states and 196051 transitions. [2025-01-09 00:17:32,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:17:32,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 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 1205 [2025-01-09 00:17:32,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:17:32,504 INFO L225 Difference]: With dead ends: 170436 [2025-01-09 00:17:32,504 INFO L226 Difference]: Without dead ends: 84874 [2025-01-09 00:17:32,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1209 GetRequests, 1205 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:17:32,527 INFO L435 NwaCegarLoop]: 1128 mSDtfsCounter, 598 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1849 mSolverCounterSat, 300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 2149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 300 IncrementalHoareTripleChecker+Valid, 1849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:17:32,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 1135 Invalid, 2149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [300 Valid, 1849 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:17:32,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84874 states. [2025-01-09 00:17:33,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84874 to 84874. [2025-01-09 00:17:33,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84874 states, 84873 states have (on average 1.1380061974950808) internal successors, (96586), 84873 states have internal predecessors, (96586), 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-01-09 00:17:33,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84874 states to 84874 states and 96586 transitions. [2025-01-09 00:17:33,251 INFO L78 Accepts]: Start accepts. Automaton has 84874 states and 96586 transitions. Word has length 1205 [2025-01-09 00:17:33,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:17:33,251 INFO L471 AbstractCegarLoop]: Abstraction has 84874 states and 96586 transitions. [2025-01-09 00:17:33,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 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-01-09 00:17:33,252 INFO L276 IsEmpty]: Start isEmpty. Operand 84874 states and 96586 transitions. [2025-01-09 00:17:33,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1262 [2025-01-09 00:17:33,261 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:17:33,261 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:17:33,269 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-01-09 00:17:33,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:17:33,462 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:17:33,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:17:33,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1754964825, now seen corresponding path program 1 times [2025-01-09 00:17:33,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:17:33,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114287890] [2025-01-09 00:17:33,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:17:33,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:17:33,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1261 statements into 1 equivalence classes. [2025-01-09 00:17:33,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1261 of 1261 statements. [2025-01-09 00:17:33,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:17:33,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:17:34,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1859 backedges. 760 proven. 0 refuted. 0 times theorem prover too weak. 1099 trivial. 0 not checked. [2025-01-09 00:17:34,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:17:34,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114287890] [2025-01-09 00:17:34,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114287890] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:17:34,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:17:34,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:17:34,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824673556] [2025-01-09 00:17:34,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:17:34,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:17:34,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:17:34,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:17:34,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:17:34,319 INFO L87 Difference]: Start difference. First operand 84874 states and 96586 transitions. Second operand has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 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-01-09 00:17:36,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:17:36,541 INFO L93 Difference]: Finished difference Result 198726 states and 228774 transitions. [2025-01-09 00:17:36,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:17:36,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 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 1261 [2025-01-09 00:17:36,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:17:36,673 INFO L225 Difference]: With dead ends: 198726 [2025-01-09 00:17:36,673 INFO L226 Difference]: Without dead ends: 113854 [2025-01-09 00:17:36,732 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-01-09 00:17:36,733 INFO L435 NwaCegarLoop]: 1040 mSDtfsCounter, 603 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2067 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 2357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 2067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:17:36,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 1047 Invalid, 2357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 2067 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:17:36,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113854 states. [2025-01-09 00:17:37,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113854 to 113854. [2025-01-09 00:17:37,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113854 states, 113853 states have (on average 1.1229743616768992) internal successors, (127854), 113853 states have internal predecessors, (127854), 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-01-09 00:17:38,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113854 states to 113854 states and 127854 transitions. [2025-01-09 00:17:38,056 INFO L78 Accepts]: Start accepts. Automaton has 113854 states and 127854 transitions. Word has length 1261 [2025-01-09 00:17:38,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:17:38,057 INFO L471 AbstractCegarLoop]: Abstraction has 113854 states and 127854 transitions. [2025-01-09 00:17:38,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 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-01-09 00:17:38,057 INFO L276 IsEmpty]: Start isEmpty. Operand 113854 states and 127854 transitions. [2025-01-09 00:17:38,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1283 [2025-01-09 00:17:38,077 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:17:38,077 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:17:38,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:17:38,077 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:17:38,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:17:38,078 INFO L85 PathProgramCache]: Analyzing trace with hash -221596003, now seen corresponding path program 1 times [2025-01-09 00:17:38,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:17:38,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838628118] [2025-01-09 00:17:38,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:17:38,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:17:38,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1282 statements into 1 equivalence classes. [2025-01-09 00:17:38,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1282 of 1282 statements. [2025-01-09 00:17:38,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:17:38,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:17:38,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1938 backedges. 628 proven. 0 refuted. 0 times theorem prover too weak. 1310 trivial. 0 not checked. [2025-01-09 00:17:38,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:17:38,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838628118] [2025-01-09 00:17:38,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838628118] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:17:38,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:17:38,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:17:38,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138462906] [2025-01-09 00:17:38,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:17:38,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:17:38,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:17:38,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:17:38,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:17:38,932 INFO L87 Difference]: Start difference. First operand 113854 states and 127854 transitions. Second operand has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 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-01-09 00:17:41,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:17:41,154 INFO L93 Difference]: Finished difference Result 257376 states and 289846 transitions. [2025-01-09 00:17:41,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:17:41,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 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 1282 [2025-01-09 00:17:41,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:17:41,325 INFO L225 Difference]: With dead ends: 257376 [2025-01-09 00:17:41,325 INFO L226 Difference]: Without dead ends: 135934 [2025-01-09 00:17:41,383 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-01-09 00:17:41,384 INFO L435 NwaCegarLoop]: 1081 mSDtfsCounter, 637 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1865 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 2147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 1865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:17:41,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 1088 Invalid, 2147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 1865 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:17:41,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135934 states. [2025-01-09 00:17:42,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135934 to 132484. [2025-01-09 00:17:42,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132484 states, 132483 states have (on average 1.109448004649653) internal successors, (146983), 132483 states have internal predecessors, (146983), 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-01-09 00:17:43,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132484 states to 132484 states and 146983 transitions. [2025-01-09 00:17:43,129 INFO L78 Accepts]: Start accepts. Automaton has 132484 states and 146983 transitions. Word has length 1282 [2025-01-09 00:17:43,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:17:43,130 INFO L471 AbstractCegarLoop]: Abstraction has 132484 states and 146983 transitions. [2025-01-09 00:17:43,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 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-01-09 00:17:43,130 INFO L276 IsEmpty]: Start isEmpty. Operand 132484 states and 146983 transitions. [2025-01-09 00:17:43,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1285 [2025-01-09 00:17:43,141 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:17:43,141 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:17:43,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 00:17:43,142 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:17:43,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:17:43,142 INFO L85 PathProgramCache]: Analyzing trace with hash -911918974, now seen corresponding path program 1 times [2025-01-09 00:17:43,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:17:43,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372649162] [2025-01-09 00:17:43,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:17:43,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:17:43,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1284 statements into 1 equivalence classes. [2025-01-09 00:17:43,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1284 of 1284 statements. [2025-01-09 00:17:43,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:17:43,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:17:44,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1945 backedges. 553 proven. 189 refuted. 0 times theorem prover too weak. 1203 trivial. 0 not checked. [2025-01-09 00:17:44,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:17:44,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372649162] [2025-01-09 00:17:44,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372649162] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:17:44,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247600107] [2025-01-09 00:17:44,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:17:44,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:17:44,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:17:44,174 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:17:44,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 00:17:44,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1284 statements into 1 equivalence classes. [2025-01-09 00:17:44,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1284 of 1284 statements. [2025-01-09 00:17:44,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:17:44,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:17:44,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 1487 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 00:17:44,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:17:45,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1945 backedges. 1155 proven. 0 refuted. 0 times theorem prover too weak. 790 trivial. 0 not checked. [2025-01-09 00:17:45,947 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:17:45,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247600107] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:17:45,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:17:45,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-01-09 00:17:45,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877968765] [2025-01-09 00:17:45,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:17:45,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:17:45,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:17:45,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:17:45,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:17:45,950 INFO L87 Difference]: Start difference. First operand 132484 states and 146983 transitions. Second operand has 5 states, 5 states have (on average 155.6) internal successors, (778), 4 states have internal predecessors, (778), 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-01-09 00:17:48,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:17:48,650 INFO L93 Difference]: Finished difference Result 269263 states and 298477 transitions. [2025-01-09 00:17:48,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 00:17:48,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 155.6) internal successors, (778), 4 states have internal predecessors, (778), 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 1284 [2025-01-09 00:17:48,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:17:48,793 INFO L225 Difference]: With dead ends: 269263 [2025-01-09 00:17:48,793 INFO L226 Difference]: Without dead ends: 137314 [2025-01-09 00:17:48,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1288 GetRequests, 1282 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:17:48,857 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 1030 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3396 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1030 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 3796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 3396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:17:48,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1030 Valid, 394 Invalid, 3796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 3396 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 00:17:48,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137314 states. [2025-01-09 00:17:49,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137314 to 135244. [2025-01-09 00:17:50,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135244 states, 135243 states have (on average 1.1081460778006995) internal successors, (149869), 135243 states have internal predecessors, (149869), 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-01-09 00:17:50,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135244 states to 135244 states and 149869 transitions. [2025-01-09 00:17:50,214 INFO L78 Accepts]: Start accepts. Automaton has 135244 states and 149869 transitions. Word has length 1284 [2025-01-09 00:17:50,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:17:50,215 INFO L471 AbstractCegarLoop]: Abstraction has 135244 states and 149869 transitions. [2025-01-09 00:17:50,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 155.6) internal successors, (778), 4 states have internal predecessors, (778), 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-01-09 00:17:50,215 INFO L276 IsEmpty]: Start isEmpty. Operand 135244 states and 149869 transitions. [2025-01-09 00:17:50,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1300 [2025-01-09 00:17:50,225 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:17:50,226 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:17:50,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 00:17:50,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 00:17:50,427 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:17:50,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:17:50,427 INFO L85 PathProgramCache]: Analyzing trace with hash -846952204, now seen corresponding path program 1 times [2025-01-09 00:17:50,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:17:50,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674642372] [2025-01-09 00:17:50,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:17:50,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:17:50,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1299 statements into 1 equivalence classes. [2025-01-09 00:17:50,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1299 of 1299 statements. [2025-01-09 00:17:50,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:17:50,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:17:51,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1763 backedges. 1081 proven. 107 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-01-09 00:17:51,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:17:51,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674642372] [2025-01-09 00:17:51,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674642372] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:17:51,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785250632] [2025-01-09 00:17:51,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:17:51,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:17:51,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:17:51,519 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:17:51,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 00:17:51,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1299 statements into 1 equivalence classes. [2025-01-09 00:17:51,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1299 of 1299 statements. [2025-01-09 00:17:51,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:17:51,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:17:51,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 1482 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 00:17:51,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:17:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1763 backedges. 1081 proven. 107 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-01-09 00:17:52,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:17:52,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1763 backedges. 1188 proven. 0 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-01-09 00:17:52,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785250632] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:17:52,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:17:52,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2025-01-09 00:17:52,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573283411] [2025-01-09 00:17:52,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:17:52,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:17:52,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:17:52,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:17:52,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-01-09 00:17:52,606 INFO L87 Difference]: Start difference. First operand 135244 states and 149869 transitions. Second operand has 5 states, 5 states have (on average 172.8) internal successors, (864), 5 states have internal predecessors, (864), 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-01-09 00:17:55,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:17:55,848 INFO L93 Difference]: Finished difference Result 277386 states and 307458 transitions. [2025-01-09 00:17:55,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:17:55,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 172.8) internal successors, (864), 5 states have internal predecessors, (864), 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 1299 [2025-01-09 00:17:55,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:17:56,007 INFO L225 Difference]: With dead ends: 277386 [2025-01-09 00:17:56,007 INFO L226 Difference]: Without dead ends: 142834 [2025-01-09 00:17:56,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2601 GetRequests, 2593 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-01-09 00:17:56,044 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 1818 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2273 mSolverCounterSat, 674 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1818 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 2947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 674 IncrementalHoareTripleChecker+Valid, 2273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:17:56,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1818 Valid, 14 Invalid, 2947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [674 Valid, 2273 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 00:17:56,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142834 states. [2025-01-09 00:17:57,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142834 to 133864. [2025-01-09 00:17:57,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133864 states, 133863 states have (on average 1.1090517917572444) internal successors, (148461), 133863 states have internal predecessors, (148461), 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-01-09 00:17:57,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133864 states to 133864 states and 148461 transitions. [2025-01-09 00:17:57,551 INFO L78 Accepts]: Start accepts. Automaton has 133864 states and 148461 transitions. Word has length 1299 [2025-01-09 00:17:57,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:17:57,552 INFO L471 AbstractCegarLoop]: Abstraction has 133864 states and 148461 transitions. [2025-01-09 00:17:57,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 172.8) internal successors, (864), 5 states have internal predecessors, (864), 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-01-09 00:17:57,552 INFO L276 IsEmpty]: Start isEmpty. Operand 133864 states and 148461 transitions. [2025-01-09 00:17:57,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1379 [2025-01-09 00:17:57,565 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:17:57,566 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:17:57,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 00:17:57,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:17:57,770 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:17:57,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:17:57,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1021647272, now seen corresponding path program 1 times [2025-01-09 00:17:57,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:17:57,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756258486] [2025-01-09 00:17:57,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:17:57,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:17:57,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1378 statements into 1 equivalence classes. [2025-01-09 00:17:57,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1378 of 1378 statements. [2025-01-09 00:17:57,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:17:57,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat