./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label32.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/Problem15_label32.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 492f3884ca52ad1e2a4bb1a7ea4174df881161f6f116a98f5375f793f3d1436b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:02:43,083 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:02:43,122 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:02:43,126 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:02:43,126 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:02:43,142 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:02:43,143 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:02:43,143 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:02:43,143 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:02:43,144 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:02:43,144 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:02:43,144 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:02:43,144 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:02:43,144 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:02:43,144 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:02:43,144 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:02:43,144 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:02:43,144 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:02:43,144 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:02:43,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:02:43,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:02:43,145 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:02:43,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:02:43,145 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:02:43,145 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:02:43,145 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:02:43,145 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:02:43,145 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:02:43,145 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:02:43,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:02:43,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:02:43,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:02:43,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:02:43,145 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:02:43,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:02:43,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:02:43,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:02:43,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:02:43,145 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:02:43,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:02:43,146 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:02:43,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:02:43,146 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:02:43,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:02:43,146 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:02:43,146 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:02:43,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:02:43,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:02:43,146 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 -> 492f3884ca52ad1e2a4bb1a7ea4174df881161f6f116a98f5375f793f3d1436b [2025-01-09 00:02:43,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:02:43,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:02:43,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:02:43,340 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:02:43,341 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:02:43,342 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label32.c [2025-01-09 00:02:44,523 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e6dfc1cb2/5e7ec9feb436475eaa7bf990f45dab35/FLAGa9fe3153c [2025-01-09 00:02:44,874 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:02:44,874 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label32.c [2025-01-09 00:02:44,891 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e6dfc1cb2/5e7ec9feb436475eaa7bf990f45dab35/FLAGa9fe3153c [2025-01-09 00:02:45,089 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e6dfc1cb2/5e7ec9feb436475eaa7bf990f45dab35 [2025-01-09 00:02:45,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:02:45,092 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:02:45,093 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:02:45,093 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:02:45,095 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:02:45,096 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:02:45" (1/1) ... [2025-01-09 00:02:45,097 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29188f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:02:45, skipping insertion in model container [2025-01-09 00:02:45,097 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:02:45" (1/1) ... [2025-01-09 00:02:45,133 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:02:45,296 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label32.c[6074,6087] [2025-01-09 00:02:45,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:02:45,626 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:02:45,644 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label32.c[6074,6087] [2025-01-09 00:02:45,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:02:45,807 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:02:45,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:02:45 WrapperNode [2025-01-09 00:02:45,809 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:02:45,810 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:02:45,810 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:02:45,810 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:02:45,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:02:45" (1/1) ... [2025-01-09 00:02:45,846 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:02:45" (1/1) ... [2025-01-09 00:02:45,976 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-01-09 00:02:45,976 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:02:45,977 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:02:45,977 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:02:45,977 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:02:45,985 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:02:45" (1/1) ... [2025-01-09 00:02:45,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:02:45" (1/1) ... [2025-01-09 00:02:46,015 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:02:45" (1/1) ... [2025-01-09 00:02:46,102 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 00:02:46,103 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:02:45" (1/1) ... [2025-01-09 00:02:46,103 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:02:45" (1/1) ... [2025-01-09 00:02:46,150 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:02:45" (1/1) ... [2025-01-09 00:02:46,158 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:02:45" (1/1) ... [2025-01-09 00:02:46,172 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:02:45" (1/1) ... [2025-01-09 00:02:46,187 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:02:45" (1/1) ... [2025-01-09 00:02:46,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:02:45" (1/1) ... [2025-01-09 00:02:46,244 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:02:46,246 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:02:46,246 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:02:46,246 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:02:46,247 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:02:45" (1/1) ... [2025-01-09 00:02:46,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:02:46,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:02:46,274 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 00:02:46,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 00:02:46,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:02:46,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:02:46,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:02:46,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:02:46,338 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:02:46,340 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:02:48,411 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-01-09 00:02:48,412 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:02:48,431 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:02:48,432 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:02:48,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:02:48 BoogieIcfgContainer [2025-01-09 00:02:48,432 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:02:48,434 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:02:48,434 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:02:48,439 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:02:48,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:02:45" (1/3) ... [2025-01-09 00:02:48,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4030009f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:02:48, skipping insertion in model container [2025-01-09 00:02:48,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:02:45" (2/3) ... [2025-01-09 00:02:48,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4030009f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:02:48, skipping insertion in model container [2025-01-09 00:02:48,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:02:48" (3/3) ... [2025-01-09 00:02:48,441 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label32.c [2025-01-09 00:02:48,454 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:02:48,456 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label32.c that has 1 procedures, 424 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:02:48,508 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:02:48,518 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;@2a861388, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:02:48,518 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:02:48,523 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:02:48,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 00:02:48,529 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:48,530 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] [2025-01-09 00:02:48,530 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:48,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:48,535 INFO L85 PathProgramCache]: Analyzing trace with hash -2007430668, now seen corresponding path program 1 times [2025-01-09 00:02:48,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:48,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28774811] [2025-01-09 00:02:48,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:48,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:48,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 00:02:48,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 00:02:48,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:48,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:48,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:02:48,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:48,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28774811] [2025-01-09 00:02:48,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28774811] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:48,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:48,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:02:48,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175489288] [2025-01-09 00:02:48,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:48,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:02:48,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:48,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:02:48,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:02:48,831 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:02:50,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:50,830 INFO L93 Difference]: Finished difference Result 1154 states and 2103 transitions. [2025-01-09 00:02:50,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:02:50,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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 49 [2025-01-09 00:02:50,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:50,845 INFO L225 Difference]: With dead ends: 1154 [2025-01-09 00:02:50,845 INFO L226 Difference]: Without dead ends: 665 [2025-01-09 00:02:50,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:02:50,851 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 272 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:50,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 384 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:02:50,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-01-09 00:02:50,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 663. [2025-01-09 00:02:50,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 662 states have (on average 1.4818731117824773) internal successors, (981), 662 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:02:50,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 981 transitions. [2025-01-09 00:02:50,914 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 981 transitions. Word has length 49 [2025-01-09 00:02:50,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:50,915 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 981 transitions. [2025-01-09 00:02:50,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:02:50,915 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 981 transitions. [2025-01-09 00:02:50,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 00:02:50,919 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:50,919 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:02:50,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:02:50,919 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:50,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:50,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1647326591, now seen corresponding path program 1 times [2025-01-09 00:02:50,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:50,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206945077] [2025-01-09 00:02:50,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:50,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:50,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 00:02:51,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 00:02:51,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:51,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:51,357 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:02:51,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:51,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206945077] [2025-01-09 00:02:51,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206945077] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:51,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:51,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:02:51,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197327801] [2025-01-09 00:02:51,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:51,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:02:51,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:51,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:02:51,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:02:51,360 INFO L87 Difference]: Start difference. First operand 663 states and 981 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:02:52,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:52,633 INFO L93 Difference]: Finished difference Result 1624 states and 2315 transitions. [2025-01-09 00:02:52,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:02:52,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 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 114 [2025-01-09 00:02:52,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:52,638 INFO L225 Difference]: With dead ends: 1624 [2025-01-09 00:02:52,638 INFO L226 Difference]: Without dead ends: 963 [2025-01-09 00:02:52,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:02:52,642 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 237 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:52,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 337 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:02:52,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-01-09 00:02:52,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2025-01-09 00:02:52,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 962 states have (on average 1.362785862785863) internal successors, (1311), 962 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:02:52,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1311 transitions. [2025-01-09 00:02:52,672 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1311 transitions. Word has length 114 [2025-01-09 00:02:52,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:52,672 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1311 transitions. [2025-01-09 00:02:52,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:02:52,673 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1311 transitions. [2025-01-09 00:02:52,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 00:02:52,674 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:52,674 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:02:52,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:02:52,674 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:52,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:52,678 INFO L85 PathProgramCache]: Analyzing trace with hash -139575383, now seen corresponding path program 1 times [2025-01-09 00:02:52,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:52,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721078257] [2025-01-09 00:02:52,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:52,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:52,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 00:02:52,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 00:02:52,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:52,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:52,849 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:02:52,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:52,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721078257] [2025-01-09 00:02:52,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721078257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:52,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:52,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:02:52,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880644068] [2025-01-09 00:02:52,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:52,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:02:52,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:52,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:02:52,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:02:52,850 INFO L87 Difference]: Start difference. First operand 963 states and 1311 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:02:54,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:54,122 INFO L93 Difference]: Finished difference Result 2229 states and 3186 transitions. [2025-01-09 00:02:54,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:02:54,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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 119 [2025-01-09 00:02:54,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:54,129 INFO L225 Difference]: With dead ends: 2229 [2025-01-09 00:02:54,130 INFO L226 Difference]: Without dead ends: 1567 [2025-01-09 00:02:54,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:02:54,134 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 256 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:54,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 318 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:02:54,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2025-01-09 00:02:54,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1266. [2025-01-09 00:02:54,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1265 states have (on average 1.3043478260869565) internal successors, (1650), 1265 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:02:54,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1650 transitions. [2025-01-09 00:02:54,161 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1650 transitions. Word has length 119 [2025-01-09 00:02:54,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:54,162 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1650 transitions. [2025-01-09 00:02:54,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:02:54,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1650 transitions. [2025-01-09 00:02:54,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-01-09 00:02:54,164 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:54,164 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:02:54,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:02:54,165 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:54,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:54,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1428089883, now seen corresponding path program 1 times [2025-01-09 00:02:54,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:54,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198770224] [2025-01-09 00:02:54,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:54,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:54,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-09 00:02:54,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-09 00:02:54,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:54,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:54,457 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:02:54,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:54,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198770224] [2025-01-09 00:02:54,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198770224] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:54,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:54,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:02:54,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326394265] [2025-01-09 00:02:54,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:54,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:02:54,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:54,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:02:54,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:02:54,460 INFO L87 Difference]: Start difference. First operand 1266 states and 1650 transitions. Second operand has 4 states, 4 states have (on average 53.75) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:02:56,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:56,890 INFO L93 Difference]: Finished difference Result 4670 states and 6170 transitions. [2025-01-09 00:02:56,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:02:56,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.75) internal successors, (215), 3 states have internal predecessors, (215), 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 215 [2025-01-09 00:02:56,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:56,904 INFO L225 Difference]: With dead ends: 4670 [2025-01-09 00:02:56,905 INFO L226 Difference]: Without dead ends: 3406 [2025-01-09 00:02:56,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:02:56,908 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 486 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2279 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 2548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 2279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:56,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 375 Invalid, 2548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 2279 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 00:02:56,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3406 states. [2025-01-09 00:02:56,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3406 to 3381. [2025-01-09 00:02:56,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3380 states have (on average 1.2366863905325445) internal successors, (4180), 3380 states have internal predecessors, (4180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:02:56,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4180 transitions. [2025-01-09 00:02:56,969 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4180 transitions. Word has length 215 [2025-01-09 00:02:56,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:56,970 INFO L471 AbstractCegarLoop]: Abstraction has 3381 states and 4180 transitions. [2025-01-09 00:02:56,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.75) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:02:56,971 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4180 transitions. [2025-01-09 00:02:56,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-01-09 00:02:56,975 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:56,975 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:02:56,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:02:56,976 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:56,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:56,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1941858513, now seen corresponding path program 1 times [2025-01-09 00:02:56,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:56,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298097458] [2025-01-09 00:02:56,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:56,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:57,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 00:02:57,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 00:02:57,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:57,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:57,177 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-01-09 00:02:57,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:57,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298097458] [2025-01-09 00:02:57,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298097458] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:57,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:57,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:02:57,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824167289] [2025-01-09 00:02:57,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:57,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:02:57,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:57,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:02:57,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:02:57,180 INFO L87 Difference]: Start difference. First operand 3381 states and 4180 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:02:58,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:58,435 INFO L93 Difference]: Finished difference Result 8563 states and 10754 transitions. [2025-01-09 00:02:58,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:02:58,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 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 219 [2025-01-09 00:02:58,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:58,452 INFO L225 Difference]: With dead ends: 8563 [2025-01-09 00:02:58,452 INFO L226 Difference]: Without dead ends: 5483 [2025-01-09 00:02:58,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:02:58,457 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:58,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 339 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:02:58,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2025-01-09 00:02:58,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 5478. [2025-01-09 00:02:58,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.16870549570933) internal successors, (6401), 5477 states have internal predecessors, (6401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:02:58,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6401 transitions. [2025-01-09 00:02:58,549 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6401 transitions. Word has length 219 [2025-01-09 00:02:58,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:58,549 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6401 transitions. [2025-01-09 00:02:58,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:02:58,550 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6401 transitions. [2025-01-09 00:02:58,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-01-09 00:02:58,553 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:58,554 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:02:58,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:02:58,554 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:58,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:58,555 INFO L85 PathProgramCache]: Analyzing trace with hash 626125287, now seen corresponding path program 1 times [2025-01-09 00:02:58,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:58,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754037208] [2025-01-09 00:02:58,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:58,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:58,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-01-09 00:02:58,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-01-09 00:02:58,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:58,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:59,210 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-01-09 00:02:59,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:59,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754037208] [2025-01-09 00:02:59,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754037208] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:59,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:59,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:02:59,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190274488] [2025-01-09 00:02:59,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:59,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:02:59,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:59,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:02:59,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:02:59,212 INFO L87 Difference]: Start difference. First operand 5478 states and 6401 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:00,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:00,299 INFO L93 Difference]: Finished difference Result 10655 states and 12489 transitions. [2025-01-09 00:03:00,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:00,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 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 321 [2025-01-09 00:03:00,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:00,311 INFO L225 Difference]: With dead ends: 10655 [2025-01-09 00:03:00,311 INFO L226 Difference]: Without dead ends: 5478 [2025-01-09 00:03:00,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:00,317 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:00,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:03:00,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5478 states. [2025-01-09 00:03:00,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5478 to 5478. [2025-01-09 00:03:00,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.1676100054774512) internal successors, (6395), 5477 states have internal predecessors, (6395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:00,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6395 transitions. [2025-01-09 00:03:00,379 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6395 transitions. Word has length 321 [2025-01-09 00:03:00,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:00,380 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6395 transitions. [2025-01-09 00:03:00,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:00,380 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6395 transitions. [2025-01-09 00:03:00,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-01-09 00:03:00,383 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:00,383 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:03:00,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:03:00,383 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:00,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:00,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1964791069, now seen corresponding path program 1 times [2025-01-09 00:03:00,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:00,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473918958] [2025-01-09 00:03:00,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:00,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:00,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-01-09 00:03:00,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-01-09 00:03:00,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:00,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:00,629 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-01-09 00:03:00,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:00,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473918958] [2025-01-09 00:03:00,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473918958] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:00,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:00,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:03:00,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166932050] [2025-01-09 00:03:00,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:00,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:00,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:00,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:00,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:00,632 INFO L87 Difference]: Start difference. First operand 5478 states and 6395 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:01,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:01,753 INFO L93 Difference]: Finished difference Result 11851 states and 14151 transitions. [2025-01-09 00:03:01,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:01,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 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-09 00:03:01,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:01,766 INFO L225 Difference]: With dead ends: 11851 [2025-01-09 00:03:01,766 INFO L226 Difference]: Without dead ends: 6674 [2025-01-09 00:03:01,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:01,773 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 266 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:01,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 323 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:03:01,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6674 states. [2025-01-09 00:03:01,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6674 to 4876. [2025-01-09 00:03:01,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4876 states, 4875 states have (on average 1.1805128205128206) internal successors, (5755), 4875 states have internal predecessors, (5755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:01,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4876 states to 4876 states and 5755 transitions. [2025-01-09 00:03:01,836 INFO L78 Accepts]: Start accepts. Automaton has 4876 states and 5755 transitions. Word has length 336 [2025-01-09 00:03:01,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:01,837 INFO L471 AbstractCegarLoop]: Abstraction has 4876 states and 5755 transitions. [2025-01-09 00:03:01,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:01,837 INFO L276 IsEmpty]: Start isEmpty. Operand 4876 states and 5755 transitions. [2025-01-09 00:03:01,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2025-01-09 00:03:01,841 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:01,841 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:03:01,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:03:01,842 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:01,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:01,842 INFO L85 PathProgramCache]: Analyzing trace with hash 2141660981, now seen corresponding path program 1 times [2025-01-09 00:03:01,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:01,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817852405] [2025-01-09 00:03:01,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:01,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:01,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 395 statements into 1 equivalence classes. [2025-01-09 00:03:01,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 395 of 395 statements. [2025-01-09 00:03:01,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:01,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:02,833 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 93 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:03:02,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:02,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817852405] [2025-01-09 00:03:02,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817852405] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:03:02,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296361063] [2025-01-09 00:03:02,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:02,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:03:02,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:03:02,837 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:03:02,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 00:03:02,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 395 statements into 1 equivalence classes. [2025-01-09 00:03:02,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 395 of 395 statements. [2025-01-09 00:03:02,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:02,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:02,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:03:02,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:03:03,142 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:03:03,142 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:03:03,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296361063] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:03,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:03:03,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-09 00:03:03,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222370295] [2025-01-09 00:03:03,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:03,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:03,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:03,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:03,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:03:03,144 INFO L87 Difference]: Start difference. First operand 4876 states and 5755 transitions. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:04,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:04,579 INFO L93 Difference]: Finished difference Result 11855 states and 14250 transitions. [2025-01-09 00:03:04,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:04,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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 395 [2025-01-09 00:03:04,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:04,596 INFO L225 Difference]: With dead ends: 11855 [2025-01-09 00:03:04,597 INFO L226 Difference]: Without dead ends: 7280 [2025-01-09 00:03:04,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:03:04,602 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 249 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:04,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 344 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:03:04,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7280 states. [2025-01-09 00:03:04,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7280 to 6679. [2025-01-09 00:03:04,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6679 states, 6678 states have (on average 1.1647199760407307) internal successors, (7778), 6678 states have internal predecessors, (7778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:04,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6679 states to 6679 states and 7778 transitions. [2025-01-09 00:03:04,686 INFO L78 Accepts]: Start accepts. Automaton has 6679 states and 7778 transitions. Word has length 395 [2025-01-09 00:03:04,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:04,687 INFO L471 AbstractCegarLoop]: Abstraction has 6679 states and 7778 transitions. [2025-01-09 00:03:04,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:04,687 INFO L276 IsEmpty]: Start isEmpty. Operand 6679 states and 7778 transitions. [2025-01-09 00:03:04,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2025-01-09 00:03:04,692 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:04,693 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:03:04,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 00:03:04,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:03:04,894 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:04,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:04,894 INFO L85 PathProgramCache]: Analyzing trace with hash 735018977, now seen corresponding path program 1 times [2025-01-09 00:03:04,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:04,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155862822] [2025-01-09 00:03:04,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:04,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:04,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-01-09 00:03:04,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-01-09 00:03:04,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:04,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:05,410 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 295 proven. 39 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-01-09 00:03:05,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:05,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155862822] [2025-01-09 00:03:05,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155862822] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:03:05,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204793117] [2025-01-09 00:03:05,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:05,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:03:05,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:03:05,418 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:03:05,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 00:03:05,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-01-09 00:03:05,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-01-09 00:03:05,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:05,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:05,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 00:03:05,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:03:06,296 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 295 proven. 39 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-01-09 00:03:06,296 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:03:06,968 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 295 proven. 39 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-01-09 00:03:06,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204793117] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:03:06,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:03:06,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-01-09 00:03:06,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308084199] [2025-01-09 00:03:06,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:03:06,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 00:03:06,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:06,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 00:03:06,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 00:03:06,973 INFO L87 Difference]: Start difference. First operand 6679 states and 7778 transitions. Second operand has 9 states, 9 states have (on average 72.66666666666667) internal successors, (654), 8 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:12,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:12,165 INFO L93 Difference]: Finished difference Result 19597 states and 22611 transitions. [2025-01-09 00:03:12,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 00:03:12,165 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 72.66666666666667) internal successors, (654), 8 states have internal predecessors, (654), 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 412 [2025-01-09 00:03:12,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:12,181 INFO L225 Difference]: With dead ends: 19597 [2025-01-09 00:03:12,181 INFO L226 Difference]: Without dead ends: 7876 [2025-01-09 00:03:12,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 833 GetRequests, 819 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2025-01-09 00:03:12,188 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 2891 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 6381 mSolverCounterSat, 658 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2891 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 7039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 658 IncrementalHoareTripleChecker+Valid, 6381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:12,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2891 Valid, 318 Invalid, 7039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [658 Valid, 6381 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-01-09 00:03:12,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7876 states. [2025-01-09 00:03:12,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7876 to 6976. [2025-01-09 00:03:12,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6976 states, 6975 states have (on average 1.1105376344086022) internal successors, (7746), 6975 states have internal predecessors, (7746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:12,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6976 states to 6976 states and 7746 transitions. [2025-01-09 00:03:12,266 INFO L78 Accepts]: Start accepts. Automaton has 6976 states and 7746 transitions. Word has length 412 [2025-01-09 00:03:12,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:12,266 INFO L471 AbstractCegarLoop]: Abstraction has 6976 states and 7746 transitions. [2025-01-09 00:03:12,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 72.66666666666667) internal successors, (654), 8 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:12,268 INFO L276 IsEmpty]: Start isEmpty. Operand 6976 states and 7746 transitions. [2025-01-09 00:03:12,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-01-09 00:03:12,269 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:12,270 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:03:12,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 00:03:12,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:03:12,474 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:12,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:12,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1910826080, now seen corresponding path program 1 times [2025-01-09 00:03:12,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:12,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738989859] [2025-01-09 00:03:12,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:12,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:12,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-01-09 00:03:12,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-01-09 00:03:12,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:12,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:12,865 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-01-09 00:03:12,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:12,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738989859] [2025-01-09 00:03:12,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738989859] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:12,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:12,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:03:12,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047889893] [2025-01-09 00:03:12,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:12,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:12,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:12,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:12,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:12,868 INFO L87 Difference]: Start difference. First operand 6976 states and 7746 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:13,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:13,754 INFO L93 Difference]: Finished difference Result 15446 states and 17263 transitions. [2025-01-09 00:03:13,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:13,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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 426 [2025-01-09 00:03:13,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:13,775 INFO L225 Difference]: With dead ends: 15446 [2025-01-09 00:03:13,776 INFO L226 Difference]: Without dead ends: 8472 [2025-01-09 00:03:13,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:13,783 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 277 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:13,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 553 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:03:13,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8472 states. [2025-01-09 00:03:13,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8472 to 8171. [2025-01-09 00:03:13,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8171 states, 8170 states have (on average 1.088984088127295) internal successors, (8897), 8170 states have internal predecessors, (8897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:13,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8171 states to 8171 states and 8897 transitions. [2025-01-09 00:03:13,851 INFO L78 Accepts]: Start accepts. Automaton has 8171 states and 8897 transitions. Word has length 426 [2025-01-09 00:03:13,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:13,853 INFO L471 AbstractCegarLoop]: Abstraction has 8171 states and 8897 transitions. [2025-01-09 00:03:13,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:13,853 INFO L276 IsEmpty]: Start isEmpty. Operand 8171 states and 8897 transitions. [2025-01-09 00:03:13,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2025-01-09 00:03:13,855 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:13,856 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:03:13,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:03:13,856 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:13,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:13,857 INFO L85 PathProgramCache]: Analyzing trace with hash 2143890104, now seen corresponding path program 1 times [2025-01-09 00:03:13,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:13,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619833362] [2025-01-09 00:03:13,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:13,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:13,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 523 statements into 1 equivalence classes. [2025-01-09 00:03:13,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 523 of 523 statements. [2025-01-09 00:03:13,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:13,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:14,099 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2025-01-09 00:03:14,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:14,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619833362] [2025-01-09 00:03:14,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619833362] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:14,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:14,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:03:14,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566775859] [2025-01-09 00:03:14,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:14,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:14,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:14,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:14,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:14,102 INFO L87 Difference]: Start difference. First operand 8171 states and 8897 transitions. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:14,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:14,931 INFO L93 Difference]: Finished difference Result 18731 states and 20550 transitions. [2025-01-09 00:03:14,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:14,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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 523 [2025-01-09 00:03:14,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:14,953 INFO L225 Difference]: With dead ends: 18731 [2025-01-09 00:03:14,953 INFO L226 Difference]: Without dead ends: 10562 [2025-01-09 00:03:14,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:14,963 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 281 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:14,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 205 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:03:14,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10562 states. [2025-01-09 00:03:15,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10562 to 9963. [2025-01-09 00:03:15,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9963 states, 9962 states have (on average 1.0847219433848625) internal successors, (10806), 9962 states have internal predecessors, (10806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:15,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9963 states to 9963 states and 10806 transitions. [2025-01-09 00:03:15,098 INFO L78 Accepts]: Start accepts. Automaton has 9963 states and 10806 transitions. Word has length 523 [2025-01-09 00:03:15,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:15,098 INFO L471 AbstractCegarLoop]: Abstraction has 9963 states and 10806 transitions. [2025-01-09 00:03:15,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:15,099 INFO L276 IsEmpty]: Start isEmpty. Operand 9963 states and 10806 transitions. [2025-01-09 00:03:15,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 551 [2025-01-09 00:03:15,101 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:15,102 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:03:15,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:03:15,102 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:15,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:15,103 INFO L85 PathProgramCache]: Analyzing trace with hash -157658985, now seen corresponding path program 1 times [2025-01-09 00:03:15,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:15,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006359323] [2025-01-09 00:03:15,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:15,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:15,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 550 statements into 1 equivalence classes. [2025-01-09 00:03:15,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 550 of 550 statements. [2025-01-09 00:03:15,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:15,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:15,363 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2025-01-09 00:03:15,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:15,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006359323] [2025-01-09 00:03:15,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006359323] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:15,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:15,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:03:15,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334786798] [2025-01-09 00:03:15,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:15,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:15,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:15,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:15,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:15,366 INFO L87 Difference]: Start difference. First operand 9963 states and 10806 transitions. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:16,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:16,044 INFO L93 Difference]: Finished difference Result 19922 states and 21652 transitions. [2025-01-09 00:03:16,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:16,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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 550 [2025-01-09 00:03:16,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:16,055 INFO L225 Difference]: With dead ends: 19922 [2025-01-09 00:03:16,055 INFO L226 Difference]: Without dead ends: 10260 [2025-01-09 00:03:16,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:16,064 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 437 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:16,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 69 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:03:16,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10260 states. [2025-01-09 00:03:16,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10260 to 9961. [2025-01-09 00:03:16,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9961 states, 9960 states have (on average 1.0845381526104418) internal successors, (10802), 9960 states have internal predecessors, (10802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:16,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9961 states to 9961 states and 10802 transitions. [2025-01-09 00:03:16,171 INFO L78 Accepts]: Start accepts. Automaton has 9961 states and 10802 transitions. Word has length 550 [2025-01-09 00:03:16,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:16,171 INFO L471 AbstractCegarLoop]: Abstraction has 9961 states and 10802 transitions. [2025-01-09 00:03:16,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:16,171 INFO L276 IsEmpty]: Start isEmpty. Operand 9961 states and 10802 transitions. [2025-01-09 00:03:16,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-01-09 00:03:16,175 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:16,175 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:03:16,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:03:16,175 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:16,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:16,176 INFO L85 PathProgramCache]: Analyzing trace with hash 345853806, now seen corresponding path program 1 times [2025-01-09 00:03:16,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:16,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430829431] [2025-01-09 00:03:16,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:16,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:16,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-01-09 00:03:16,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-01-09 00:03:16,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:16,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:16,496 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 396 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-01-09 00:03:16,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:16,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430829431] [2025-01-09 00:03:16,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430829431] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:16,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:16,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:03:16,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893326385] [2025-01-09 00:03:16,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:16,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:16,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:16,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:16,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:16,499 INFO L87 Difference]: Start difference. First operand 9961 states and 10802 transitions. Second operand has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:17,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:17,261 INFO L93 Difference]: Finished difference Result 22611 states and 24594 transitions. [2025-01-09 00:03:17,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:17,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 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 576 [2025-01-09 00:03:17,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:17,310 INFO L225 Difference]: With dead ends: 22611 [2025-01-09 00:03:17,311 INFO L226 Difference]: Without dead ends: 12951 [2025-01-09 00:03:17,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:17,326 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 199 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:17,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 174 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:03:17,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12951 states. [2025-01-09 00:03:17,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12951 to 12054. [2025-01-09 00:03:17,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12054 states, 12053 states have (on average 1.0858707375757073) internal successors, (13088), 12053 states have internal predecessors, (13088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:17,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12054 states to 12054 states and 13088 transitions. [2025-01-09 00:03:17,492 INFO L78 Accepts]: Start accepts. Automaton has 12054 states and 13088 transitions. Word has length 576 [2025-01-09 00:03:17,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:17,492 INFO L471 AbstractCegarLoop]: Abstraction has 12054 states and 13088 transitions. [2025-01-09 00:03:17,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:17,492 INFO L276 IsEmpty]: Start isEmpty. Operand 12054 states and 13088 transitions. [2025-01-09 00:03:17,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2025-01-09 00:03:17,496 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:17,497 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:03:17,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 00:03:17,497 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:17,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:17,498 INFO L85 PathProgramCache]: Analyzing trace with hash -992217779, now seen corresponding path program 1 times [2025-01-09 00:03:17,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:17,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777807121] [2025-01-09 00:03:17,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:17,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:17,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 584 statements into 1 equivalence classes. [2025-01-09 00:03:17,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 584 of 584 statements. [2025-01-09 00:03:17,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:17,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:17,798 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-01-09 00:03:17,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:17,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777807121] [2025-01-09 00:03:17,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777807121] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:17,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:17,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:03:17,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881487339] [2025-01-09 00:03:17,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:17,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:17,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:17,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:17,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:17,802 INFO L87 Difference]: Start difference. First operand 12054 states and 13088 transitions. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:18,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:18,567 INFO L93 Difference]: Finished difference Result 26199 states and 28551 transitions. [2025-01-09 00:03:18,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:18,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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 584 [2025-01-09 00:03:18,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:18,581 INFO L225 Difference]: With dead ends: 26199 [2025-01-09 00:03:18,581 INFO L226 Difference]: Without dead ends: 14147 [2025-01-09 00:03:18,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:18,589 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 271 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:18,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 531 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:03:18,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14147 states. [2025-01-09 00:03:18,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14147 to 13848. [2025-01-09 00:03:18,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13848 states, 13847 states have (on average 1.0728677691918826) internal successors, (14856), 13847 states have internal predecessors, (14856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:18,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13848 states to 13848 states and 14856 transitions. [2025-01-09 00:03:18,751 INFO L78 Accepts]: Start accepts. Automaton has 13848 states and 14856 transitions. Word has length 584 [2025-01-09 00:03:18,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:18,751 INFO L471 AbstractCegarLoop]: Abstraction has 13848 states and 14856 transitions. [2025-01-09 00:03:18,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:18,752 INFO L276 IsEmpty]: Start isEmpty. Operand 13848 states and 14856 transitions. [2025-01-09 00:03:18,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2025-01-09 00:03:18,757 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:18,758 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:03:18,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 00:03:18,758 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:18,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:18,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1941985965, now seen corresponding path program 1 times [2025-01-09 00:03:18,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:18,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031968495] [2025-01-09 00:03:18,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:18,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:18,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 587 statements into 1 equivalence classes. [2025-01-09 00:03:18,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 587 of 587 statements. [2025-01-09 00:03:18,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:18,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:19,177 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2025-01-09 00:03:19,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:19,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031968495] [2025-01-09 00:03:19,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031968495] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:19,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:19,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:03:19,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981959346] [2025-01-09 00:03:19,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:19,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:19,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:19,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:19,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:19,179 INFO L87 Difference]: Start difference. First operand 13848 states and 14856 transitions. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:19,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:19,944 INFO L93 Difference]: Finished difference Result 32198 states and 34624 transitions. [2025-01-09 00:03:19,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:19,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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 587 [2025-01-09 00:03:19,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:19,959 INFO L225 Difference]: With dead ends: 32198 [2025-01-09 00:03:19,959 INFO L226 Difference]: Without dead ends: 18352 [2025-01-09 00:03:19,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:19,969 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 280 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:19,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 514 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:03:19,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18352 states. [2025-01-09 00:03:20,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18352 to 18038. [2025-01-09 00:03:20,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18038 states, 18037 states have (on average 1.0684149248766424) internal successors, (19271), 18037 states have internal predecessors, (19271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:20,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18038 states to 18038 states and 19271 transitions. [2025-01-09 00:03:20,102 INFO L78 Accepts]: Start accepts. Automaton has 18038 states and 19271 transitions. Word has length 587 [2025-01-09 00:03:20,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:20,103 INFO L471 AbstractCegarLoop]: Abstraction has 18038 states and 19271 transitions. [2025-01-09 00:03:20,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:20,103 INFO L276 IsEmpty]: Start isEmpty. Operand 18038 states and 19271 transitions. [2025-01-09 00:03:20,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-01-09 00:03:20,106 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:20,107 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:03:20,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:03:20,107 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:20,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:20,107 INFO L85 PathProgramCache]: Analyzing trace with hash 684813129, now seen corresponding path program 1 times [2025-01-09 00:03:20,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:20,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506218210] [2025-01-09 00:03:20,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:20,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:20,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-01-09 00:03:20,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-01-09 00:03:20,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:20,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:20,735 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 142 proven. 220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:03:20,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:20,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506218210] [2025-01-09 00:03:20,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506218210] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:03:20,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883989947] [2025-01-09 00:03:20,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:20,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:03:20,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:03:20,738 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:03:20,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 00:03:20,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-01-09 00:03:20,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-01-09 00:03:20,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:20,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:20,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:03:20,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:03:21,139 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:03:21,139 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:03:21,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883989947] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:21,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:03:21,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-09 00:03:21,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824792320] [2025-01-09 00:03:21,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:21,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:21,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:21,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:21,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:03:21,142 INFO L87 Difference]: Start difference. First operand 18038 states and 19271 transitions. Second operand has 3 states, 3 states have (on average 198.0) internal successors, (594), 3 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:21,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:21,752 INFO L93 Difference]: Finished difference Result 35777 states and 38242 transitions. [2025-01-09 00:03:21,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:21,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 198.0) internal successors, (594), 3 states have internal predecessors, (594), 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 594 [2025-01-09 00:03:21,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:21,767 INFO L225 Difference]: With dead ends: 35777 [2025-01-09 00:03:21,767 INFO L226 Difference]: Without dead ends: 18040 [2025-01-09 00:03:21,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 594 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:03:21,778 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 105 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:21,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 397 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 00:03:21,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18040 states. [2025-01-09 00:03:21,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18040 to 18035. [2025-01-09 00:03:21,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18035 states, 18034 states have (on average 1.0591660197404902) internal successors, (19101), 18034 states have internal predecessors, (19101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:21,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18035 states to 18035 states and 19101 transitions. [2025-01-09 00:03:21,910 INFO L78 Accepts]: Start accepts. Automaton has 18035 states and 19101 transitions. Word has length 594 [2025-01-09 00:03:21,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:21,910 INFO L471 AbstractCegarLoop]: Abstraction has 18035 states and 19101 transitions. [2025-01-09 00:03:21,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.0) internal successors, (594), 3 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:21,910 INFO L276 IsEmpty]: Start isEmpty. Operand 18035 states and 19101 transitions. [2025-01-09 00:03:21,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2025-01-09 00:03:21,915 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:21,915 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:03:21,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 00:03:22,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:03:22,116 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:22,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:22,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1663598098, now seen corresponding path program 1 times [2025-01-09 00:03:22,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:22,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821458142] [2025-01-09 00:03:22,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:22,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:22,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 670 statements into 1 equivalence classes. [2025-01-09 00:03:22,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 670 of 670 statements. [2025-01-09 00:03:22,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:22,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:22,513 INFO L134 CoverageAnalysis]: Checked inductivity of 863 backedges. 529 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2025-01-09 00:03:22,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:22,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821458142] [2025-01-09 00:03:22,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821458142] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:22,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:22,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:03:22,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526537975] [2025-01-09 00:03:22,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:22,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:03:22,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:22,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:03:22,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:03:22,515 INFO L87 Difference]: Start difference. First operand 18035 states and 19101 transitions. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:23,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:23,713 INFO L93 Difference]: Finished difference Result 38461 states and 40711 transitions. [2025-01-09 00:03:23,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:03:23,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 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 670 [2025-01-09 00:03:23,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:23,742 INFO L225 Difference]: With dead ends: 38461 [2025-01-09 00:03:23,742 INFO L226 Difference]: Without dead ends: 20727 [2025-01-09 00:03:23,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:03:23,758 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 584 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1731 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 1904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:23,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 430 Invalid, 1904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1731 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:03:23,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20727 states. [2025-01-09 00:03:23,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20727 to 20126. [2025-01-09 00:03:23,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20126 states, 20125 states have (on average 1.0488944099378883) internal successors, (21109), 20125 states have internal predecessors, (21109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:23,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20126 states to 20126 states and 21109 transitions. [2025-01-09 00:03:23,932 INFO L78 Accepts]: Start accepts. Automaton has 20126 states and 21109 transitions. Word has length 670 [2025-01-09 00:03:23,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:23,932 INFO L471 AbstractCegarLoop]: Abstraction has 20126 states and 21109 transitions. [2025-01-09 00:03:23,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:23,932 INFO L276 IsEmpty]: Start isEmpty. Operand 20126 states and 21109 transitions. [2025-01-09 00:03:23,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 675 [2025-01-09 00:03:23,938 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:23,938 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:03:23,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 00:03:23,938 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:23,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:23,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1380198428, now seen corresponding path program 1 times [2025-01-09 00:03:23,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:23,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659511233] [2025-01-09 00:03:23,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:23,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:23,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 674 statements into 1 equivalence classes. [2025-01-09 00:03:24,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 674 of 674 statements. [2025-01-09 00:03:24,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:24,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:24,510 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2025-01-09 00:03:24,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:24,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659511233] [2025-01-09 00:03:24,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659511233] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:24,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:24,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:03:24,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54710618] [2025-01-09 00:03:24,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:24,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:24,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:24,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:24,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:24,512 INFO L87 Difference]: Start difference. First operand 20126 states and 21109 transitions. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:25,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:25,523 INFO L93 Difference]: Finished difference Result 42641 states and 44807 transitions. [2025-01-09 00:03:25,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:25,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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 674 [2025-01-09 00:03:25,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:25,552 INFO L225 Difference]: With dead ends: 42641 [2025-01-09 00:03:25,552 INFO L226 Difference]: Without dead ends: 22517 [2025-01-09 00:03:25,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:25,563 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 314 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:25,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 136 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:03:25,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22517 states. [2025-01-09 00:03:25,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22517 to 22218. [2025-01-09 00:03:25,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22218 states, 22217 states have (on average 1.048296349642166) internal successors, (23290), 22217 states have internal predecessors, (23290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:25,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22218 states to 22218 states and 23290 transitions. [2025-01-09 00:03:25,752 INFO L78 Accepts]: Start accepts. Automaton has 22218 states and 23290 transitions. Word has length 674 [2025-01-09 00:03:25,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:25,753 INFO L471 AbstractCegarLoop]: Abstraction has 22218 states and 23290 transitions. [2025-01-09 00:03:25,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:25,753 INFO L276 IsEmpty]: Start isEmpty. Operand 22218 states and 23290 transitions. [2025-01-09 00:03:25,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2025-01-09 00:03:25,759 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:25,759 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:03:25,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 00:03:25,760 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:25,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:25,760 INFO L85 PathProgramCache]: Analyzing trace with hash 199686414, now seen corresponding path program 1 times [2025-01-09 00:03:25,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:25,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961864383] [2025-01-09 00:03:25,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:25,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:25,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 695 statements into 1 equivalence classes. [2025-01-09 00:03:25,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 695 of 695 statements. [2025-01-09 00:03:25,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:25,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:26,603 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 465 proven. 188 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-01-09 00:03:26,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:26,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961864383] [2025-01-09 00:03:26,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961864383] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:03:26,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515286561] [2025-01-09 00:03:26,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:26,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:03:26,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:03:26,606 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:03:26,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 00:03:26,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 695 statements into 1 equivalence classes. [2025-01-09 00:03:26,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 695 of 695 statements. [2025-01-09 00:03:26,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:26,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:26,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 830 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 00:03:26,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:03:27,179 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 465 proven. 170 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-01-09 00:03:27,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:03:27,827 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2025-01-09 00:03:27,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515286561] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:03:27,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:03:27,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 5] total 9 [2025-01-09 00:03:27,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636268619] [2025-01-09 00:03:27,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:27,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:27,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:27,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:27,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 00:03:27,829 INFO L87 Difference]: Start difference. First operand 22218 states and 23290 transitions. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:28,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:28,946 INFO L93 Difference]: Finished difference Result 47728 states and 50033 transitions. [2025-01-09 00:03:28,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:28,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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 695 [2025-01-09 00:03:28,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:28,981 INFO L225 Difference]: With dead ends: 47728 [2025-01-09 00:03:28,981 INFO L226 Difference]: Without dead ends: 25512 [2025-01-09 00:03:28,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1392 GetRequests, 1385 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 00:03:28,997 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 292 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:28,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 432 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:03:29,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25512 states. [2025-01-09 00:03:29,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25512 to 20716. [2025-01-09 00:03:29,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20716 states, 20715 states have (on average 1.04407434226406) internal successors, (21628), 20715 states have internal predecessors, (21628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:29,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20716 states to 20716 states and 21628 transitions. [2025-01-09 00:03:29,233 INFO L78 Accepts]: Start accepts. Automaton has 20716 states and 21628 transitions. Word has length 695 [2025-01-09 00:03:29,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:29,234 INFO L471 AbstractCegarLoop]: Abstraction has 20716 states and 21628 transitions. [2025-01-09 00:03:29,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:29,234 INFO L276 IsEmpty]: Start isEmpty. Operand 20716 states and 21628 transitions. [2025-01-09 00:03:29,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2025-01-09 00:03:29,240 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:29,240 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:03:29,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 00:03:29,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:03:29,441 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:29,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:29,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1389742518, now seen corresponding path program 1 times [2025-01-09 00:03:29,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:29,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075377035] [2025-01-09 00:03:29,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:29,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:29,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 709 statements into 1 equivalence classes. [2025-01-09 00:03:29,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 709 of 709 statements. [2025-01-09 00:03:29,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:29,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:29,802 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 617 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-01-09 00:03:29,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:29,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075377035] [2025-01-09 00:03:29,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075377035] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:29,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:29,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:03:29,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934661105] [2025-01-09 00:03:29,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:29,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:29,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:29,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:29,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:29,804 INFO L87 Difference]: Start difference. First operand 20716 states and 21628 transitions. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:30,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:30,602 INFO L93 Difference]: Finished difference Result 41131 states and 42953 transitions. [2025-01-09 00:03:30,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:30,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 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 709 [2025-01-09 00:03:30,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:30,624 INFO L225 Difference]: With dead ends: 41131 [2025-01-09 00:03:30,624 INFO L226 Difference]: Without dead ends: 20716 [2025-01-09 00:03:30,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:30,639 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 238 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:30,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 500 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:03:30,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20716 states. [2025-01-09 00:03:30,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20716 to 20118. [2025-01-09 00:03:30,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20118 states, 20117 states have (on average 1.0333051647860019) internal successors, (20787), 20117 states have internal predecessors, (20787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:30,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20118 states to 20118 states and 20787 transitions. [2025-01-09 00:03:30,813 INFO L78 Accepts]: Start accepts. Automaton has 20118 states and 20787 transitions. Word has length 709 [2025-01-09 00:03:30,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:30,813 INFO L471 AbstractCegarLoop]: Abstraction has 20118 states and 20787 transitions. [2025-01-09 00:03:30,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:30,813 INFO L276 IsEmpty]: Start isEmpty. Operand 20118 states and 20787 transitions. [2025-01-09 00:03:30,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2025-01-09 00:03:30,819 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:30,819 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:03:30,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 00:03:30,819 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:30,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:30,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1147444568, now seen corresponding path program 1 times [2025-01-09 00:03:30,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:30,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048896416] [2025-01-09 00:03:30,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:30,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:30,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 710 statements into 1 equivalence classes. [2025-01-09 00:03:30,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 710 of 710 statements. [2025-01-09 00:03:30,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:30,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:31,177 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2025-01-09 00:03:31,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:31,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048896416] [2025-01-09 00:03:31,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048896416] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:31,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:31,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:03:31,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188621313] [2025-01-09 00:03:31,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:31,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:31,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:31,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:31,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:31,179 INFO L87 Difference]: Start difference. First operand 20118 states and 20787 transitions. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:32,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:32,070 INFO L93 Difference]: Finished difference Result 45630 states and 47173 transitions. [2025-01-09 00:03:32,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:32,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 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 710 [2025-01-09 00:03:32,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:32,099 INFO L225 Difference]: With dead ends: 45630 [2025-01-09 00:03:32,099 INFO L226 Difference]: Without dead ends: 25813 [2025-01-09 00:03:32,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:32,116 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 347 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:32,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 119 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:03:32,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25813 states. [2025-01-09 00:03:32,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25813 to 22209. [2025-01-09 00:03:32,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22209 states, 22208 states have (on average 1.0333663544668588) internal successors, (22949), 22208 states have internal predecessors, (22949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:32,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22209 states to 22209 states and 22949 transitions. [2025-01-09 00:03:32,332 INFO L78 Accepts]: Start accepts. Automaton has 22209 states and 22949 transitions. Word has length 710 [2025-01-09 00:03:32,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:32,333 INFO L471 AbstractCegarLoop]: Abstraction has 22209 states and 22949 transitions. [2025-01-09 00:03:32,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:32,333 INFO L276 IsEmpty]: Start isEmpty. Operand 22209 states and 22949 transitions. [2025-01-09 00:03:32,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 741 [2025-01-09 00:03:32,340 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:32,340 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:03:32,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 00:03:32,340 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:32,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:32,341 INFO L85 PathProgramCache]: Analyzing trace with hash 37022887, now seen corresponding path program 1 times [2025-01-09 00:03:32,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:32,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803113506] [2025-01-09 00:03:32,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:32,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:32,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 740 statements into 1 equivalence classes. [2025-01-09 00:03:32,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 740 of 740 statements. [2025-01-09 00:03:32,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:32,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:33,128 INFO L134 CoverageAnalysis]: Checked inductivity of 913 backedges. 551 proven. 188 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-01-09 00:03:33,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:33,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803113506] [2025-01-09 00:03:33,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803113506] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:03:33,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664680854] [2025-01-09 00:03:33,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:33,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:03:33,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:03:33,135 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:03:33,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 00:03:33,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 740 statements into 1 equivalence classes. [2025-01-09 00:03:33,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 740 of 740 statements. [2025-01-09 00:03:33,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:33,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:33,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 878 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 00:03:33,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:03:33,638 INFO L134 CoverageAnalysis]: Checked inductivity of 913 backedges. 566 proven. 0 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2025-01-09 00:03:33,638 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:03:33,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664680854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:33,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:03:33,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-01-09 00:03:33,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072237083] [2025-01-09 00:03:33,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:33,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:03:33,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:33,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:03:33,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:03:33,640 INFO L87 Difference]: Start difference. First operand 22209 states and 22949 transitions. Second operand has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:34,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:34,932 INFO L93 Difference]: Finished difference Result 51011 states and 52684 transitions. [2025-01-09 00:03:34,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:03:34,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 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 740 [2025-01-09 00:03:34,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:34,988 INFO L225 Difference]: With dead ends: 51011 [2025-01-09 00:03:34,989 INFO L226 Difference]: Without dead ends: 29103 [2025-01-09 00:03:34,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 743 GetRequests, 738 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:03:34,998 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 505 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1514 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 1514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:34,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 135 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 1514 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:03:35,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29103 states. [2025-01-09 00:03:35,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29103 to 27306. [2025-01-09 00:03:35,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27306 states, 27305 states have (on average 1.032631386193005) internal successors, (28196), 27305 states have internal predecessors, (28196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:35,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27306 states to 27306 states and 28196 transitions. [2025-01-09 00:03:35,330 INFO L78 Accepts]: Start accepts. Automaton has 27306 states and 28196 transitions. Word has length 740 [2025-01-09 00:03:35,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:35,331 INFO L471 AbstractCegarLoop]: Abstraction has 27306 states and 28196 transitions. [2025-01-09 00:03:35,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:35,331 INFO L276 IsEmpty]: Start isEmpty. Operand 27306 states and 28196 transitions. [2025-01-09 00:03:35,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 753 [2025-01-09 00:03:35,344 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:35,344 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:03:35,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 00:03:35,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-01-09 00:03:35,545 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:35,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:35,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1936447708, now seen corresponding path program 1 times [2025-01-09 00:03:35,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:35,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053108502] [2025-01-09 00:03:35,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:35,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:35,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 752 statements into 1 equivalence classes. [2025-01-09 00:03:35,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 752 of 752 statements. [2025-01-09 00:03:35,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:35,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:35,797 INFO L134 CoverageAnalysis]: Checked inductivity of 945 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2025-01-09 00:03:35,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:35,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053108502] [2025-01-09 00:03:35,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053108502] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:35,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:35,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:03:35,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347807412] [2025-01-09 00:03:35,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:35,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:35,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:35,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:35,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:35,798 INFO L87 Difference]: Start difference. First operand 27306 states and 28196 transitions. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:36,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:36,475 INFO L93 Difference]: Finished difference Result 47697 states and 49203 transitions. [2025-01-09 00:03:36,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:36,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 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 752 [2025-01-09 00:03:36,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:36,499 INFO L225 Difference]: With dead ends: 47697 [2025-01-09 00:03:36,499 INFO L226 Difference]: Without dead ends: 20692 [2025-01-09 00:03:36,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:36,517 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 336 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:36,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 382 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 00:03:36,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20692 states. [2025-01-09 00:03:36,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20692 to 17101. [2025-01-09 00:03:36,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17101 states, 17100 states have (on average 1.0285380116959064) internal successors, (17588), 17100 states have internal predecessors, (17588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:36,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17101 states to 17101 states and 17588 transitions. [2025-01-09 00:03:36,674 INFO L78 Accepts]: Start accepts. Automaton has 17101 states and 17588 transitions. Word has length 752 [2025-01-09 00:03:36,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:36,674 INFO L471 AbstractCegarLoop]: Abstraction has 17101 states and 17588 transitions. [2025-01-09 00:03:36,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:36,675 INFO L276 IsEmpty]: Start isEmpty. Operand 17101 states and 17588 transitions. [2025-01-09 00:03:36,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2025-01-09 00:03:36,683 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:36,683 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:03:36,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 00:03:36,683 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:36,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:36,684 INFO L85 PathProgramCache]: Analyzing trace with hash 496509448, now seen corresponding path program 1 times [2025-01-09 00:03:36,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:36,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966398013] [2025-01-09 00:03:36,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:36,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:36,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 829 statements into 1 equivalence classes. [2025-01-09 00:03:36,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 829 of 829 statements. [2025-01-09 00:03:36,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:36,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:37,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 546 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2025-01-09 00:03:37,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:37,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966398013] [2025-01-09 00:03:37,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966398013] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:37,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:37,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:03:37,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295411027] [2025-01-09 00:03:37,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:37,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:37,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:37,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:37,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:37,014 INFO L87 Difference]: Start difference. First operand 17101 states and 17588 transitions. Second operand has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:37,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:37,626 INFO L93 Difference]: Finished difference Result 33899 states and 34849 transitions. [2025-01-09 00:03:37,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:37,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 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 829 [2025-01-09 00:03:37,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:37,646 INFO L225 Difference]: With dead ends: 33899 [2025-01-09 00:03:37,646 INFO L226 Difference]: Without dead ends: 17099 [2025-01-09 00:03:37,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:37,659 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 310 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:37,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 425 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 00:03:37,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17099 states. [2025-01-09 00:03:37,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17099 to 16800. [2025-01-09 00:03:37,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16800 states, 16799 states have (on average 1.027263527590928) internal successors, (17257), 16799 states have internal predecessors, (17257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:37,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16800 states to 16800 states and 17257 transitions. [2025-01-09 00:03:37,794 INFO L78 Accepts]: Start accepts. Automaton has 16800 states and 17257 transitions. Word has length 829 [2025-01-09 00:03:37,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:37,794 INFO L471 AbstractCegarLoop]: Abstraction has 16800 states and 17257 transitions. [2025-01-09 00:03:37,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:37,795 INFO L276 IsEmpty]: Start isEmpty. Operand 16800 states and 17257 transitions. [2025-01-09 00:03:37,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 958 [2025-01-09 00:03:37,805 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:37,806 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:03:37,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 00:03:37,806 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:37,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:37,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1467378946, now seen corresponding path program 1 times [2025-01-09 00:03:37,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:37,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386205192] [2025-01-09 00:03:37,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:37,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:37,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 957 statements into 1 equivalence classes. [2025-01-09 00:03:37,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 957 of 957 statements. [2025-01-09 00:03:37,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:37,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:38,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1605 backedges. 1003 proven. 0 refuted. 0 times theorem prover too weak. 602 trivial. 0 not checked. [2025-01-09 00:03:38,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:38,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386205192] [2025-01-09 00:03:38,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386205192] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:38,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:38,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:03:38,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592369793] [2025-01-09 00:03:38,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:38,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:03:38,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:38,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:03:38,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:03:38,633 INFO L87 Difference]: Start difference. First operand 16800 states and 17257 transitions. Second operand has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:39,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:39,632 INFO L93 Difference]: Finished difference Result 21599 states and 22178 transitions. [2025-01-09 00:03:39,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:03:39,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 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 957 [2025-01-09 00:03:39,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:39,660 INFO L225 Difference]: With dead ends: 21599 [2025-01-09 00:03:39,660 INFO L226 Difference]: Without dead ends: 21597 [2025-01-09 00:03:39,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:03:39,668 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 467 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1407 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:39,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 74 Invalid, 1502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1407 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:03:39,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21597 states. [2025-01-09 00:03:39,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21597 to 15002. [2025-01-09 00:03:39,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15002 states, 15001 states have (on average 1.0270648623425105) internal successors, (15407), 15001 states have internal predecessors, (15407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:39,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15002 states to 15002 states and 15407 transitions. [2025-01-09 00:03:39,823 INFO L78 Accepts]: Start accepts. Automaton has 15002 states and 15407 transitions. Word has length 957 [2025-01-09 00:03:39,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:39,823 INFO L471 AbstractCegarLoop]: Abstraction has 15002 states and 15407 transitions. [2025-01-09 00:03:39,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:39,823 INFO L276 IsEmpty]: Start isEmpty. Operand 15002 states and 15407 transitions. [2025-01-09 00:03:39,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1044 [2025-01-09 00:03:39,834 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:39,834 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:03:39,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 00:03:39,834 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:39,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:39,835 INFO L85 PathProgramCache]: Analyzing trace with hash 133120937, now seen corresponding path program 1 times [2025-01-09 00:03:39,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:39,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189665404] [2025-01-09 00:03:39,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:39,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:39,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1043 statements into 1 equivalence classes. [2025-01-09 00:03:39,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1043 of 1043 statements. [2025-01-09 00:03:39,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:39,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:40,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1928 backedges. 833 proven. 0 refuted. 0 times theorem prover too weak. 1095 trivial. 0 not checked. [2025-01-09 00:03:40,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:40,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189665404] [2025-01-09 00:03:40,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189665404] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:40,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:40,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:03:40,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659717972] [2025-01-09 00:03:40,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:40,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:40,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:40,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:40,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:40,446 INFO L87 Difference]: Start difference. First operand 15002 states and 15407 transitions. Second operand has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:41,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:41,066 INFO L93 Difference]: Finished difference Result 33001 states and 33888 transitions. [2025-01-09 00:03:41,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:41,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 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 1043 [2025-01-09 00:03:41,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:41,090 INFO L225 Difference]: With dead ends: 33001 [2025-01-09 00:03:41,090 INFO L226 Difference]: Without dead ends: 18300 [2025-01-09 00:03:41,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:41,102 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 167 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:41,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 415 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 00:03:41,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18300 states. [2025-01-09 00:03:41,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18300 to 16497. [2025-01-09 00:03:41,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16497 states, 16496 states have (on average 1.025885063045587) internal successors, (16923), 16496 states have internal predecessors, (16923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:41,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16497 states to 16497 states and 16923 transitions. [2025-01-09 00:03:41,256 INFO L78 Accepts]: Start accepts. Automaton has 16497 states and 16923 transitions. Word has length 1043 [2025-01-09 00:03:41,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:41,257 INFO L471 AbstractCegarLoop]: Abstraction has 16497 states and 16923 transitions. [2025-01-09 00:03:41,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:41,257 INFO L276 IsEmpty]: Start isEmpty. Operand 16497 states and 16923 transitions. [2025-01-09 00:03:41,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1128 [2025-01-09 00:03:41,269 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:41,270 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:03:41,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 00:03:41,270 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:41,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:41,271 INFO L85 PathProgramCache]: Analyzing trace with hash 2107753352, now seen corresponding path program 1 times [2025-01-09 00:03:41,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:41,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928496311] [2025-01-09 00:03:41,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:41,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:41,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1127 statements into 1 equivalence classes. [2025-01-09 00:03:41,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1127 of 1127 statements. [2025-01-09 00:03:41,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:41,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:42,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2394 backedges. 94 proven. 1121 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2025-01-09 00:03:42,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:42,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928496311] [2025-01-09 00:03:42,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928496311] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:03:42,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847358286] [2025-01-09 00:03:42,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:42,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:03:42,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:03:42,698 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:03:42,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 00:03:42,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1127 statements into 1 equivalence classes. [2025-01-09 00:03:42,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1127 of 1127 statements. [2025-01-09 00:03:42,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:42,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:42,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 1303 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:03:42,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:03:46,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2394 backedges. 94 proven. 1121 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2025-01-09 00:03:46,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:03:48,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2394 backedges. 94 proven. 1121 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2025-01-09 00:03:48,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847358286] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:03:48,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:03:48,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-09 00:03:48,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911802101] [2025-01-09 00:03:48,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:03:48,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 00:03:48,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:48,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 00:03:48,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 00:03:48,952 INFO L87 Difference]: Start difference. First operand 16497 states and 16923 transitions. Second operand has 10 states, 10 states have (on average 114.6) internal successors, (1146), 9 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:51,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:51,336 INFO L93 Difference]: Finished difference Result 29685 states and 30431 transitions. [2025-01-09 00:03:51,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 00:03:51,336 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 114.6) internal successors, (1146), 9 states have internal predecessors, (1146), 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 1127 [2025-01-09 00:03:51,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:51,365 INFO L225 Difference]: With dead ends: 29685 [2025-01-09 00:03:51,365 INFO L226 Difference]: Without dead ends: 29683 [2025-01-09 00:03:51,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2263 GetRequests, 2248 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2025-01-09 00:03:51,371 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 2344 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 3007 mSolverCounterSat, 411 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2344 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 3418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 411 IncrementalHoareTripleChecker+Valid, 3007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:51,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2344 Valid, 114 Invalid, 3418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [411 Valid, 3007 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 00:03:51,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29683 states. [2025-01-09 00:03:51,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29683 to 14998. [2025-01-09 00:03:51,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14998 states, 14997 states have (on average 1.0258718410348737) internal successors, (15385), 14997 states have internal predecessors, (15385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:51,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14998 states to 14998 states and 15385 transitions. [2025-01-09 00:03:51,544 INFO L78 Accepts]: Start accepts. Automaton has 14998 states and 15385 transitions. Word has length 1127 [2025-01-09 00:03:51,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:51,544 INFO L471 AbstractCegarLoop]: Abstraction has 14998 states and 15385 transitions. [2025-01-09 00:03:51,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 114.6) internal successors, (1146), 9 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:51,544 INFO L276 IsEmpty]: Start isEmpty. Operand 14998 states and 15385 transitions. [2025-01-09 00:03:51,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1268 [2025-01-09 00:03:51,556 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:51,557 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:03:51,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 00:03:51,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-01-09 00:03:51,757 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:51,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:51,758 INFO L85 PathProgramCache]: Analyzing trace with hash -680312870, now seen corresponding path program 1 times [2025-01-09 00:03:51,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:51,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537523191] [2025-01-09 00:03:51,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:51,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:51,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1267 statements into 1 equivalence classes. [2025-01-09 00:03:51,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1267 of 1267 statements. [2025-01-09 00:03:51,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:51,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:52,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2571 backedges. 1682 proven. 0 refuted. 0 times theorem prover too weak. 889 trivial. 0 not checked. [2025-01-09 00:03:52,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:52,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537523191] [2025-01-09 00:03:52,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537523191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:52,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:52,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:03:52,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552290556] [2025-01-09 00:03:52,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:52,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:52,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:52,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:52,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:52,294 INFO L87 Difference]: Start difference. First operand 14998 states and 15385 transitions. Second operand has 3 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:52,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:52,867 INFO L93 Difference]: Finished difference Result 28492 states and 29243 transitions. [2025-01-09 00:03:52,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:52,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 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 1267 [2025-01-09 00:03:52,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:52,868 INFO L225 Difference]: With dead ends: 28492 [2025-01-09 00:03:52,868 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 00:03:52,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:52,878 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 24 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:52,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 415 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 00:03:52,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 00:03:52,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 00:03:52,878 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-09 00:03:52,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 00:03:52,878 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1267 [2025-01-09 00:03:52,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:52,879 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 00:03:52,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:52,879 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 00:03:52,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 00:03:52,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 00:03:52,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 00:03:52,885 INFO L422 BasicCegarLoop]: Path program 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] [2025-01-09 00:03:52,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 00:03:59,127 WARN L286 SmtUtils]: Spent 6.24s on a formula simplification. DAG size of input: 515 DAG size of output: 569 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-01-09 00:04:01,576 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 00:04:01,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:04:01 BoogieIcfgContainer [2025-01-09 00:04:01,622 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 00:04:01,622 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 00:04:01,622 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 00:04:01,623 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 00:04:01,623 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:02:48" (3/4) ... [2025-01-09 00:04:01,625 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 00:04:01,652 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-09 00:04:01,654 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 00:04:01,655 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 00:04:01,657 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 00:04:01,808 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 00:04:01,809 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 00:04:01,809 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 00:04:01,810 INFO L158 Benchmark]: Toolchain (without parser) took 76717.88ms. Allocated memory was 142.6MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 107.0MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 587.2MB. Max. memory is 16.1GB. [2025-01-09 00:04:01,810 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory was 124.0MB in the beginning and 123.7MB in the end (delta: 293.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:04:01,810 INFO L158 Benchmark]: CACSL2BoogieTranslator took 716.78ms. Allocated memory is still 142.6MB. Free memory was 107.0MB in the beginning and 95.1MB in the end (delta: 12.0MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. [2025-01-09 00:04:01,810 INFO L158 Benchmark]: Boogie Procedure Inliner took 166.57ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 57.8MB in the end (delta: 37.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-09 00:04:01,811 INFO L158 Benchmark]: Boogie Preprocessor took 267.34ms. Allocated memory is still 142.6MB. Free memory was 57.8MB in the beginning and 82.0MB in the end (delta: -24.2MB). Peak memory consumption was 43.6MB. Max. memory is 16.1GB. [2025-01-09 00:04:01,811 INFO L158 Benchmark]: RCFGBuilder took 2186.62ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 82.0MB in the beginning and 76.8MB in the end (delta: 5.2MB). Peak memory consumption was 151.3MB. Max. memory is 16.1GB. [2025-01-09 00:04:01,811 INFO L158 Benchmark]: TraceAbstraction took 73187.53ms. Allocated memory was 251.7MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 76.8MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-01-09 00:04:01,811 INFO L158 Benchmark]: Witness Printer took 186.65ms. Allocated memory is still 1.9GB. Free memory was 1.3GB in the beginning and 1.2GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 00:04:01,812 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.22ms. Allocated memory is still 201.3MB. Free memory was 124.0MB in the beginning and 123.7MB in the end (delta: 293.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 716.78ms. Allocated memory is still 142.6MB. Free memory was 107.0MB in the beginning and 95.1MB in the end (delta: 12.0MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 166.57ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 57.8MB in the end (delta: 37.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 267.34ms. Allocated memory is still 142.6MB. Free memory was 57.8MB in the beginning and 82.0MB in the end (delta: -24.2MB). Peak memory consumption was 43.6MB. Max. memory is 16.1GB. * RCFGBuilder took 2186.62ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 82.0MB in the beginning and 76.8MB in the end (delta: 5.2MB). Peak memory consumption was 151.3MB. Max. memory is 16.1GB. * TraceAbstraction took 73187.53ms. Allocated memory was 251.7MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 76.8MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 186.65ms. Allocated memory is still 1.9GB. Free memory was 1.3GB in the beginning and 1.2GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 164]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 64.4s, OverallIterations: 28, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 35.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12797 SdHoareTripleChecker+Valid, 31.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12797 mSDsluCounter, 9117 SdHoareTripleChecker+Invalid, 26.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1172 mSDsCounter, 4638 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33841 IncrementalHoareTripleChecker+Invalid, 38479 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4638 mSolverCounterUnsat, 7945 mSDtfsCounter, 33841 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6293 GetRequests, 6219 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27306occurred in iteration=22, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 28 MinimizatonAttempts, 45014 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 20.6s InterpolantComputationTime, 20156 NumberOfCodeBlocks, 20156 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 22353 ConstructedInterpolants, 234 QuantifiedInterpolants, 96618 SizeOfPredicates, 5 NumberOfNonLiveVariables, 4712 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 37 InterpolantComputations, 26 PerfectInterpolantSequences, 24013/28334 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1776]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((long long) 89 + a4) <= 0) && (a2 != 4)) && (((long long) a0 + 61) <= 0)) || (((0 <= ((long long) a29 + 15)) && (((long long) 89 + a4) <= 0)) && (((long long) a0 + 61) <= 0))) || ((((2 == a2) && (0 <= ((long long) a29 + 15))) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 600001 + a0)))) || (((((((long long) 42 + a4) <= 0) && (((long long) a0 + 147) <= 0)) && ((((((long long) 2 + a0) >= 0) ? (((long long) 2 + a0) % 5) : ((((long long) 2 + a0) % 5) + 5)) != 0) || (0 < (98 + ((((long long) 600067 + a0) >= 0) ? (((long long) 600067 + a0) / 5) : ((((long long) 600067 + a0) / 5) - 1)))))) && (0 <= (98 + ((((long long) 600067 + a0) >= 0) ? (((long long) 600067 + a0) / 5) : ((((long long) 600067 + a0) / 5) - 1))))) && (3 == a2))) || ((((((0 <= ((long long) a0 + 599997)) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a29 + 15))) && (a2 == 1)) && ((((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) >= 0) ? ((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) : (((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) - 1)) <= 600556)) && (a29 <= 43))) || ((((((long long) 42 + a4) <= 0) && (((long long) a0 + 147) <= 0)) && (a2 == 4)) && (0 <= ((long long) 600001 + a0)))) || (((((2 == a2) && (0 <= ((long long) a29 + 15))) && (((long long) a0 + 147) <= 0)) && ((((((long long) 2 + a0) >= 0) ? (((long long) 2 + a0) % 5) : ((((long long) 2 + a0) % 5) + 5)) != 0) || (0 < (98 + ((((long long) 600067 + a0) >= 0) ? (((long long) 600067 + a0) / 5) : ((((long long) 600067 + a0) / 5) - 1)))))) && (0 <= (98 + ((((long long) 600067 + a0) >= 0) ? (((long long) 600067 + a0) / 5) : ((((long long) 600067 + a0) / 5) - 1)))))) || (((((5 == a2) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a29 + 15))) && (0 <= ((long long) a0 + 60))) && ((((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) >= 0) ? ((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) : (((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) - 1)) <= 600556))) || (((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a29 + 15))) && (0 <= ((long long) a0 + 60))) && (3 == a2)) && ((((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) >= 0) ? ((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) : (((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) - 1)) <= 600556))) || (((((5 == a2) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a29 + 15))) && (((long long) a0 + 147) <= 0)) && (0 <= ((long long) 600001 + a0)))) || ((((((long long) 89 + a4) <= 0) && (a2 == 1)) && (((long long) a29 + 127) == 0)) && (((long long) 44 + a0) == 0))) || (((0 <= ((long long) a0 + 599997)) && (2 == a2)) && (((long long) a0 + 147) <= 0))) || ((((((long long) 104 + a0) <= 0) && (5 == a2)) && (0 <= ((long long) a0 + 599997))) && (((long long) 42 + a4) <= 0))) || ((((((long long) 89 + a4) <= 0) && (3 == a2)) && (((long long) a29 + 127) <= 0)) && ((((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) >= 0) ? ((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) : (((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) - 1)) <= 600556))) || (((((0 <= ((long long) 97 + a0)) && (((long long) 89 + a4) <= 0)) && (a2 == 4)) && ((((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) >= 0) ? ((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) : (((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) - 1)) <= 600556)) && (a29 <= 43))) || (((((((long long) 104 + a0) <= 0) && (0 <= ((long long) a0 + 599997))) && (((long long) 42 + a4) <= 0)) && (44 <= a29)) && (a2 == 4))) || ((((0 <= ((long long) a0 + 599997)) && (((long long) 42 + a4) <= 0)) && (((long long) a0 + 147) <= 0)) && (a2 == 1))) || (((((5 == a2) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a29 + 15))) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0)))) || (((((0 <= ((long long) 97 + a0)) && (((long long) 42 + a4) <= 0)) && (3 == a2)) && (a29 <= 43)) && (((long long) a0 + 61) <= 0))) || ((((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (3 == a2))) || (((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a0 + 60))) && (((long long) a29 + 127) <= 0)) && ((((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) >= 0) ? ((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) : (((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) - 1)) <= 600556))) || (((a2 == 1) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 144) <= 0))) || ((((long long) 89 + a4) <= 0) && (((long long) a0 + 147) <= 0))) || ((((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a29 + 15))) && (0 <= ((long long) a0 + 60))) && (a2 == 4)) && ((((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) >= 0) ? ((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) : (((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) - 1)) <= 600556)) && (a29 <= 43))) || (((((long long) 89 + a4) <= 0) && (((long long) a29 + 401505) <= 0)) && (((long long) a0 + 61) <= 0))) || ((((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (a2 == 1))) || (((((((long long) 42 + a4) <= 0) && (44 <= a29)) && (((long long) a0 + 147) <= 0)) && (a2 == 1)) && (0 <= ((long long) 600001 + a0)))) || (((((0 <= ((long long) 97 + a0)) && (((long long) 42 + a4) <= 0)) && (a2 == 1)) && (a29 <= 43)) && (((long long) a0 + 61) <= 0))) || (((2 == a2) && (((long long) 89 + a4) <= 0)) && ((((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) >= 0) ? ((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) : (((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) - 1)) <= 600556))) || (((((((long long) 42 + a4) <= 0) && (2 == a2)) && (44 <= a29)) && (0 <= ((long long) a0 + 60))) && ((((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) >= 0) ? ((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) : (((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) - 1)) <= 600556))) RESULT: Ultimate proved your program to be correct! [2025-01-09 00:04:01,835 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