./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label31.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem15_label31.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 c9e1a0326cfbd74069fe8a9392496d7bba5eb0c64820bba9b08ddeb981e8ffba --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:53:39,218 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:53:39,273 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:53:39,276 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:53:39,277 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:53:39,299 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:53:39,300 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:53:39,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:53:39,300 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:53:39,300 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:53:39,301 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:53:39,301 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:53:39,301 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:53:39,301 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:53:39,301 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:53:39,301 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:53:39,301 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:53:39,301 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:53:39,301 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:53:39,301 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:53:39,301 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:53:39,301 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:53:39,301 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:53:39,301 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:53:39,301 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:53:39,301 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:53:39,302 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:53:39,302 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:53:39,302 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:53:39,302 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:53:39,302 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:53:39,302 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:53:39,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:53:39,302 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:53:39,302 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:53:39,302 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:53:39,302 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:53:39,302 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:53:39,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:53:39,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:53:39,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:53:39,302 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:53:39,303 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:53:39,303 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 -> c9e1a0326cfbd74069fe8a9392496d7bba5eb0c64820bba9b08ddeb981e8ffba [2025-02-05 11:53:39,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:53:39,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:53:39,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:53:39,591 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:53:39,592 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:53:39,593 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label31.c [2025-02-05 11:53:40,839 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2915f354e/a17e0a19d65e4fe38f4591d10b09f884/FLAGa61d805e3 [2025-02-05 11:53:41,234 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:53:41,234 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label31.c [2025-02-05 11:53:41,250 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2915f354e/a17e0a19d65e4fe38f4591d10b09f884/FLAGa61d805e3 [2025-02-05 11:53:41,263 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2915f354e/a17e0a19d65e4fe38f4591d10b09f884 [2025-02-05 11:53:41,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:53:41,266 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:53:41,267 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:53:41,267 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:53:41,270 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:53:41,271 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:53:41" (1/1) ... [2025-02-05 11:53:41,273 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4479722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:53:41, skipping insertion in model container [2025-02-05 11:53:41,273 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:53:41" (1/1) ... [2025-02-05 11:53:41,310 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:53:41,442 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/Problem15_label31.c[7892,7905] [2025-02-05 11:53:41,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:53:41,676 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:53:41,696 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/Problem15_label31.c[7892,7905] [2025-02-05 11:53:41,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:53:41,888 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:53:41,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:53:41 WrapperNode [2025-02-05 11:53:41,889 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:53:41,890 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:53:41,890 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:53:41,890 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:53:41,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:53:41" (1/1) ... [2025-02-05 11:53:41,926 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:53:41" (1/1) ... [2025-02-05 11:53:42,099 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-02-05 11:53:42,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:53:42,100 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:53:42,101 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:53:42,101 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:53:42,107 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:53:41" (1/1) ... [2025-02-05 11:53:42,108 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:53:41" (1/1) ... [2025-02-05 11:53:42,137 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:53:41" (1/1) ... [2025-02-05 11:53:42,239 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 11:53:42,239 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:53:41" (1/1) ... [2025-02-05 11:53:42,239 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:53:41" (1/1) ... [2025-02-05 11:53:42,296 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:53:41" (1/1) ... [2025-02-05 11:53:42,303 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:53:41" (1/1) ... [2025-02-05 11:53:42,314 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:53:41" (1/1) ... [2025-02-05 11:53:42,323 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:53:41" (1/1) ... [2025-02-05 11:53:42,375 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:53:42,376 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:53:42,376 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:53:42,376 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:53:42,377 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:53:41" (1/1) ... [2025-02-05 11:53:42,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:53:42,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:53:42,402 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 11:53:42,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 11:53:42,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:53:42,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:53:42,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:53:42,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:53:42,486 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:53:42,488 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:53:44,499 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1; [2025-02-05 11:53:44,612 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-02-05 11:53:44,612 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:53:44,636 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:53:44,637 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:53:44,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:53:44 BoogieIcfgContainer [2025-02-05 11:53:44,639 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:53:44,641 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:53:44,641 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:53:44,648 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:53:44,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:53:41" (1/3) ... [2025-02-05 11:53:44,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@623c074f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:53:44, skipping insertion in model container [2025-02-05 11:53:44,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:53:41" (2/3) ... [2025-02-05 11:53:44,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@623c074f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:53:44, skipping insertion in model container [2025-02-05 11:53:44,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:53:44" (3/3) ... [2025-02-05 11:53:44,655 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label31.c [2025-02-05 11:53:44,676 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:53:44,681 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label31.c that has 1 procedures, 424 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:53:44,771 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:53:44,787 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;@77710d99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:53:44,787 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:53:44,792 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 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-02-05 11:53:44,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 11:53:44,797 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:53:44,798 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:53:44,798 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:53:44,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:53:44,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1545819425, now seen corresponding path program 1 times [2025-02-05 11:53:44,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:53:44,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144599376] [2025-02-05 11:53:44,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:53:44,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:53:44,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 11:53:44,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 11:53:44,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:53:44,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:53:45,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:53:45,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:53:45,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144599376] [2025-02-05 11:53:45,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144599376] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:53:45,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:53:45,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:53:45,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679521198] [2025-02-05 11:53:45,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:53:45,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:53:45,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:53:45,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:53:45,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:53:45,195 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 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) Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:53:46,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:53:46,526 INFO L93 Difference]: Finished difference Result 1155 states and 2103 transitions. [2025-02-05 11:53:46,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:53:46,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 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 65 [2025-02-05 11:53:46,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:53:46,541 INFO L225 Difference]: With dead ends: 1155 [2025-02-05 11:53:46,541 INFO L226 Difference]: Without dead ends: 667 [2025-02-05 11:53:46,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:53:46,552 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 279 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:53:46,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 370 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 11:53:46,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-02-05 11:53:46,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 665. [2025-02-05 11:53:46,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 664 states have (on average 1.4789156626506024) internal successors, (982), 664 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:53:46,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 982 transitions. [2025-02-05 11:53:46,634 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 982 transitions. Word has length 65 [2025-02-05 11:53:46,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:53:46,636 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 982 transitions. [2025-02-05 11:53:46,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:53:46,637 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 982 transitions. [2025-02-05 11:53:46,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 11:53:46,640 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:53:46,640 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, 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] [2025-02-05 11:53:46,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:53:46,640 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:53:46,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:53:46,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1389783800, now seen corresponding path program 1 times [2025-02-05 11:53:46,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:53:46,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819841754] [2025-02-05 11:53:46,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:53:46,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:53:46,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 11:53:46,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 11:53:46,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:53:46,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:53:46,912 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:53:46,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:53:46,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819841754] [2025-02-05 11:53:46,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819841754] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:53:46,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:53:46,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:53:46,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128717064] [2025-02-05 11:53:46,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:53:46,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:53:46,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:53:46,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:53:46,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:53:46,916 INFO L87 Difference]: Start difference. First operand 665 states and 982 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:53:48,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:53:48,474 INFO L93 Difference]: Finished difference Result 1953 states and 2893 transitions. [2025-02-05 11:53:48,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:53:48,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 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 140 [2025-02-05 11:53:48,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:53:48,482 INFO L225 Difference]: With dead ends: 1953 [2025-02-05 11:53:48,485 INFO L226 Difference]: Without dead ends: 1290 [2025-02-05 11:53:48,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:53:48,487 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 257 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:53:48,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 323 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 11:53:48,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2025-02-05 11:53:48,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1282. [2025-02-05 11:53:48,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1281 states have (on average 1.3989071038251366) internal successors, (1792), 1281 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:53:48,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1792 transitions. [2025-02-05 11:53:48,510 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1792 transitions. Word has length 140 [2025-02-05 11:53:48,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:53:48,510 INFO L471 AbstractCegarLoop]: Abstraction has 1282 states and 1792 transitions. [2025-02-05 11:53:48,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:53:48,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1792 transitions. [2025-02-05 11:53:48,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 11:53:48,512 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:53:48,512 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, 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] [2025-02-05 11:53:48,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:53:48,513 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:53:48,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:53:48,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1936014014, now seen corresponding path program 1 times [2025-02-05 11:53:48,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:53:48,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648390758] [2025-02-05 11:53:48,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:53:48,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:53:48,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 11:53:48,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 11:53:48,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:53:48,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:53:48,662 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:53:48,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:53:48,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648390758] [2025-02-05 11:53:48,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648390758] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:53:48,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:53:48,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:53:48,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325483173] [2025-02-05 11:53:48,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:53:48,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:53:48,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:53:48,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:53:48,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:53:48,664 INFO L87 Difference]: Start difference. First operand 1282 states and 1792 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:53:49,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:53:49,868 INFO L93 Difference]: Finished difference Result 3766 states and 5264 transitions. [2025-02-05 11:53:49,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:53:49,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 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 144 [2025-02-05 11:53:49,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:53:49,877 INFO L225 Difference]: With dead ends: 3766 [2025-02-05 11:53:49,878 INFO L226 Difference]: Without dead ends: 2486 [2025-02-05 11:53:49,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:53:49,886 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 271 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:53:49,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 338 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 11:53:49,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2025-02-05 11:53:49,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2182. [2025-02-05 11:53:49,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2182 states, 2181 states have (on average 1.2824392480513527) internal successors, (2797), 2181 states have internal predecessors, (2797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:53:49,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 2797 transitions. [2025-02-05 11:53:49,924 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 2797 transitions. Word has length 144 [2025-02-05 11:53:49,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:53:49,925 INFO L471 AbstractCegarLoop]: Abstraction has 2182 states and 2797 transitions. [2025-02-05 11:53:49,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:53:49,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 2797 transitions. [2025-02-05 11:53:49,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-02-05 11:53:49,929 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:53:49,929 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, 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] [2025-02-05 11:53:49,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:53:49,930 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:53:49,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:53:49,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1325130807, now seen corresponding path program 1 times [2025-02-05 11:53:49,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:53:49,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339628696] [2025-02-05 11:53:49,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:53:49,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:53:49,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-02-05 11:53:49,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-02-05 11:53:49,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:53:49,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:53:50,700 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:53:50,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:53:50,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339628696] [2025-02-05 11:53:50,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339628696] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:53:50,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:53:50,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:53:50,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869129635] [2025-02-05 11:53:50,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:53:50,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:53:50,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:53:50,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:53:50,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:53:50,703 INFO L87 Difference]: Start difference. First operand 2182 states and 2797 transitions. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:53:52,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:53:52,454 INFO L93 Difference]: Finished difference Result 4661 states and 5903 transitions. [2025-02-05 11:53:52,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:53:52,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 2 states have internal predecessors, (261), 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 261 [2025-02-05 11:53:52,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:53:52,465 INFO L225 Difference]: With dead ends: 4661 [2025-02-05 11:53:52,465 INFO L226 Difference]: Without dead ends: 2481 [2025-02-05 11:53:52,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:53:52,468 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:53:52,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 11:53:52,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2481 states. [2025-02-05 11:53:52,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2481 to 2481. [2025-02-05 11:53:52,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2481 states, 2480 states have (on average 1.2508064516129032) internal successors, (3102), 2480 states have internal predecessors, (3102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:53:52,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3102 transitions. [2025-02-05 11:53:52,529 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3102 transitions. Word has length 261 [2025-02-05 11:53:52,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:53:52,530 INFO L471 AbstractCegarLoop]: Abstraction has 2481 states and 3102 transitions. [2025-02-05 11:53:52,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:53:52,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3102 transitions. [2025-02-05 11:53:52,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-02-05 11:53:52,532 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:53:52,533 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, 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] [2025-02-05 11:53:52,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:53:52,533 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:53:52,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:53:52,534 INFO L85 PathProgramCache]: Analyzing trace with hash 234057141, now seen corresponding path program 1 times [2025-02-05 11:53:52,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:53:52,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125489229] [2025-02-05 11:53:52,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:53:52,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:53:52,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-02-05 11:53:52,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-02-05 11:53:52,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:53:52,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:53:52,843 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:53:52,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:53:52,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125489229] [2025-02-05 11:53:52,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125489229] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:53:52,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:53:52,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:53:52,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448486009] [2025-02-05 11:53:52,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:53:52,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:53:52,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:53:52,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:53:52,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:53:52,846 INFO L87 Difference]: Start difference. First operand 2481 states and 3102 transitions. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:53:54,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:53:54,142 INFO L93 Difference]: Finished difference Result 5872 states and 7585 transitions. [2025-02-05 11:53:54,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:53:54,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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 335 [2025-02-05 11:53:54,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:53:54,153 INFO L225 Difference]: With dead ends: 5872 [2025-02-05 11:53:54,153 INFO L226 Difference]: Without dead ends: 3692 [2025-02-05 11:53:54,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:53:54,156 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 255 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:53:54,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 664 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 11:53:54,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3692 states. [2025-02-05 11:53:54,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3692 to 3390. [2025-02-05 11:53:54,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3390 states, 3389 states have (on average 1.2198288580702272) internal successors, (4134), 3389 states have internal predecessors, (4134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:53:54,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3390 states to 3390 states and 4134 transitions. [2025-02-05 11:53:54,196 INFO L78 Accepts]: Start accepts. Automaton has 3390 states and 4134 transitions. Word has length 335 [2025-02-05 11:53:54,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:53:54,197 INFO L471 AbstractCegarLoop]: Abstraction has 3390 states and 4134 transitions. [2025-02-05 11:53:54,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:53:54,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3390 states and 4134 transitions. [2025-02-05 11:53:54,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-02-05 11:53:54,200 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:53:54,200 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:53:54,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:53:54,200 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:53:54,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:53:54,202 INFO L85 PathProgramCache]: Analyzing trace with hash -406655409, now seen corresponding path program 1 times [2025-02-05 11:53:54,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:53:54,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839686384] [2025-02-05 11:53:54,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:53:54,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:53:54,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-02-05 11:53:54,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-02-05 11:53:54,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:53:54,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:53:54,457 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-02-05 11:53:54,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:53:54,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839686384] [2025-02-05 11:53:54,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839686384] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:53:54,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:53:54,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:53:54,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844200667] [2025-02-05 11:53:54,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:53:54,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:53:54,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:53:54,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:53:54,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:53:54,460 INFO L87 Difference]: Start difference. First operand 3390 states and 4134 transitions. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:53:55,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:53:55,990 INFO L93 Difference]: Finished difference Result 7677 states and 9634 transitions. [2025-02-05 11:53:55,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:53:55,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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 352 [2025-02-05 11:53:55,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:53:56,002 INFO L225 Difference]: With dead ends: 7677 [2025-02-05 11:53:56,002 INFO L226 Difference]: Without dead ends: 4588 [2025-02-05 11:53:56,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:53:56,008 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 263 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:53:56,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 619 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 11:53:56,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4588 states. [2025-02-05 11:53:56,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4588 to 4584. [2025-02-05 11:53:56,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4584 states, 4583 states have (on average 1.1880864062840935) internal successors, (5445), 4583 states have internal predecessors, (5445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:53:56,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4584 states to 4584 states and 5445 transitions. [2025-02-05 11:53:56,083 INFO L78 Accepts]: Start accepts. Automaton has 4584 states and 5445 transitions. Word has length 352 [2025-02-05 11:53:56,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:53:56,086 INFO L471 AbstractCegarLoop]: Abstraction has 4584 states and 5445 transitions. [2025-02-05 11:53:56,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:53:56,087 INFO L276 IsEmpty]: Start isEmpty. Operand 4584 states and 5445 transitions. [2025-02-05 11:53:56,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2025-02-05 11:53:56,097 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:53:56,097 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:53:56,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:53:56,098 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:53:56,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:53:56,098 INFO L85 PathProgramCache]: Analyzing trace with hash -964329726, now seen corresponding path program 1 times [2025-02-05 11:53:56,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:53:56,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297063515] [2025-02-05 11:53:56,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:53:56,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:53:56,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 516 statements into 1 equivalence classes. [2025-02-05 11:53:56,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 516 of 516 statements. [2025-02-05 11:53:56,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:53:56,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:53:56,712 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 430 proven. 39 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-02-05 11:53:56,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:53:56,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297063515] [2025-02-05 11:53:56,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297063515] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:53:56,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445802659] [2025-02-05 11:53:56,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:53:56,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:53:56,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:53:56,715 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:53:56,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 11:53:56,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 516 statements into 1 equivalence classes. [2025-02-05 11:53:56,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 516 of 516 statements. [2025-02-05 11:53:56,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:53:56,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:53:56,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:53:56,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:53:57,228 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 379 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-02-05 11:53:57,230 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:53:57,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445802659] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:53:57,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:53:57,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 11:53:57,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998881996] [2025-02-05 11:53:57,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:53:57,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:53:57,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:53:57,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:53:57,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:53:57,232 INFO L87 Difference]: Start difference. First operand 4584 states and 5445 transitions. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:53:58,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:53:58,575 INFO L93 Difference]: Finished difference Result 11558 states and 13811 transitions. [2025-02-05 11:53:58,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:53:58,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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 516 [2025-02-05 11:53:58,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:53:58,592 INFO L225 Difference]: With dead ends: 11558 [2025-02-05 11:53:58,592 INFO L226 Difference]: Without dead ends: 7275 [2025-02-05 11:53:58,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 515 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:53:58,596 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 148 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:53:58,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 316 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 11:53:58,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7275 states. [2025-02-05 11:53:58,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7275 to 6378. [2025-02-05 11:53:58,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6378 states, 6377 states have (on average 1.164340599027756) internal successors, (7425), 6377 states have internal predecessors, (7425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:53:58,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6378 states to 6378 states and 7425 transitions. [2025-02-05 11:53:58,661 INFO L78 Accepts]: Start accepts. Automaton has 6378 states and 7425 transitions. Word has length 516 [2025-02-05 11:53:58,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:53:58,662 INFO L471 AbstractCegarLoop]: Abstraction has 6378 states and 7425 transitions. [2025-02-05 11:53:58,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:53:58,662 INFO L276 IsEmpty]: Start isEmpty. Operand 6378 states and 7425 transitions. [2025-02-05 11:53:58,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2025-02-05 11:53:58,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:53:58,669 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-02-05 11:53:58,679 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-02-05 11:53:58,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:53:58,871 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:53:58,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:53:58,871 INFO L85 PathProgramCache]: Analyzing trace with hash -173866052, now seen corresponding path program 1 times [2025-02-05 11:53:58,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:53:58,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689338089] [2025-02-05 11:53:58,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:53:58,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:53:58,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes. [2025-02-05 11:53:58,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements. [2025-02-05 11:53:58,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:53:58,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:53:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2025-02-05 11:53:59,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:53:59,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689338089] [2025-02-05 11:53:59,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689338089] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:53:59,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:53:59,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:53:59,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894839992] [2025-02-05 11:53:59,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:53:59,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:53:59,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:53:59,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:53:59,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:53:59,159 INFO L87 Difference]: Start difference. First operand 6378 states and 7425 transitions. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:54:00,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:54:00,407 INFO L93 Difference]: Finished difference Result 15743 states and 18434 transitions. [2025-02-05 11:54:00,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:54:00,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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 539 [2025-02-05 11:54:00,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:54:00,429 INFO L225 Difference]: With dead ends: 15743 [2025-02-05 11:54:00,429 INFO L226 Difference]: Without dead ends: 9666 [2025-02-05 11:54:00,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:54:00,435 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 275 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:54:00,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 263 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 11:54:00,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9666 states. [2025-02-05 11:54:00,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9666 to 7871. [2025-02-05 11:54:00,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7871 states, 7870 states have (on average 1.1616264294790344) internal successors, (9142), 7870 states have internal predecessors, (9142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:54:00,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7871 states to 7871 states and 9142 transitions. [2025-02-05 11:54:00,542 INFO L78 Accepts]: Start accepts. Automaton has 7871 states and 9142 transitions. Word has length 539 [2025-02-05 11:54:00,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:54:00,543 INFO L471 AbstractCegarLoop]: Abstraction has 7871 states and 9142 transitions. [2025-02-05 11:54:00,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:54:00,543 INFO L276 IsEmpty]: Start isEmpty. Operand 7871 states and 9142 transitions. [2025-02-05 11:54:00,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2025-02-05 11:54:00,549 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:54:00,550 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 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] [2025-02-05 11:54:00,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:54:00,551 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:54:00,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:54:00,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1733825029, now seen corresponding path program 1 times [2025-02-05 11:54:00,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:54:00,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999029969] [2025-02-05 11:54:00,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:54:00,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:54:00,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 553 statements into 1 equivalence classes. [2025-02-05 11:54:00,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 553 of 553 statements. [2025-02-05 11:54:00,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:54:00,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:54:00,903 INFO L134 CoverageAnalysis]: Checked inductivity of 787 backedges. 487 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-02-05 11:54:00,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:54:00,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999029969] [2025-02-05 11:54:00,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999029969] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:54:00,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:54:00,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:54:00,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039404735] [2025-02-05 11:54:00,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:54:00,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:54:00,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:54:00,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:54:00,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:54:00,905 INFO L87 Difference]: Start difference. First operand 7871 states and 9142 transitions. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:54:02,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:54:02,122 INFO L93 Difference]: Finished difference Result 19043 states and 22343 transitions. [2025-02-05 11:54:02,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:54:02,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 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 553 [2025-02-05 11:54:02,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:54:02,145 INFO L225 Difference]: With dead ends: 19043 [2025-02-05 11:54:02,146 INFO L226 Difference]: Without dead ends: 11473 [2025-02-05 11:54:02,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:54:02,155 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 246 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:54:02,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 621 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 11:54:02,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11473 states. [2025-02-05 11:54:02,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11473 to 11163. [2025-02-05 11:54:02,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11163 states, 11162 states have (on average 1.1483605088693782) internal successors, (12818), 11162 states have internal predecessors, (12818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:54:02,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11163 states to 11163 states and 12818 transitions. [2025-02-05 11:54:02,250 INFO L78 Accepts]: Start accepts. Automaton has 11163 states and 12818 transitions. Word has length 553 [2025-02-05 11:54:02,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:54:02,251 INFO L471 AbstractCegarLoop]: Abstraction has 11163 states and 12818 transitions. [2025-02-05 11:54:02,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:54:02,251 INFO L276 IsEmpty]: Start isEmpty. Operand 11163 states and 12818 transitions. [2025-02-05 11:54:02,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2025-02-05 11:54:02,257 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:54:02,257 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-02-05 11:54:02,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:54:02,258 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:54:02,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:54:02,258 INFO L85 PathProgramCache]: Analyzing trace with hash -925236175, now seen corresponding path program 1 times [2025-02-05 11:54:02,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:54:02,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95735046] [2025-02-05 11:54:02,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:54:02,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:54:02,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 566 statements into 1 equivalence classes. [2025-02-05 11:54:02,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 566 of 566 statements. [2025-02-05 11:54:02,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:54:02,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:54:02,721 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2025-02-05 11:54:02,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:54:02,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95735046] [2025-02-05 11:54:02,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95735046] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:54:02,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:54:02,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:54:02,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135945584] [2025-02-05 11:54:02,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:54:02,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:54:02,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:54:02,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:54:02,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:54:02,723 INFO L87 Difference]: Start difference. First operand 11163 states and 12818 transitions. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:54:03,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:54:03,853 INFO L93 Difference]: Finished difference Result 22322 states and 25668 transitions. [2025-02-05 11:54:03,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:54:03,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 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 566 [2025-02-05 11:54:03,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:54:03,867 INFO L225 Difference]: With dead ends: 22322 [2025-02-05 11:54:03,867 INFO L226 Difference]: Without dead ends: 11460 [2025-02-05 11:54:03,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:54:03,876 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 464 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:54:03,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 70 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 11:54:03,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11460 states. [2025-02-05 11:54:03,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11460 to 11161. [2025-02-05 11:54:04,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11161 states, 11160 states have (on average 1.1482078853046596) internal successors, (12814), 11160 states have internal predecessors, (12814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:54:04,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11161 states to 11161 states and 12814 transitions. [2025-02-05 11:54:04,022 INFO L78 Accepts]: Start accepts. Automaton has 11161 states and 12814 transitions. Word has length 566 [2025-02-05 11:54:04,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:54:04,023 INFO L471 AbstractCegarLoop]: Abstraction has 11161 states and 12814 transitions. [2025-02-05 11:54:04,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:54:04,023 INFO L276 IsEmpty]: Start isEmpty. Operand 11161 states and 12814 transitions. [2025-02-05 11:54:04,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2025-02-05 11:54:04,033 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:54:04,034 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 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] [2025-02-05 11:54:04,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 11:54:04,034 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:54:04,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:54:04,035 INFO L85 PathProgramCache]: Analyzing trace with hash -2031887712, now seen corresponding path program 1 times [2025-02-05 11:54:04,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:54:04,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141169694] [2025-02-05 11:54:04,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:54:04,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:54:04,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 586 statements into 1 equivalence classes. [2025-02-05 11:54:04,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 586 of 586 statements. [2025-02-05 11:54:04,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:54:04,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:54:04,288 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-05 11:54:04,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:54:04,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141169694] [2025-02-05 11:54:04,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141169694] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:54:04,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:54:04,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:54:04,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960893660] [2025-02-05 11:54:04,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:54:04,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:54:04,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:54:04,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:54:04,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:54:04,290 INFO L87 Difference]: Start difference. First operand 11161 states and 12814 transitions. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:54:05,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:54:05,351 INFO L93 Difference]: Finished difference Result 23815 states and 27343 transitions. [2025-02-05 11:54:05,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:54:05,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 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 586 [2025-02-05 11:54:05,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:54:05,362 INFO L225 Difference]: With dead ends: 23815 [2025-02-05 11:54:05,362 INFO L226 Difference]: Without dead ends: 12955 [2025-02-05 11:54:05,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:54:05,367 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 270 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:54:05,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 322 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 11:54:05,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12955 states. [2025-02-05 11:54:05,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12955 to 9364. [2025-02-05 11:54:05,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9364 states, 9363 states have (on average 1.161807113104774) internal successors, (10878), 9363 states have internal predecessors, (10878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:54:05,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9364 states to 9364 states and 10878 transitions. [2025-02-05 11:54:05,440 INFO L78 Accepts]: Start accepts. Automaton has 9364 states and 10878 transitions. Word has length 586 [2025-02-05 11:54:05,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:54:05,441 INFO L471 AbstractCegarLoop]: Abstraction has 9364 states and 10878 transitions. [2025-02-05 11:54:05,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:54:05,441 INFO L276 IsEmpty]: Start isEmpty. Operand 9364 states and 10878 transitions. [2025-02-05 11:54:05,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2025-02-05 11:54:05,446 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:54:05,446 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:54:05,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:54:05,447 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:54:05,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:54:05,448 INFO L85 PathProgramCache]: Analyzing trace with hash 724450181, now seen corresponding path program 1 times [2025-02-05 11:54:05,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:54:05,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028122424] [2025-02-05 11:54:05,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:54:05,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:54:05,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes. [2025-02-05 11:54:05,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements. [2025-02-05 11:54:05,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:54:05,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:54:05,766 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 444 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-02-05 11:54:05,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:54:05,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028122424] [2025-02-05 11:54:05,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028122424] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:54:05,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:54:05,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:54:05,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069507483] [2025-02-05 11:54:05,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:54:05,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:54:05,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:54:05,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:54:05,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:54:05,767 INFO L87 Difference]: Start difference. First operand 9364 states and 10878 transitions. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:54:07,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:54:07,073 INFO L93 Difference]: Finished difference Result 23510 states and 27453 transitions. [2025-02-05 11:54:07,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:54:07,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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 592 [2025-02-05 11:54:07,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:54:07,091 INFO L225 Difference]: With dead ends: 23510 [2025-02-05 11:54:07,091 INFO L226 Difference]: Without dead ends: 14447 [2025-02-05 11:54:07,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:54:07,101 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 222 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:54:07,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 203 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 11:54:07,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14447 states. [2025-02-05 11:54:07,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14447 to 11756. [2025-02-05 11:54:07,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11756 states, 11755 states have (on average 1.1770310506167587) internal successors, (13836), 11755 states have internal predecessors, (13836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:54:07,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11756 states to 11756 states and 13836 transitions. [2025-02-05 11:54:07,229 INFO L78 Accepts]: Start accepts. Automaton has 11756 states and 13836 transitions. Word has length 592 [2025-02-05 11:54:07,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:54:07,229 INFO L471 AbstractCegarLoop]: Abstraction has 11756 states and 13836 transitions. [2025-02-05 11:54:07,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:54:07,230 INFO L276 IsEmpty]: Start isEmpty. Operand 11756 states and 13836 transitions. [2025-02-05 11:54:07,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2025-02-05 11:54:07,236 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:54:07,236 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:54:07,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:54:07,236 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:54:07,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:54:07,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1756630142, now seen corresponding path program 1 times [2025-02-05 11:54:07,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:54:07,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363919488] [2025-02-05 11:54:07,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:54:07,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:54:07,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 612 statements into 1 equivalence classes. [2025-02-05 11:54:07,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 612 of 612 statements. [2025-02-05 11:54:07,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:54:07,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:54:07,455 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-02-05 11:54:07,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:54:07,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363919488] [2025-02-05 11:54:07,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363919488] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:54:07,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:54:07,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:54:07,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098728525] [2025-02-05 11:54:07,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:54:07,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:54:07,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:54:07,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:54:07,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:54:07,458 INFO L87 Difference]: Start difference. First operand 11756 states and 13836 transitions. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:54:09,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:54:09,157 INFO L93 Difference]: Finished difference Result 26200 states and 31365 transitions. [2025-02-05 11:54:09,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:54:09,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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 612 [2025-02-05 11:54:09,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:54:09,175 INFO L225 Difference]: With dead ends: 26200 [2025-02-05 11:54:09,175 INFO L226 Difference]: Without dead ends: 14745 [2025-02-05 11:54:09,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:54:09,185 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 349 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:54:09,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 444 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 11:54:09,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14745 states. [2025-02-05 11:54:09,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14745 to 14745. [2025-02-05 11:54:09,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14745 states, 14744 states have (on average 1.1718665219750406) internal successors, (17278), 14744 states have internal predecessors, (17278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:54:09,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14745 states to 14745 states and 17278 transitions. [2025-02-05 11:54:09,417 INFO L78 Accepts]: Start accepts. Automaton has 14745 states and 17278 transitions. Word has length 612 [2025-02-05 11:54:09,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:54:09,418 INFO L471 AbstractCegarLoop]: Abstraction has 14745 states and 17278 transitions. [2025-02-05 11:54:09,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:54:09,418 INFO L276 IsEmpty]: Start isEmpty. Operand 14745 states and 17278 transitions. [2025-02-05 11:54:09,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2025-02-05 11:54:09,430 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:54:09,430 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:54:09,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 11:54:09,431 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:54:09,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:54:09,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1856530000, now seen corresponding path program 1 times [2025-02-05 11:54:09,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:54:09,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042594467] [2025-02-05 11:54:09,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:54:09,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:54:09,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 628 statements into 1 equivalence classes. [2025-02-05 11:54:09,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 628 of 628 statements. [2025-02-05 11:54:09,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:54:09,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:54:09,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1149 backedges. 692 proven. 39 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2025-02-05 11:54:09,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:54:09,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042594467] [2025-02-05 11:54:09,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042594467] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:54:09,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474528498] [2025-02-05 11:54:09,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:54:09,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:54:09,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:54:09,925 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:54:09,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 11:54:10,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 628 statements into 1 equivalence classes. [2025-02-05 11:54:10,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 628 of 628 statements. [2025-02-05 11:54:10,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:54:10,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:54:10,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:54:10,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:54:10,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1149 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 835 trivial. 0 not checked. [2025-02-05 11:54:10,195 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:54:10,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474528498] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:54:10,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:54:10,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 11:54:10,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148791253] [2025-02-05 11:54:10,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:54:10,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:54:10,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:54:10,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:54:10,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:54:10,199 INFO L87 Difference]: Start difference. First operand 14745 states and 17278 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:54:11,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:54:11,299 INFO L93 Difference]: Finished difference Result 31581 states and 37212 transitions. [2025-02-05 11:54:11,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:54:11,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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 628 [2025-02-05 11:54:11,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:54:11,315 INFO L225 Difference]: With dead ends: 31581 [2025-02-05 11:54:11,315 INFO L226 Difference]: Without dead ends: 17137 [2025-02-05 11:54:11,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 631 GetRequests, 627 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:54:11,325 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 256 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:54:11,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 630 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 11:54:11,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17137 states. [2025-02-05 11:54:11,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17137 to 16837. [2025-02-05 11:54:11,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16837 states, 16836 states have (on average 1.1313851271085769) internal successors, (19048), 16836 states have internal predecessors, (19048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:54:11,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16837 states to 16837 states and 19048 transitions. [2025-02-05 11:54:11,449 INFO L78 Accepts]: Start accepts. Automaton has 16837 states and 19048 transitions. Word has length 628 [2025-02-05 11:54:11,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:54:11,449 INFO L471 AbstractCegarLoop]: Abstraction has 16837 states and 19048 transitions. [2025-02-05 11:54:11,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:54:11,449 INFO L276 IsEmpty]: Start isEmpty. Operand 16837 states and 19048 transitions. [2025-02-05 11:54:11,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 687 [2025-02-05 11:54:11,457 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:54:11,458 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 11:54:11,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 11:54:11,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:54:11,659 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:54:11,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:54:11,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1456642152, now seen corresponding path program 1 times [2025-02-05 11:54:11,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:54:11,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485230112] [2025-02-05 11:54:11,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:54:11,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:54:11,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 686 statements into 1 equivalence classes. [2025-02-05 11:54:11,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 686 of 686 statements. [2025-02-05 11:54:11,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:54:11,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:54:11,969 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 593 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2025-02-05 11:54:11,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:54:11,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485230112] [2025-02-05 11:54:11,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485230112] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:54:11,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:54:11,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:54:11,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165641179] [2025-02-05 11:54:11,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:54:11,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:54:11,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:54:11,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:54:11,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:54:11,971 INFO L87 Difference]: Start difference. First operand 16837 states and 19048 transitions. Second operand has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:54:13,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:54:13,950 INFO L93 Difference]: Finished difference Result 42344 states and 47496 transitions. [2025-02-05 11:54:13,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:54:13,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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 686 [2025-02-05 11:54:13,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:54:13,983 INFO L225 Difference]: With dead ends: 42344 [2025-02-05 11:54:13,983 INFO L226 Difference]: Without dead ends: 19529 [2025-02-05 11:54:13,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:54:13,996 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 617 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1580 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 1998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 1580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:54:13,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 452 Invalid, 1998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 1580 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 11:54:14,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19529 states. [2025-02-05 11:54:14,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19529 to 16237. [2025-02-05 11:54:14,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16237 states, 16236 states have (on average 1.045331362404533) internal successors, (16972), 16236 states have internal predecessors, (16972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:54:14,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16237 states to 16237 states and 16972 transitions. [2025-02-05 11:54:14,192 INFO L78 Accepts]: Start accepts. Automaton has 16237 states and 16972 transitions. Word has length 686 [2025-02-05 11:54:14,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:54:14,193 INFO L471 AbstractCegarLoop]: Abstraction has 16237 states and 16972 transitions. [2025-02-05 11:54:14,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:54:14,193 INFO L276 IsEmpty]: Start isEmpty. Operand 16237 states and 16972 transitions. [2025-02-05 11:54:14,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2025-02-05 11:54:14,200 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:54:14,200 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:54:14,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 11:54:14,201 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:54:14,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:54:14,201 INFO L85 PathProgramCache]: Analyzing trace with hash 862654691, now seen corresponding path program 1 times [2025-02-05 11:54:14,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:54:14,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360304174] [2025-02-05 11:54:14,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:54:14,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:54:14,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 711 statements into 1 equivalence classes. [2025-02-05 11:54:14,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 711 of 711 statements. [2025-02-05 11:54:14,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:54:14,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:54:15,341 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 497 proven. 168 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2025-02-05 11:54:15,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:54:15,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360304174] [2025-02-05 11:54:15,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360304174] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:54:15,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588629791] [2025-02-05 11:54:15,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:54:15,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:54:15,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:54:15,344 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:54:15,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 11:54:15,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 711 statements into 1 equivalence classes. [2025-02-05 11:54:15,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 711 of 711 statements. [2025-02-05 11:54:15,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:54:15,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:54:15,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 845 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 11:54:15,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:54:15,935 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 497 proven. 202 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-02-05 11:54:15,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:54:16,472 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2025-02-05 11:54:16,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588629791] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 11:54:16,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 11:54:16,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 5] total 9 [2025-02-05 11:54:16,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053989200] [2025-02-05 11:54:16,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:54:16,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:54:16,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:54:16,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:54:16,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:54:16,474 INFO L87 Difference]: Start difference. First operand 16237 states and 16972 transitions. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:54:17,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:54:17,327 INFO L93 Difference]: Finished difference Result 35771 states and 37357 transitions. [2025-02-05 11:54:17,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:54:17,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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 711 [2025-02-05 11:54:17,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:54:17,346 INFO L225 Difference]: With dead ends: 35771 [2025-02-05 11:54:17,346 INFO L226 Difference]: Without dead ends: 19536 [2025-02-05 11:54:17,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1425 GetRequests, 1418 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:54:17,358 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 295 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:54:17,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 92 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:54:17,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19536 states. [2025-02-05 11:54:17,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19536 to 17733. [2025-02-05 11:54:17,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17733 states, 17732 states have (on average 1.0404917662982178) internal successors, (18450), 17732 states have internal predecessors, (18450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:54:17,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17733 states to 17733 states and 18450 transitions. [2025-02-05 11:54:17,484 INFO L78 Accepts]: Start accepts. Automaton has 17733 states and 18450 transitions. Word has length 711 [2025-02-05 11:54:17,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:54:17,485 INFO L471 AbstractCegarLoop]: Abstraction has 17733 states and 18450 transitions. [2025-02-05 11:54:17,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:54:17,485 INFO L276 IsEmpty]: Start isEmpty. Operand 17733 states and 18450 transitions. [2025-02-05 11:54:17,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 838 [2025-02-05 11:54:17,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:54:17,496 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:54:17,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 11:54:17,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:54:17,697 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:54:17,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:54:17,698 INFO L85 PathProgramCache]: Analyzing trace with hash 253376337, now seen corresponding path program 1 times [2025-02-05 11:54:17,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:54:17,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399802557] [2025-02-05 11:54:17,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:54:17,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:54:17,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 837 statements into 1 equivalence classes. [2025-02-05 11:54:17,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 837 of 837 statements. [2025-02-05 11:54:17,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:54:17,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:54:17,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1382 backedges. 747 proven. 0 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2025-02-05 11:54:17,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:54:17,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399802557] [2025-02-05 11:54:17,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399802557] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:54:17,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:54:17,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:54:17,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593202801] [2025-02-05 11:54:17,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:54:17,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:54:17,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:54:17,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:54:17,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:54:17,945 INFO L87 Difference]: Start difference. First operand 17733 states and 18450 transitions. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:54:18,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:54:18,807 INFO L93 Difference]: Finished difference Result 36956 states and 38464 transitions. [2025-02-05 11:54:18,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:54:18,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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 837 [2025-02-05 11:54:18,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:54:18,824 INFO L225 Difference]: With dead ends: 36956 [2025-02-05 11:54:18,825 INFO L226 Difference]: Without dead ends: 19524 [2025-02-05 11:54:18,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:54:18,835 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 342 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:54:18,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 456 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:54:18,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19524 states. [2025-02-05 11:54:18,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19524 to 14436. [2025-02-05 11:54:18,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14436 states, 14435 states have (on average 1.0431589885694492) internal successors, (15058), 14435 states have internal predecessors, (15058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:54:18,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14436 states to 14436 states and 15058 transitions. [2025-02-05 11:54:18,950 INFO L78 Accepts]: Start accepts. Automaton has 14436 states and 15058 transitions. Word has length 837 [2025-02-05 11:54:18,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:54:18,951 INFO L471 AbstractCegarLoop]: Abstraction has 14436 states and 15058 transitions. [2025-02-05 11:54:18,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:54:18,951 INFO L276 IsEmpty]: Start isEmpty. Operand 14436 states and 15058 transitions. [2025-02-05 11:54:18,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 876 [2025-02-05 11:54:18,961 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:54:18,962 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:54:18,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 11:54:18,963 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:54:18,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:54:18,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1660142265, now seen corresponding path program 1 times [2025-02-05 11:54:18,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:54:18,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098459735] [2025-02-05 11:54:18,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:54:18,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:54:19,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 875 statements into 1 equivalence classes. [2025-02-05 11:54:19,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 875 of 875 statements. [2025-02-05 11:54:19,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:54:19,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:54:19,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1435 backedges. 790 proven. 0 refuted. 0 times theorem prover too weak. 645 trivial. 0 not checked. [2025-02-05 11:54:19,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:54:19,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098459735] [2025-02-05 11:54:19,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098459735] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:54:19,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:54:19,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:54:19,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223798035] [2025-02-05 11:54:19,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:54:19,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:54:19,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:54:19,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:54:19,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:54:19,227 INFO L87 Difference]: Start difference. First operand 14436 states and 15058 transitions. Second operand has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:54:20,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:54:20,005 INFO L93 Difference]: Finished difference Result 30062 states and 31358 transitions. [2025-02-05 11:54:20,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:54:20,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 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 875 [2025-02-05 11:54:20,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:54:20,007 INFO L225 Difference]: With dead ends: 30062 [2025-02-05 11:54:20,007 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 11:54:20,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:54:20,022 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 132 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:54:20,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 496 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:54:20,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 11:54:20,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 11:54:20,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:54:20,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 11:54:20,023 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 875 [2025-02-05 11:54:20,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:54:20,023 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 11:54:20,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:54:20,024 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 11:54:20,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 11:54:20,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 11:54:20,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 11:54:20,032 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:54:20,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 11:54:22,439 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 11:54:22,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 11:54:22 BoogieIcfgContainer [2025-02-05 11:54:22,472 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 11:54:22,472 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 11:54:22,472 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 11:54:22,477 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 11:54:22,478 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:53:44" (3/4) ... [2025-02-05 11:54:22,479 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 11:54:22,503 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-02-05 11:54:22,505 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 11:54:22,506 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 11:54:22,508 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 11:54:22,656 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 11:54:22,656 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 11:54:22,656 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 11:54:22,657 INFO L158 Benchmark]: Toolchain (without parser) took 41391.19ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 106.3MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 348.9MB. Max. memory is 16.1GB. [2025-02-05 11:54:22,657 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 11:54:22,657 INFO L158 Benchmark]: CACSL2BoogieTranslator took 623.38ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 93.1MB in the end (delta: 13.3MB). Peak memory consumption was 81.1MB. Max. memory is 16.1GB. [2025-02-05 11:54:22,657 INFO L158 Benchmark]: Boogie Procedure Inliner took 209.83ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 55.8MB in the end (delta: 37.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-05 11:54:22,658 INFO L158 Benchmark]: Boogie Preprocessor took 275.12ms. Allocated memory is still 142.6MB. Free memory was 55.8MB in the beginning and 81.1MB in the end (delta: -25.2MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB. [2025-02-05 11:54:22,658 INFO L158 Benchmark]: IcfgBuilder took 2263.43ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 81.1MB in the beginning and 82.1MB in the end (delta: -1.0MB). Peak memory consumption was 150.4MB. Max. memory is 16.1GB. [2025-02-05 11:54:22,658 INFO L158 Benchmark]: TraceAbstraction took 37830.41ms. Allocated memory was 251.7MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 79.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 640.0MB. Max. memory is 16.1GB. [2025-02-05 11:54:22,659 INFO L158 Benchmark]: Witness Printer took 183.96ms. Allocated memory is still 1.7GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 11:54:22,660 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 623.38ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 93.1MB in the end (delta: 13.3MB). Peak memory consumption was 81.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 209.83ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 55.8MB in the end (delta: 37.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 275.12ms. Allocated memory is still 142.6MB. Free memory was 55.8MB in the beginning and 81.1MB in the end (delta: -25.2MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB. * IcfgBuilder took 2263.43ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 81.1MB in the beginning and 82.1MB in the end (delta: -1.0MB). Peak memory consumption was 150.4MB. Max. memory is 16.1GB. * TraceAbstraction took 37830.41ms. Allocated memory was 251.7MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 79.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 640.0MB. Max. memory is 16.1GB. * Witness Printer took 183.96ms. Allocated memory is still 1.7GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 212]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.3s, OverallIterations: 18, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 23.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5046 SdHoareTripleChecker+Valid, 22.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5046 mSDsluCounter, 7038 SdHoareTripleChecker+Invalid, 18.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 642 mSDsCounter, 3587 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16586 IncrementalHoareTripleChecker+Invalid, 20173 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3587 mSolverCounterUnsat, 6396 mSDtfsCounter, 16586 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2617 GetRequests, 2586 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17733occurred in iteration=16, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 18 MinimizatonAttempts, 20686 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 10853 NumberOfCodeBlocks, 10853 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 11542 ConstructedInterpolants, 0 QuantifiedInterpolants, 25172 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2256 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 22 InterpolantComputations, 18 PerfectInterpolantSequences, 13406/13854 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1776]: Location Invariant Derived location invariant: (((((((((((((((((((((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (3 == a2)) || ((((long long) 89 + a4) <= 0) && (0 <= ((long long) a29 + 143)))) || (((((long long) 42 + a4) <= 0) && (((long long) a0 + 147) <= 0)) && (5 <= a2))) || ((((2 == a2) && (0 <= ((long long) a4 + 85))) && (44 <= a29)) && (((long long) 98 + a0) <= 0))) || (((2 == a2) && (44 <= a29)) && (((long long) a0 + 147) <= 0))) || ((0 <= ((long long) 97 + a0)) && (((long long) 89 + a4) <= 0))) || (((((long long) 104 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85)))) || ((2 == a2) && (((long long) 89 + a4) <= 0))) || (((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (a2 == 1))) || ((((((long long) 104 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) 146 + a0))) && (0 <= ((long long) a29 + 143)))) || (((((long long) 42 + a4) <= 0) && (44 <= a29)) && (5 <= a2))) || (((0 <= ((long long) 97 + a0)) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a29 + 143)))) || ((((long long) 89 + a4) <= 0) && (((long long) a0 + 147) <= 0))) || (((((long long) a4 + 86) <= 0) && (3 == a2)) && (((long long) a0 + 61) <= 0))) || ((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (5 <= a2)) && (0 <= ((long long) a29 + 143)))) || (((2 == a2) && (0 <= ((long long) a0 + 60))) && (((long long) a4 + 86) <= 0))) || (((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85)))) || ((((long long) 89 + a4) <= 0) && (5 <= a2))) || ((a2 == 1) && (((long long) a4 + 86) <= 0))) RESULT: Ultimate proved your program to be correct! [2025-02-05 11:54:22,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE