./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label25.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem10_label25.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 699ecca4c05e82af9ddaf76f64fe18abd85263cf30f7f15e631a0ddff4b0faf4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:39:43,179 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:39:43,247 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:39:43,257 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:39:43,257 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:39:43,287 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:39:43,289 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:39:43,289 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:39:43,290 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:39:43,290 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:39:43,290 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:39:43,290 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:39:43,291 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:39:43,291 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:39:43,291 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:39:43,291 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:39:43,292 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:39:43,292 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:39:43,293 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:39:43,293 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:39:43,293 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:39:43,293 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:39:43,293 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:39:43,293 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:39:43,293 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:39:43,293 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:39:43,293 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:39:43,294 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:39:43,294 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:39:43,294 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:39:43,294 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:39:43,294 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:39:43,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:39:43,294 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:39:43,294 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:39:43,294 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:39:43,294 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:39:43,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:39:43,294 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:39:43,294 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:39:43,295 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:39:43,295 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:39:43,295 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:39:43,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:39:43,295 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:39:43,295 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:39:43,295 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:39:43,295 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:39:43,295 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 -> 699ecca4c05e82af9ddaf76f64fe18abd85263cf30f7f15e631a0ddff4b0faf4 [2025-01-08 23:39:43,598 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:39:43,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:39:43,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:39:43,613 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:39:43,614 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:39:43,615 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label25.c [2025-01-08 23:39:44,868 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2411bd7de/8c751103460041a88b8e09af6556377d/FLAG12facc602 [2025-01-08 23:39:45,236 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:39:45,237 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label25.c [2025-01-08 23:39:45,252 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2411bd7de/8c751103460041a88b8e09af6556377d/FLAG12facc602 [2025-01-08 23:39:45,274 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2411bd7de/8c751103460041a88b8e09af6556377d [2025-01-08 23:39:45,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:39:45,279 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:39:45,281 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:39:45,281 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:39:45,286 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:39:45,287 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:39:45" (1/1) ... [2025-01-08 23:39:45,288 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ed7a08d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:45, skipping insertion in model container [2025-01-08 23:39:45,288 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:39:45" (1/1) ... [2025-01-08 23:39:45,323 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:39:45,526 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/Problem10_label25.c[7284,7297] [2025-01-08 23:39:45,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:39:45,643 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:39:45,667 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/Problem10_label25.c[7284,7297] [2025-01-08 23:39:45,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:39:45,742 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:39:45,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:45 WrapperNode [2025-01-08 23:39:45,745 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:39:45,746 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:39:45,746 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:39:45,747 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:39:45,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:45" (1/1) ... [2025-01-08 23:39:45,769 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:45" (1/1) ... [2025-01-08 23:39:45,827 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 595 [2025-01-08 23:39:45,827 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:39:45,828 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:39:45,828 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:39:45,828 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:39:45,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:45" (1/1) ... [2025-01-08 23:39:45,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:45" (1/1) ... [2025-01-08 23:39:45,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:45" (1/1) ... [2025-01-08 23:39:45,882 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-08 23:39:45,882 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:45" (1/1) ... [2025-01-08 23:39:45,882 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:45" (1/1) ... [2025-01-08 23:39:45,914 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:45" (1/1) ... [2025-01-08 23:39:45,922 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:45" (1/1) ... [2025-01-08 23:39:45,934 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:45" (1/1) ... [2025-01-08 23:39:45,944 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:45" (1/1) ... [2025-01-08 23:39:45,952 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:45" (1/1) ... [2025-01-08 23:39:45,964 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:39:45,965 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:39:45,966 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:39:45,966 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:39:45,967 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:45" (1/1) ... [2025-01-08 23:39:45,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:39:45,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:39:45,999 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 23:39:46,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 23:39:46,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:39:46,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:39:46,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:39:46,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:39:46,077 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:39:46,078 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:39:47,161 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-01-08 23:39:47,162 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:39:47,176 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:39:47,176 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:39:47,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:39:47 BoogieIcfgContainer [2025-01-08 23:39:47,177 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:39:47,178 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:39:47,178 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:39:47,182 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:39:47,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:39:45" (1/3) ... [2025-01-08 23:39:47,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1603a5df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:39:47, skipping insertion in model container [2025-01-08 23:39:47,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:45" (2/3) ... [2025-01-08 23:39:47,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1603a5df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:39:47, skipping insertion in model container [2025-01-08 23:39:47,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:39:47" (3/3) ... [2025-01-08 23:39:47,185 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem10_label25.c [2025-01-08 23:39:47,198 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:39:47,200 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem10_label25.c that has 1 procedures, 206 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:39:47,258 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:39:47,269 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;@39c1353f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:39:47,269 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:39:47,274 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6813725490196079) internal successors, (343), 205 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:47,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-08 23:39:47,279 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:39:47,279 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] [2025-01-08 23:39:47,279 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:39:47,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:39:47,283 INFO L85 PathProgramCache]: Analyzing trace with hash -788531278, now seen corresponding path program 1 times [2025-01-08 23:39:47,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:39:47,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109260350] [2025-01-08 23:39:47,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:47,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:39:47,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-08 23:39:47,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-08 23:39:47,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:47,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:47,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:39:47,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:39:47,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109260350] [2025-01-08 23:39:47,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109260350] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:39:47,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:39:47,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:39:47,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872128220] [2025-01-08 23:39:47,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:39:47,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:39:47,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:39:47,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:39:47,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:39:47,735 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6813725490196079) internal successors, (343), 205 states have internal predecessors, (343), 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.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:48,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:39:48,561 INFO L93 Difference]: Finished difference Result 552 states and 963 transitions. [2025-01-08 23:39:48,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:39:48,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 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 64 [2025-01-08 23:39:48,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:39:48,573 INFO L225 Difference]: With dead ends: 552 [2025-01-08 23:39:48,574 INFO L226 Difference]: Without dead ends: 282 [2025-01-08 23:39:48,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:39:48,580 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 99 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:39:48,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 120 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:39:48,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-01-08 23:39:48,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2025-01-08 23:39:48,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.3416370106761566) internal successors, (377), 281 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:48,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 377 transitions. [2025-01-08 23:39:48,631 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 377 transitions. Word has length 64 [2025-01-08 23:39:48,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:39:48,632 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 377 transitions. [2025-01-08 23:39:48,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:48,632 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 377 transitions. [2025-01-08 23:39:48,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-08 23:39:48,637 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:39:48,637 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:39:48,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:39:48,638 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:39:48,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:39:48,638 INFO L85 PathProgramCache]: Analyzing trace with hash 810273054, now seen corresponding path program 1 times [2025-01-08 23:39:48,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:39:48,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898994106] [2025-01-08 23:39:48,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:48,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:39:48,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-08 23:39:48,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-08 23:39:48,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:48,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:49,015 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:39:49,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:39:49,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898994106] [2025-01-08 23:39:49,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898994106] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:39:49,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:39:49,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:39:49,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923929640] [2025-01-08 23:39:49,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:39:49,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:39:49,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:39:49,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:39:49,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:39:49,021 INFO L87 Difference]: Start difference. First operand 282 states and 377 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:49,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:39:49,558 INFO L93 Difference]: Finished difference Result 701 states and 967 transitions. [2025-01-08 23:39:49,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:39:49,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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 130 [2025-01-08 23:39:49,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:39:49,561 INFO L225 Difference]: With dead ends: 701 [2025-01-08 23:39:49,561 INFO L226 Difference]: Without dead ends: 421 [2025-01-08 23:39:49,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:39:49,563 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 82 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:39:49,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 215 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:39:49,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-01-08 23:39:49,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2025-01-08 23:39:49,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.2523809523809524) internal successors, (526), 420 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:49,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 526 transitions. [2025-01-08 23:39:49,580 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 526 transitions. Word has length 130 [2025-01-08 23:39:49,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:39:49,581 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 526 transitions. [2025-01-08 23:39:49,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:49,581 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 526 transitions. [2025-01-08 23:39:49,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-08 23:39:49,583 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:39:49,583 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:39:49,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:39:49,584 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:39:49,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:39:49,585 INFO L85 PathProgramCache]: Analyzing trace with hash -979118580, now seen corresponding path program 1 times [2025-01-08 23:39:49,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:39:49,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779145152] [2025-01-08 23:39:49,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:49,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:39:49,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-08 23:39:49,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-08 23:39:49,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:49,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:49,839 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:39:49,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:39:49,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779145152] [2025-01-08 23:39:49,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779145152] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:39:49,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:39:49,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:39:49,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169801730] [2025-01-08 23:39:49,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:39:49,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:39:49,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:39:49,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:39:49,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:39:49,845 INFO L87 Difference]: Start difference. First operand 421 states and 526 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:50,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:39:50,309 INFO L93 Difference]: Finished difference Result 979 states and 1209 transitions. [2025-01-08 23:39:50,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:39:50,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 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 137 [2025-01-08 23:39:50,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:39:50,313 INFO L225 Difference]: With dead ends: 979 [2025-01-08 23:39:50,313 INFO L226 Difference]: Without dead ends: 560 [2025-01-08 23:39:50,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:39:50,314 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 68 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:39:50,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 77 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:39:50,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-01-08 23:39:50,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2025-01-08 23:39:50,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.2075134168157424) internal successors, (675), 559 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:50,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 675 transitions. [2025-01-08 23:39:50,334 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 675 transitions. Word has length 137 [2025-01-08 23:39:50,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:39:50,334 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 675 transitions. [2025-01-08 23:39:50,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:50,335 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 675 transitions. [2025-01-08 23:39:50,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-08 23:39:50,336 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:39:50,337 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:39:50,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:39:50,337 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:39:50,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:39:50,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1435355431, now seen corresponding path program 1 times [2025-01-08 23:39:50,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:39:50,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196454274] [2025-01-08 23:39:50,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:50,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:39:50,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-08 23:39:50,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-08 23:39:50,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:50,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:50,792 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:39:50,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:39:50,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196454274] [2025-01-08 23:39:50,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196454274] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:39:50,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:39:50,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 23:39:50,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320469195] [2025-01-08 23:39:50,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:39:50,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 23:39:50,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:39:50,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 23:39:50,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:39:50,794 INFO L87 Difference]: Start difference. First operand 560 states and 675 transitions. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:51,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:39:51,335 INFO L93 Difference]: Finished difference Result 1034 states and 1254 transitions. [2025-01-08 23:39:51,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 23:39:51,336 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 6 states have internal predecessors, (139), 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 139 [2025-01-08 23:39:51,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:39:51,338 INFO L225 Difference]: With dead ends: 1034 [2025-01-08 23:39:51,338 INFO L226 Difference]: Without dead ends: 560 [2025-01-08 23:39:51,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:39:51,342 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:39:51,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 22 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:39:51,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-01-08 23:39:51,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2025-01-08 23:39:51,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.2021466905187836) internal successors, (672), 559 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:51,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 672 transitions. [2025-01-08 23:39:51,358 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 672 transitions. Word has length 139 [2025-01-08 23:39:51,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:39:51,359 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 672 transitions. [2025-01-08 23:39:51,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:51,359 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 672 transitions. [2025-01-08 23:39:51,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-08 23:39:51,361 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:39:51,361 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:39:51,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:39:51,361 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:39:51,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:39:51,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1764568577, now seen corresponding path program 1 times [2025-01-08 23:39:51,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:39:51,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574752979] [2025-01-08 23:39:51,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:51,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:39:51,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-08 23:39:51,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-08 23:39:51,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:51,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:51,498 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:39:51,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:39:51,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574752979] [2025-01-08 23:39:51,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574752979] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:39:51,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:39:51,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:39:51,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459206190] [2025-01-08 23:39:51,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:39:51,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:39:51,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:39:51,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:39:51,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:39:51,501 INFO L87 Difference]: Start difference. First operand 560 states and 672 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:51,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:39:51,976 INFO L93 Difference]: Finished difference Result 1257 states and 1566 transitions. [2025-01-08 23:39:51,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:39:51,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 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 155 [2025-01-08 23:39:51,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:39:51,981 INFO L225 Difference]: With dead ends: 1257 [2025-01-08 23:39:51,981 INFO L226 Difference]: Without dead ends: 838 [2025-01-08 23:39:51,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:39:51,983 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 87 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:39:51,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 34 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:39:51,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-01-08 23:39:52,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2025-01-08 23:39:52,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.1995221027479093) internal successors, (1004), 837 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:52,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1004 transitions. [2025-01-08 23:39:52,017 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1004 transitions. Word has length 155 [2025-01-08 23:39:52,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:39:52,018 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1004 transitions. [2025-01-08 23:39:52,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:52,019 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1004 transitions. [2025-01-08 23:39:52,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-08 23:39:52,021 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:39:52,022 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:39:52,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:39:52,022 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:39:52,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:39:52,023 INFO L85 PathProgramCache]: Analyzing trace with hash 323532045, now seen corresponding path program 1 times [2025-01-08 23:39:52,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:39:52,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681172785] [2025-01-08 23:39:52,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:52,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:39:52,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-08 23:39:52,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-08 23:39:52,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:52,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:52,347 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-08 23:39:52,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:39:52,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681172785] [2025-01-08 23:39:52,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681172785] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:39:52,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438963744] [2025-01-08 23:39:52,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:52,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:39:52,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:39:52,355 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:39:52,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 23:39:52,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-08 23:39:52,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-08 23:39:52,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:52,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:52,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:39:52,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:39:52,732 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-08 23:39:52,732 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:39:52,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438963744] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:39:52,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:39:52,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-01-08 23:39:52,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100908872] [2025-01-08 23:39:52,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:39:52,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:39:52,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:39:52,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:39:52,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:39:52,734 INFO L87 Difference]: Start difference. First operand 838 states and 1004 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:53,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:39:53,258 INFO L93 Difference]: Finished difference Result 1257 states and 1491 transitions. [2025-01-08 23:39:53,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:39:53,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 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 175 [2025-01-08 23:39:53,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:39:53,264 INFO L225 Difference]: With dead ends: 1257 [2025-01-08 23:39:53,265 INFO L226 Difference]: Without dead ends: 1255 [2025-01-08 23:39:53,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:39:53,267 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 69 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:39:53,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 11 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:39:53,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2025-01-08 23:39:53,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 977. [2025-01-08 23:39:53,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.2202868852459017) internal successors, (1191), 976 states have internal predecessors, (1191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:53,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1191 transitions. [2025-01-08 23:39:53,296 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1191 transitions. Word has length 175 [2025-01-08 23:39:53,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:39:53,296 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1191 transitions. [2025-01-08 23:39:53,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:53,297 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1191 transitions. [2025-01-08 23:39:53,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-01-08 23:39:53,300 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:39:53,301 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, 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-01-08 23:39:53,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 23:39:53,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:39:53,505 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:39:53,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:39:53,506 INFO L85 PathProgramCache]: Analyzing trace with hash 997628187, now seen corresponding path program 1 times [2025-01-08 23:39:53,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:39:53,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692599507] [2025-01-08 23:39:53,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:53,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:39:53,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-01-08 23:39:53,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-01-08 23:39:53,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:53,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:53,764 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:39:53,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:39:53,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692599507] [2025-01-08 23:39:53,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692599507] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:39:53,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:39:53,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:39:53,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205921641] [2025-01-08 23:39:53,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:39:53,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:39:53,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:39:53,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:39:53,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:39:53,767 INFO L87 Difference]: Start difference. First operand 977 states and 1191 transitions. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:54,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:39:54,259 INFO L93 Difference]: Finished difference Result 2091 states and 2614 transitions. [2025-01-08 23:39:54,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:39:54,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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 253 [2025-01-08 23:39:54,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:39:54,265 INFO L225 Difference]: With dead ends: 2091 [2025-01-08 23:39:54,265 INFO L226 Difference]: Without dead ends: 1255 [2025-01-08 23:39:54,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:39:54,267 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 76 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:39:54,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 189 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:39:54,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2025-01-08 23:39:54,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2025-01-08 23:39:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.1650717703349283) internal successors, (1461), 1254 states have internal predecessors, (1461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:54,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1461 transitions. [2025-01-08 23:39:54,296 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1461 transitions. Word has length 253 [2025-01-08 23:39:54,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:39:54,297 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1461 transitions. [2025-01-08 23:39:54,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:54,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1461 transitions. [2025-01-08 23:39:54,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-01-08 23:39:54,301 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:39:54,301 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:39:54,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:39:54,302 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:39:54,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:39:54,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1150008719, now seen corresponding path program 1 times [2025-01-08 23:39:54,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:39:54,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175754557] [2025-01-08 23:39:54,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:54,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:39:54,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-01-08 23:39:54,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-01-08 23:39:54,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:54,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:54,849 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 77 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:39:54,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:39:54,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175754557] [2025-01-08 23:39:54,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175754557] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:39:54,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097431325] [2025-01-08 23:39:54,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:54,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:39:54,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:39:54,853 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:39:54,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 23:39:54,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-01-08 23:39:54,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-01-08 23:39:54,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:54,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:54,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:39:54,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:39:55,080 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-01-08 23:39:55,081 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:39:55,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097431325] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:39:55,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:39:55,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-08 23:39:55,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006808612] [2025-01-08 23:39:55,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:39:55,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:39:55,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:39:55,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:39:55,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:39:55,083 INFO L87 Difference]: Start difference. First operand 1255 states and 1461 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:55,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:39:55,561 INFO L93 Difference]: Finished difference Result 1674 states and 1948 transitions. [2025-01-08 23:39:55,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:39:55,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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 312 [2025-01-08 23:39:55,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:39:55,568 INFO L225 Difference]: With dead ends: 1674 [2025-01-08 23:39:55,568 INFO L226 Difference]: Without dead ends: 1672 [2025-01-08 23:39:55,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:39:55,570 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 120 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:39:55,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 11 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:39:55,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2025-01-08 23:39:55,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1255. [2025-01-08 23:39:55,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.1650717703349283) internal successors, (1461), 1254 states have internal predecessors, (1461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:55,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1461 transitions. [2025-01-08 23:39:55,598 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1461 transitions. Word has length 312 [2025-01-08 23:39:55,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:39:55,599 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1461 transitions. [2025-01-08 23:39:55,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:55,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1461 transitions. [2025-01-08 23:39:55,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-01-08 23:39:55,603 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:39:55,603 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:39:55,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 23:39:55,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:39:55,804 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:39:55,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:39:55,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1879716895, now seen corresponding path program 1 times [2025-01-08 23:39:55,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:39:55,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594554778] [2025-01-08 23:39:55,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:55,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:39:55,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-01-08 23:39:55,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-01-08 23:39:55,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:55,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:56,110 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 335 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-01-08 23:39:56,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:39:56,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594554778] [2025-01-08 23:39:56,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594554778] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:39:56,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:39:56,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:39:56,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260671732] [2025-01-08 23:39:56,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:39:56,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:39:56,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:39:56,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:39:56,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:39:56,113 INFO L87 Difference]: Start difference. First operand 1255 states and 1461 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:56,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:39:56,597 INFO L93 Difference]: Finished difference Result 2647 states and 3154 transitions. [2025-01-08 23:39:56,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:39:56,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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 326 [2025-01-08 23:39:56,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:39:56,604 INFO L225 Difference]: With dead ends: 2647 [2025-01-08 23:39:56,604 INFO L226 Difference]: Without dead ends: 1533 [2025-01-08 23:39:56,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:39:56,606 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 63 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:39:56,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 215 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:39:56,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2025-01-08 23:39:56,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1394. [2025-01-08 23:39:56,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1393 states have (on average 1.1593682699210337) internal successors, (1615), 1393 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:56,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1615 transitions. [2025-01-08 23:39:56,645 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1615 transitions. Word has length 326 [2025-01-08 23:39:56,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:39:56,646 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 1615 transitions. [2025-01-08 23:39:56,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:56,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1615 transitions. [2025-01-08 23:39:56,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-01-08 23:39:56,652 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:39:56,653 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:39:56,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:39:56,653 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:39:56,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:39:56,654 INFO L85 PathProgramCache]: Analyzing trace with hash -490272474, now seen corresponding path program 1 times [2025-01-08 23:39:56,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:39:56,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184996749] [2025-01-08 23:39:56,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:56,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:39:56,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-01-08 23:39:56,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-01-08 23:39:56,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:56,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:56,964 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2025-01-08 23:39:56,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:39:56,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184996749] [2025-01-08 23:39:56,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184996749] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:39:56,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:39:56,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:39:56,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877869260] [2025-01-08 23:39:56,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:39:56,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:39:56,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:39:56,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:39:56,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:39:56,966 INFO L87 Difference]: Start difference. First operand 1394 states and 1615 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:57,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:39:57,477 INFO L93 Difference]: Finished difference Result 3759 states and 4365 transitions. [2025-01-08 23:39:57,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:39:57,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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 336 [2025-01-08 23:39:57,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:39:57,489 INFO L225 Difference]: With dead ends: 3759 [2025-01-08 23:39:57,490 INFO L226 Difference]: Without dead ends: 2506 [2025-01-08 23:39:57,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:39:57,492 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 80 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:39:57,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 51 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:39:57,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2025-01-08 23:39:57,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 1811. [2025-01-08 23:39:57,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1810 states have (on average 1.1414364640883978) internal successors, (2066), 1810 states have internal predecessors, (2066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:57,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2066 transitions. [2025-01-08 23:39:57,538 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2066 transitions. Word has length 336 [2025-01-08 23:39:57,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:39:57,538 INFO L471 AbstractCegarLoop]: Abstraction has 1811 states and 2066 transitions. [2025-01-08 23:39:57,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:57,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2066 transitions. [2025-01-08 23:39:57,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2025-01-08 23:39:57,546 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:39:57,546 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:39:57,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 23:39:57,546 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:39:57,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:39:57,548 INFO L85 PathProgramCache]: Analyzing trace with hash -2064461839, now seen corresponding path program 1 times [2025-01-08 23:39:57,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:39:57,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715985779] [2025-01-08 23:39:57,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:57,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:39:57,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-01-08 23:39:57,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-01-08 23:39:57,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:57,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:58,027 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2025-01-08 23:39:58,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:39:58,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715985779] [2025-01-08 23:39:58,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715985779] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:39:58,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:39:58,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:39:58,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218670067] [2025-01-08 23:39:58,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:39:58,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:39:58,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:39:58,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:39:58,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:39:58,030 INFO L87 Difference]: Start difference. First operand 1811 states and 2066 transitions. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:58,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:39:58,412 INFO L93 Difference]: Finished difference Result 3354 states and 3845 transitions. [2025-01-08 23:39:58,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:39:58,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 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 370 [2025-01-08 23:39:58,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:39:58,414 INFO L225 Difference]: With dead ends: 3354 [2025-01-08 23:39:58,414 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 23:39:58,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:39:58,419 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 93 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:39:58,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 12 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:39:58,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 23:39:58,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 23:39:58,420 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-01-08 23:39:58,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 23:39:58,421 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 370 [2025-01-08 23:39:58,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:39:58,422 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 23:39:58,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:58,422 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 23:39:58,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 23:39:58,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 23:39:58,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:39:58,429 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:39:58,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 23:39:58,671 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 23:39:58,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 11:39:58 BoogieIcfgContainer [2025-01-08 23:39:58,689 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 23:39:58,689 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 23:39:58,689 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 23:39:58,690 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 23:39:58,690 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:39:47" (3/4) ... [2025-01-08 23:39:58,693 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 23:39:58,713 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 23:39:58,715 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 23:39:58,715 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 23:39:58,716 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 23:39:58,844 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 23:39:58,845 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 23:39:58,845 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 23:39:58,846 INFO L158 Benchmark]: Toolchain (without parser) took 13566.82ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 110.6MB in the beginning and 101.8MB in the end (delta: 8.8MB). Peak memory consumption was 148.3MB. Max. memory is 16.1GB. [2025-01-08 23:39:58,847 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory was 124.3MB in the beginning and 124.0MB in the end (delta: 293.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 23:39:58,847 INFO L158 Benchmark]: CACSL2BoogieTranslator took 465.17ms. Allocated memory is still 142.6MB. Free memory was 110.6MB in the beginning and 83.6MB in the end (delta: 27.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-08 23:39:58,847 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.14ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 75.7MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 23:39:58,848 INFO L158 Benchmark]: Boogie Preprocessor took 135.91ms. Allocated memory is still 142.6MB. Free memory was 75.7MB in the beginning and 66.5MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 23:39:58,848 INFO L158 Benchmark]: RCFGBuilder took 1211.29ms. Allocated memory is still 142.6MB. Free memory was 66.1MB in the beginning and 101.3MB in the end (delta: -35.3MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. [2025-01-08 23:39:58,849 INFO L158 Benchmark]: TraceAbstraction took 11510.39ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 100.5MB in the beginning and 112.0MB in the end (delta: -11.6MB). Peak memory consumption was 132.0MB. Max. memory is 16.1GB. [2025-01-08 23:39:58,849 INFO L158 Benchmark]: Witness Printer took 155.62ms. Allocated memory is still 285.2MB. Free memory was 112.0MB in the beginning and 101.8MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 23:39:58,852 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.19ms. Allocated memory is still 201.3MB. Free memory was 124.3MB in the beginning and 124.0MB in the end (delta: 293.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 465.17ms. Allocated memory is still 142.6MB. Free memory was 110.6MB in the beginning and 83.6MB in the end (delta: 27.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.14ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 75.7MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 135.91ms. Allocated memory is still 142.6MB. Free memory was 75.7MB in the beginning and 66.5MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1211.29ms. Allocated memory is still 142.6MB. Free memory was 66.1MB in the beginning and 101.3MB in the end (delta: -35.3MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. * TraceAbstraction took 11510.39ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 100.5MB in the beginning and 112.0MB in the end (delta: -11.6MB). Peak memory consumption was 132.0MB. Max. memory is 16.1GB. * Witness Printer took 155.62ms. Allocated memory is still 285.2MB. Free memory was 112.0MB in the beginning and 101.8MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. 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: 206]: 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, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.2s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 979 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 979 mSDsluCounter, 957 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57 mSDsCounter, 607 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4409 IncrementalHoareTripleChecker+Invalid, 5016 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 607 mSolverCounterUnsat, 900 mSDtfsCounter, 4409 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 520 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1811occurred in iteration=10, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1529 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 2884 NumberOfCodeBlocks, 2884 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2871 ConstructedInterpolants, 0 QuantifiedInterpolants, 10601 SizeOfPredicates, 0 NumberOfNonLiveVariables, 671 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 2128/2309 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: 592]: Loop Invariant Derived loop invariant: ((((((((((a19 <= 9) && (8 <= a19)) && (14 == a4)) && (a12 == 0)) || ((((a19 <= 9) && (14 == a4)) && (a12 == 0)) && (a1 <= 33))) || ((((a19 <= 9) && (14 == a4)) && (a10 == 2)) && (a12 == 0))) || (((((a10 == 1) && (221 <= a1)) && (14 == a4)) && (a12 == 0)) && (7 == a19))) || ((((a19 <= 9) && (a10 == 3)) && (14 == a4)) && (a12 == 0))) || (((a10 <= 0) && (14 == a4)) && (a12 == 0))) || ((((a10 == 1) && (14 == a4)) && (a12 == 0)) && (9 <= a19))) RESULT: Ultimate proved your program to be correct! [2025-01-08 23:39:58,871 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