./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label35.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem16_label35.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 00a3c697369565c764a629399f75f0a57cc9f6d9ed54e92f480d6927d7ff14f0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:58:49,885 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:58:49,923 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:58:49,926 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:58:49,927 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:58:49,940 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:58:49,941 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:58:49,941 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:58:49,941 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:58:49,941 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:58:49,941 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:58:49,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:58:49,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:58:49,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:58:49,942 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:58:49,942 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:58:49,942 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:58:49,942 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:58:49,942 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:58:49,942 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:58:49,943 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:58:49,943 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:58:49,943 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:58:49,943 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:58:49,943 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:58:49,943 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:58:49,943 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:58:49,943 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:58:49,943 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:58:49,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:58:49,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:58:49,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:58:49,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:58:49,944 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:58:49,944 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:58:49,944 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:58:49,944 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:58:49,944 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:58:49,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:58:49,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:58:49,944 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:58:49,944 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:58:49,944 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:58:49,944 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 -> 00a3c697369565c764a629399f75f0a57cc9f6d9ed54e92f480d6927d7ff14f0 [2025-02-05 11:58:50,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:58:50,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:58:50,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:58:50,143 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:58:50,143 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:58:50,144 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label35.c [2025-02-05 11:58:51,372 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8abe71e2/1aac629168c14965b79af8b89a59666b/FLAGb9475e3f8 [2025-02-05 11:58:51,780 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:58:51,785 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label35.c [2025-02-05 11:58:51,800 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8abe71e2/1aac629168c14965b79af8b89a59666b/FLAGb9475e3f8 [2025-02-05 11:58:51,932 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8abe71e2/1aac629168c14965b79af8b89a59666b [2025-02-05 11:58:51,934 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:58:51,935 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:58:51,937 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:58:51,937 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:58:51,940 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:58:51,940 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:58:51" (1/1) ... [2025-02-05 11:58:51,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1efd54e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:51, skipping insertion in model container [2025-02-05 11:58:51,941 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:58:51" (1/1) ... [2025-02-05 11:58:51,979 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:58:52,159 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/Problem16_label35.c[4426,4439] [2025-02-05 11:58:52,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:58:52,421 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:58:52,439 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/Problem16_label35.c[4426,4439] [2025-02-05 11:58:52,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:58:52,565 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:58:52,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:52 WrapperNode [2025-02-05 11:58:52,567 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:58:52,568 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:58:52,568 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:58:52,568 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:58:52,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:52" (1/1) ... [2025-02-05 11:58:52,602 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:52" (1/1) ... [2025-02-05 11:58:52,711 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-02-05 11:58:52,711 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:58:52,712 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:58:52,712 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:58:52,712 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:58:52,718 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:52" (1/1) ... [2025-02-05 11:58:52,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:52" (1/1) ... [2025-02-05 11:58:52,739 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:52" (1/1) ... [2025-02-05 11:58:52,833 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 11:58:52,833 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:52" (1/1) ... [2025-02-05 11:58:52,833 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:52" (1/1) ... [2025-02-05 11:58:52,865 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:52" (1/1) ... [2025-02-05 11:58:52,872 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:52" (1/1) ... [2025-02-05 11:58:52,881 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:52" (1/1) ... [2025-02-05 11:58:52,887 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:52" (1/1) ... [2025-02-05 11:58:52,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:58:52,902 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:58:52,902 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:58:52,902 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:58:52,903 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:52" (1/1) ... [2025-02-05 11:58:52,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:58:52,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:58:52,927 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 11:58:52,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 11:58:52,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:58:52,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:58:52,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:58:52,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:58:52,987 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:58:52,989 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:58:54,492 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-02-05 11:58:54,549 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-02-05 11:58:54,550 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:58:54,572 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:58:54,572 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:58:54,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:58:54 BoogieIcfgContainer [2025-02-05 11:58:54,572 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:58:54,574 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:58:54,574 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:58:54,579 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:58:54,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:58:51" (1/3) ... [2025-02-05 11:58:54,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5145bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:58:54, skipping insertion in model container [2025-02-05 11:58:54,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:52" (2/3) ... [2025-02-05 11:58:54,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5145bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:58:54, skipping insertion in model container [2025-02-05 11:58:54,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:58:54" (3/3) ... [2025-02-05 11:58:54,581 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label35.c [2025-02-05 11:58:54,594 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:58:54,595 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label35.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:58:54,656 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:58:54,668 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;@717b9bf5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:58:54,669 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:58:54,673 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:54,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 11:58:54,679 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:58:54,680 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] [2025-02-05 11:58:54,681 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:58:54,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:58:54,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1850762246, now seen corresponding path program 1 times [2025-02-05 11:58:54,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:58:54,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565874392] [2025-02-05 11:58:54,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:58:54,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:58:54,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 11:58:54,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 11:58:54,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:58:54,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:58:54,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:58:54,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:58:54,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565874392] [2025-02-05 11:58:54,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565874392] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:58:54,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:58:55,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:58:55,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018754727] [2025-02-05 11:58:55,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:58:55,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:58:55,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:58:55,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:58:55,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:58:55,023 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 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 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:56,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:58:56,340 INFO L93 Difference]: Finished difference Result 1137 states and 2115 transitions. [2025-02-05 11:58:56,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:58:56,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2025-02-05 11:58:56,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:58:56,354 INFO L225 Difference]: With dead ends: 1137 [2025-02-05 11:58:56,354 INFO L226 Difference]: Without dead ends: 662 [2025-02-05 11:58:56,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:58:56,359 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 345 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:58:56,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 60 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 11:58:56,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-02-05 11:58:56,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2025-02-05 11:58:56,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.7639939485627836) internal successors, (1166), 661 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:56,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1166 transitions. [2025-02-05 11:58:56,405 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1166 transitions. Word has length 41 [2025-02-05 11:58:56,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:58:56,406 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1166 transitions. [2025-02-05 11:58:56,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:56,406 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1166 transitions. [2025-02-05 11:58:56,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-05 11:58:56,408 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:58:56,408 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:58:56,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:58:56,409 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:58:56,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:58:56,409 INFO L85 PathProgramCache]: Analyzing trace with hash -552949292, now seen corresponding path program 1 times [2025-02-05 11:58:56,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:58:56,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845163982] [2025-02-05 11:58:56,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:58:56,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:58:56,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 11:58:56,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 11:58:56,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:58:56,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:58:56,564 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:58:56,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:58:56,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845163982] [2025-02-05 11:58:56,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845163982] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:58:56,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:58:56,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:58:56,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414985246] [2025-02-05 11:58:56,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:58:56,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:58:56,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:58:56,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:58:56,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:58:56,566 INFO L87 Difference]: Start difference. First operand 662 states and 1166 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:57,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:58:57,690 INFO L93 Difference]: Finished difference Result 1980 states and 3493 transitions. [2025-02-05 11:58:57,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:58:57,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2025-02-05 11:58:57,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:58:57,696 INFO L225 Difference]: With dead ends: 1980 [2025-02-05 11:58:57,696 INFO L226 Difference]: Without dead ends: 1320 [2025-02-05 11:58:57,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:58:57,701 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 344 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:58:57,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 77 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 11:58:57,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2025-02-05 11:58:57,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2025-02-05 11:58:57,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.6656557998483699) internal successors, (2197), 1319 states have internal predecessors, (2197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:57,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 2197 transitions. [2025-02-05 11:58:57,737 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 2197 transitions. Word has length 106 [2025-02-05 11:58:57,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:58:57,737 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 2197 transitions. [2025-02-05 11:58:57,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:57,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 2197 transitions. [2025-02-05 11:58:57,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 11:58:57,739 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:58:57,739 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:58:57,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:58:57,740 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:58:57,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:58:57,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1059906727, now seen corresponding path program 1 times [2025-02-05 11:58:57,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:58:57,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891100954] [2025-02-05 11:58:57,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:58:57,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:58:57,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 11:58:57,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 11:58:57,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:58:57,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:58:58,060 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:58:58,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:58:58,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891100954] [2025-02-05 11:58:58,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891100954] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:58:58,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:58:58,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:58:58,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579131441] [2025-02-05 11:58:58,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:58:58,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:58:58,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:58:58,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:58:58,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:58:58,062 INFO L87 Difference]: Start difference. First operand 1320 states and 2197 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:59,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:58:59,675 INFO L93 Difference]: Finished difference Result 3625 states and 5926 transitions. [2025-02-05 11:58:59,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:58:59,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-02-05 11:58:59,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:58:59,682 INFO L225 Difference]: With dead ends: 3625 [2025-02-05 11:58:59,683 INFO L226 Difference]: Without dead ends: 2307 [2025-02-05 11:58:59,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:58:59,685 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 1005 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 2019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 523 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:58:59,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 41 Invalid, 2019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [523 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 11:58:59,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2025-02-05 11:58:59,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2025-02-05 11:58:59,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2306 states have (on average 1.5034692107545533) internal successors, (3467), 2306 states have internal predecessors, (3467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:59,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3467 transitions. [2025-02-05 11:58:59,721 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3467 transitions. Word has length 109 [2025-02-05 11:58:59,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:58:59,721 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 3467 transitions. [2025-02-05 11:58:59,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:59,721 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3467 transitions. [2025-02-05 11:58:59,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-05 11:58:59,722 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:58:59,723 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:58:59,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:58:59,723 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:58:59,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:58:59,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1663100651, now seen corresponding path program 1 times [2025-02-05 11:58:59,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:58:59,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989886182] [2025-02-05 11:58:59,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:58:59,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:58:59,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 11:58:59,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 11:58:59,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:58:59,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:58:59,882 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:58:59,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:58:59,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989886182] [2025-02-05 11:58:59,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989886182] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:58:59,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:58:59,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:58:59,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724836917] [2025-02-05 11:58:59,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:58:59,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:58:59,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:58:59,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:58:59,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:58:59,883 INFO L87 Difference]: Start difference. First operand 2307 states and 3467 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:00,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:59:00,826 INFO L93 Difference]: Finished difference Result 4941 states and 7580 transitions. [2025-02-05 11:59:00,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:59:00,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2025-02-05 11:59:00,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:59:00,857 INFO L225 Difference]: With dead ends: 4941 [2025-02-05 11:59:00,857 INFO L226 Difference]: Without dead ends: 2965 [2025-02-05 11:59:00,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:59:00,859 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 343 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:59:00,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 540 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 11:59:00,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2025-02-05 11:59:00,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2965. [2025-02-05 11:59:00,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2965 states, 2964 states have (on average 1.4321862348178138) internal successors, (4245), 2964 states have internal predecessors, (4245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:00,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 4245 transitions. [2025-02-05 11:59:00,907 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 4245 transitions. Word has length 128 [2025-02-05 11:59:00,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:59:00,908 INFO L471 AbstractCegarLoop]: Abstraction has 2965 states and 4245 transitions. [2025-02-05 11:59:00,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:00,908 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 4245 transitions. [2025-02-05 11:59:00,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-02-05 11:59:00,911 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:59:00,911 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:59:00,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:59:00,911 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:59:00,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:59:00,912 INFO L85 PathProgramCache]: Analyzing trace with hash 682591657, now seen corresponding path program 1 times [2025-02-05 11:59:00,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:59:00,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347541820] [2025-02-05 11:59:00,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:59:00,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:59:00,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-02-05 11:59:00,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-02-05 11:59:00,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:59:00,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:59:01,082 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-02-05 11:59:01,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:59:01,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347541820] [2025-02-05 11:59:01,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347541820] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:59:01,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:59:01,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:59:01,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431309719] [2025-02-05 11:59:01,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:59:01,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:59:01,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:59:01,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:59:01,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:59:01,085 INFO L87 Difference]: Start difference. First operand 2965 states and 4245 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:02,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:59:02,048 INFO L93 Difference]: Finished difference Result 7573 states and 10945 transitions. [2025-02-05 11:59:02,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:59:02,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 229 [2025-02-05 11:59:02,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:59:02,059 INFO L225 Difference]: With dead ends: 7573 [2025-02-05 11:59:02,059 INFO L226 Difference]: Without dead ends: 4281 [2025-02-05 11:59:02,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:59:02,062 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 345 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:59:02,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 155 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 11:59:02,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4281 states. [2025-02-05 11:59:02,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4281 to 3623. [2025-02-05 11:59:02,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3623 states, 3622 states have (on average 1.1035339591385975) internal successors, (3997), 3622 states have internal predecessors, (3997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:02,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3623 states to 3623 states and 3997 transitions. [2025-02-05 11:59:02,106 INFO L78 Accepts]: Start accepts. Automaton has 3623 states and 3997 transitions. Word has length 229 [2025-02-05 11:59:02,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:59:02,107 INFO L471 AbstractCegarLoop]: Abstraction has 3623 states and 3997 transitions. [2025-02-05 11:59:02,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:02,107 INFO L276 IsEmpty]: Start isEmpty. Operand 3623 states and 3997 transitions. [2025-02-05 11:59:02,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-02-05 11:59:02,109 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:59:02,110 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:59:02,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:59:02,110 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:59:02,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:59:02,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1380875190, now seen corresponding path program 1 times [2025-02-05 11:59:02,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:59:02,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473671403] [2025-02-05 11:59:02,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:59:02,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:59:02,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-02-05 11:59:02,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-02-05 11:59:02,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:59:02,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:59:02,505 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-02-05 11:59:02,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:59:02,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473671403] [2025-02-05 11:59:02,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473671403] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:59:02,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:59:02,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:59:02,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611104027] [2025-02-05 11:59:02,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:59:02,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:59:02,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:59:02,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:59:02,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:59:02,507 INFO L87 Difference]: Start difference. First operand 3623 states and 3997 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 2 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:03,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:59:03,410 INFO L93 Difference]: Finished difference Result 8889 states and 9851 transitions. [2025-02-05 11:59:03,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:59:03,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 2 states have internal predecessors, (278), 0 states have call successors, (0), 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 372 [2025-02-05 11:59:03,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:59:03,422 INFO L225 Difference]: With dead ends: 8889 [2025-02-05 11:59:03,422 INFO L226 Difference]: Without dead ends: 5597 [2025-02-05 11:59:03,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:59:03,427 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 99 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:59:03,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 34 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 11:59:03,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5597 states. [2025-02-05 11:59:03,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 5597. [2025-02-05 11:59:03,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5597 states, 5596 states have (on average 1.0986418870621872) internal successors, (6148), 5596 states have internal predecessors, (6148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:03,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5597 states to 5597 states and 6148 transitions. [2025-02-05 11:59:03,486 INFO L78 Accepts]: Start accepts. Automaton has 5597 states and 6148 transitions. Word has length 372 [2025-02-05 11:59:03,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:59:03,487 INFO L471 AbstractCegarLoop]: Abstraction has 5597 states and 6148 transitions. [2025-02-05 11:59:03,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 2 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:03,487 INFO L276 IsEmpty]: Start isEmpty. Operand 5597 states and 6148 transitions. [2025-02-05 11:59:03,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2025-02-05 11:59:03,492 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:59:03,492 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:59:03,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:59:03,492 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:59:03,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:59:03,493 INFO L85 PathProgramCache]: Analyzing trace with hash -2105504182, now seen corresponding path program 1 times [2025-02-05 11:59:03,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:59:03,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539058165] [2025-02-05 11:59:03,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:59:03,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:59:03,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes. [2025-02-05 11:59:03,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements. [2025-02-05 11:59:03,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:59:03,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:59:03,908 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-02-05 11:59:03,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:59:03,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539058165] [2025-02-05 11:59:03,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539058165] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:59:03,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305782772] [2025-02-05 11:59:03,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:59:03,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:59:03,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:59:03,910 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:59:03,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 11:59:03,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes. [2025-02-05 11:59:04,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements. [2025-02-05 11:59:04,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:59:04,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:59:04,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:59:04,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:59:04,121 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-02-05 11:59:04,122 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:59:04,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305782772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:59:04,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:59:04,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-02-05 11:59:04,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912759173] [2025-02-05 11:59:04,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:59:04,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:59:04,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:59:04,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:59:04,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:59:04,124 INFO L87 Difference]: Start difference. First operand 5597 states and 6148 transitions. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:04,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:59:04,840 INFO L93 Difference]: Finished difference Result 14153 states and 15562 transitions. [2025-02-05 11:59:04,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:59:04,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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 380 [2025-02-05 11:59:04,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:59:04,862 INFO L225 Difference]: With dead ends: 14153 [2025-02-05 11:59:04,862 INFO L226 Difference]: Without dead ends: 9216 [2025-02-05 11:59:04,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:59:04,870 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 307 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:59:04,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 38 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:59:04,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9216 states. [2025-02-05 11:59:04,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9216 to 8229. [2025-02-05 11:59:04,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8229 states, 8228 states have (on average 1.0828877005347595) internal successors, (8910), 8228 states have internal predecessors, (8910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:04,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8229 states to 8229 states and 8910 transitions. [2025-02-05 11:59:04,998 INFO L78 Accepts]: Start accepts. Automaton has 8229 states and 8910 transitions. Word has length 380 [2025-02-05 11:59:04,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:59:05,000 INFO L471 AbstractCegarLoop]: Abstraction has 8229 states and 8910 transitions. [2025-02-05 11:59:05,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:05,000 INFO L276 IsEmpty]: Start isEmpty. Operand 8229 states and 8910 transitions. [2025-02-05 11:59:05,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-02-05 11:59:05,005 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:59:05,005 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:59:05,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 11:59:05,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:59:05,210 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:59:05,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:59:05,212 INFO L85 PathProgramCache]: Analyzing trace with hash -649528623, now seen corresponding path program 1 times [2025-02-05 11:59:05,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:59:05,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069280473] [2025-02-05 11:59:05,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:59:05,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:59:05,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-02-05 11:59:05,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-02-05 11:59:05,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:59:05,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:59:05,756 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:59:05,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:59:05,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069280473] [2025-02-05 11:59:05,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069280473] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:59:05,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:59:05,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:59:05,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376098509] [2025-02-05 11:59:05,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:59:05,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:59:05,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:59:05,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:59:05,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:59:05,757 INFO L87 Difference]: Start difference. First operand 8229 states and 8910 transitions. Second operand has 4 states, 4 states have (on average 108.5) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:06,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:59:06,440 INFO L93 Difference]: Finished difference Result 16456 states and 17824 transitions. [2025-02-05 11:59:06,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:59:06,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 108.5) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 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 434 [2025-02-05 11:59:06,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:59:06,456 INFO L225 Difference]: With dead ends: 16456 [2025-02-05 11:59:06,456 INFO L226 Difference]: Without dead ends: 8558 [2025-02-05 11:59:06,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:59:06,463 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 268 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:59:06,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 105 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:59:06,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8558 states. [2025-02-05 11:59:06,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8558 to 8558. [2025-02-05 11:59:06,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8558 states, 8557 states have (on average 1.0801682832768493) internal successors, (9243), 8557 states have internal predecessors, (9243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:06,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8558 states to 8558 states and 9243 transitions. [2025-02-05 11:59:06,586 INFO L78 Accepts]: Start accepts. Automaton has 8558 states and 9243 transitions. Word has length 434 [2025-02-05 11:59:06,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:59:06,587 INFO L471 AbstractCegarLoop]: Abstraction has 8558 states and 9243 transitions. [2025-02-05 11:59:06,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.5) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:06,587 INFO L276 IsEmpty]: Start isEmpty. Operand 8558 states and 9243 transitions. [2025-02-05 11:59:06,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-02-05 11:59:06,591 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:59:06,591 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-02-05 11:59:06,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:59:06,591 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:59:06,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:59:06,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1002438043, now seen corresponding path program 1 times [2025-02-05 11:59:06,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:59:06,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762086293] [2025-02-05 11:59:06,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:59:06,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:59:06,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-02-05 11:59:06,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-02-05 11:59:06,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:59:06,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:59:06,953 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2025-02-05 11:59:06,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:59:06,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762086293] [2025-02-05 11:59:06,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762086293] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:59:06,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166462817] [2025-02-05 11:59:06,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:59:06,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:59:06,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:59:06,955 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:59:06,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 11:59:07,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-02-05 11:59:07,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-02-05 11:59:07,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:59:07,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:59:07,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:59:07,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:59:07,536 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-02-05 11:59:07,536 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:59:07,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166462817] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:59:07,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:59:07,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-02-05 11:59:07,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444851941] [2025-02-05 11:59:07,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:59:07,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:59:07,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:59:07,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:59:07,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:59:07,539 INFO L87 Difference]: Start difference. First operand 8558 states and 9243 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 2 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:08,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:59:08,150 INFO L93 Difference]: Finished difference Result 9876 states and 10604 transitions. [2025-02-05 11:59:08,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:59:08,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 2 states have internal predecessors, (248), 0 states have call successors, (0), 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 442 [2025-02-05 11:59:08,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:59:08,170 INFO L225 Difference]: With dead ends: 9876 [2025-02-05 11:59:08,170 INFO L226 Difference]: Without dead ends: 9874 [2025-02-05 11:59:08,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:59:08,176 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 108 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:59:08,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 75 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:59:08,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9874 states. [2025-02-05 11:59:08,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9874 to 8887. [2025-02-05 11:59:08,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8887 states, 8886 states have (on average 1.0782129191987395) internal successors, (9581), 8886 states have internal predecessors, (9581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:08,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8887 states to 8887 states and 9581 transitions. [2025-02-05 11:59:08,308 INFO L78 Accepts]: Start accepts. Automaton has 8887 states and 9581 transitions. Word has length 442 [2025-02-05 11:59:08,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:59:08,309 INFO L471 AbstractCegarLoop]: Abstraction has 8887 states and 9581 transitions. [2025-02-05 11:59:08,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 2 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:08,310 INFO L276 IsEmpty]: Start isEmpty. Operand 8887 states and 9581 transitions. [2025-02-05 11:59:08,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1170 [2025-02-05 11:59:08,337 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:59:08,338 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:59:08,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 11:59:08,538 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-02-05 11:59:08,539 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:59:08,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:59:08,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1263899521, now seen corresponding path program 1 times [2025-02-05 11:59:08,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:59:08,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787571253] [2025-02-05 11:59:08,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:59:08,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:59:08,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1169 statements into 1 equivalence classes. [2025-02-05 11:59:08,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1169 of 1169 statements. [2025-02-05 11:59:08,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:59:08,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:59:09,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2717 backedges. 1370 proven. 214 refuted. 0 times theorem prover too weak. 1133 trivial. 0 not checked. [2025-02-05 11:59:09,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:59:09,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787571253] [2025-02-05 11:59:09,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787571253] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:59:09,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911527822] [2025-02-05 11:59:09,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:59:09,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:59:09,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:59:09,419 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:59:09,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 11:59:09,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1169 statements into 1 equivalence classes. [2025-02-05 11:59:09,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1169 of 1169 statements. [2025-02-05 11:59:09,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:59:09,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:59:09,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 1374 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:59:09,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:59:10,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2717 backedges. 1370 proven. 0 refuted. 0 times theorem prover too weak. 1347 trivial. 0 not checked. [2025-02-05 11:59:10,094 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:59:10,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911527822] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:59:10,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:59:10,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-05 11:59:10,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523016649] [2025-02-05 11:59:10,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:59:10,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:59:10,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:59:10,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:59:10,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:59:10,097 INFO L87 Difference]: Start difference. First operand 8887 states and 9581 transitions. Second operand has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 2 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:10,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:59:10,869 INFO L93 Difference]: Finished difference Result 20404 states and 22091 transitions. [2025-02-05 11:59:10,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:59:10,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 2 states have internal predecessors, (502), 0 states have call successors, (0), 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 1169 [2025-02-05 11:59:10,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:59:10,887 INFO L225 Difference]: With dead ends: 20404 [2025-02-05 11:59:10,887 INFO L226 Difference]: Without dead ends: 12177 [2025-02-05 11:59:10,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1172 GetRequests, 1168 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:59:10,895 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 87 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:59:10,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 97 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:59:10,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12177 states. [2025-02-05 11:59:11,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12177 to 12177. [2025-02-05 11:59:11,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12177 states, 12176 states have (on average 1.0684954007884362) internal successors, (13010), 12176 states have internal predecessors, (13010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:11,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 13010 transitions. [2025-02-05 11:59:11,031 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 13010 transitions. Word has length 1169 [2025-02-05 11:59:11,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:59:11,032 INFO L471 AbstractCegarLoop]: Abstraction has 12177 states and 13010 transitions. [2025-02-05 11:59:11,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 2 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:11,033 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 13010 transitions. [2025-02-05 11:59:11,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1225 [2025-02-05 11:59:11,058 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:59:11,059 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, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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-02-05 11:59:11,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 11:59:11,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:59:11,259 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:59:11,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:59:11,261 INFO L85 PathProgramCache]: Analyzing trace with hash 189962708, now seen corresponding path program 1 times [2025-02-05 11:59:11,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:59:11,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769791232] [2025-02-05 11:59:11,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:59:11,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:59:11,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1224 statements into 1 equivalence classes. [2025-02-05 11:59:11,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1224 of 1224 statements. [2025-02-05 11:59:11,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:59:11,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:59:11,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2466 backedges. 1767 proven. 0 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2025-02-05 11:59:11,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:59:11,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769791232] [2025-02-05 11:59:11,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769791232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:59:11,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:59:11,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:59:11,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953017641] [2025-02-05 11:59:11,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:59:11,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:59:11,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:59:11,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:59:11,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:59:11,901 INFO L87 Difference]: Start difference. First operand 12177 states and 13010 transitions. Second operand has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:12,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:59:12,610 INFO L93 Difference]: Finished difference Result 26326 states and 28206 transitions. [2025-02-05 11:59:12,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:59:12,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 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 1224 [2025-02-05 11:59:12,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:59:12,652 INFO L225 Difference]: With dead ends: 26326 [2025-02-05 11:59:12,652 INFO L226 Difference]: Without dead ends: 14809 [2025-02-05 11:59:12,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:59:12,676 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 220 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:59:12,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 430 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:59:12,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14809 states. [2025-02-05 11:59:12,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14809 to 14151. [2025-02-05 11:59:12,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14151 states, 14150 states have (on average 1.0559717314487633) internal successors, (14942), 14150 states have internal predecessors, (14942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:12,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14151 states to 14151 states and 14942 transitions. [2025-02-05 11:59:12,962 INFO L78 Accepts]: Start accepts. Automaton has 14151 states and 14942 transitions. Word has length 1224 [2025-02-05 11:59:12,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:59:12,963 INFO L471 AbstractCegarLoop]: Abstraction has 14151 states and 14942 transitions. [2025-02-05 11:59:12,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:12,963 INFO L276 IsEmpty]: Start isEmpty. Operand 14151 states and 14942 transitions. [2025-02-05 11:59:12,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1387 [2025-02-05 11:59:12,981 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:59:12,981 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-02-05 11:59:12,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:59:12,982 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:59:12,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:59:12,982 INFO L85 PathProgramCache]: Analyzing trace with hash -396210676, now seen corresponding path program 1 times [2025-02-05 11:59:12,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:59:12,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344672503] [2025-02-05 11:59:12,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:59:12,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:59:13,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1386 statements into 1 equivalence classes. [2025-02-05 11:59:13,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1386 of 1386 statements. [2025-02-05 11:59:13,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:59:13,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:59:13,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3330 backedges. 2431 proven. 0 refuted. 0 times theorem prover too weak. 899 trivial. 0 not checked. [2025-02-05 11:59:14,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:59:14,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344672503] [2025-02-05 11:59:14,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344672503] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:59:14,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:59:14,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 11:59:14,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430023944] [2025-02-05 11:59:14,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:59:14,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 11:59:14,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:59:14,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 11:59:14,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:59:14,002 INFO L87 Difference]: Start difference. First operand 14151 states and 14942 transitions. Second operand has 6 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:15,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:59:15,112 INFO L93 Difference]: Finished difference Result 28301 states and 29899 transitions. [2025-02-05 11:59:15,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 11:59:15,112 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 0 states have call successors, (0), 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 1386 [2025-02-05 11:59:15,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:59:15,153 INFO L225 Difference]: With dead ends: 28301 [2025-02-05 11:59:15,153 INFO L226 Difference]: Without dead ends: 14810 [2025-02-05 11:59:15,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:59:15,176 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 505 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 1386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:59:15,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 562 Invalid, 1386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1372 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 11:59:15,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14810 states. [2025-02-05 11:59:15,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14810 to 14809. [2025-02-05 11:59:15,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14809 states, 14808 states have (on average 1.05382225823879) internal successors, (15605), 14808 states have internal predecessors, (15605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:15,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14809 states to 14809 states and 15605 transitions. [2025-02-05 11:59:15,425 INFO L78 Accepts]: Start accepts. Automaton has 14809 states and 15605 transitions. Word has length 1386 [2025-02-05 11:59:15,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:59:15,429 INFO L471 AbstractCegarLoop]: Abstraction has 14809 states and 15605 transitions. [2025-02-05 11:59:15,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:15,430 INFO L276 IsEmpty]: Start isEmpty. Operand 14809 states and 15605 transitions. [2025-02-05 11:59:15,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1401 [2025-02-05 11:59:15,460 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:59:15,461 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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-02-05 11:59:15,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:59:15,461 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:59:15,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:59:15,462 INFO L85 PathProgramCache]: Analyzing trace with hash 481073250, now seen corresponding path program 1 times [2025-02-05 11:59:15,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:59:15,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443158155] [2025-02-05 11:59:15,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:59:15,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:59:15,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1400 statements into 1 equivalence classes. [2025-02-05 11:59:15,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1400 of 1400 statements. [2025-02-05 11:59:15,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:59:15,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:59:16,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3266 backedges. 2404 proven. 0 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2025-02-05 11:59:16,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:59:16,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443158155] [2025-02-05 11:59:16,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443158155] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:59:16,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:59:16,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:59:16,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360505505] [2025-02-05 11:59:16,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:59:16,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:59:16,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:59:16,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:59:16,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:59:16,795 INFO L87 Difference]: Start difference. First operand 14809 states and 15605 transitions. Second operand has 4 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:17,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:59:17,656 INFO L93 Difference]: Finished difference Result 28968 states and 30554 transitions. [2025-02-05 11:59:17,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 11:59:17,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 0 states have call successors, (0), 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 1400 [2025-02-05 11:59:17,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:59:17,674 INFO L225 Difference]: With dead ends: 28968 [2025-02-05 11:59:17,674 INFO L226 Difference]: Without dead ends: 14819 [2025-02-05 11:59:17,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:59:17,687 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 217 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:59:17,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 444 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:59:17,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14819 states. [2025-02-05 11:59:17,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14819 to 14480. [2025-02-05 11:59:17,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14480 states, 14479 states have (on average 1.054285516955591) internal successors, (15265), 14479 states have internal predecessors, (15265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:17,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14480 states to 14480 states and 15265 transitions. [2025-02-05 11:59:17,810 INFO L78 Accepts]: Start accepts. Automaton has 14480 states and 15265 transitions. Word has length 1400 [2025-02-05 11:59:17,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:59:17,810 INFO L471 AbstractCegarLoop]: Abstraction has 14480 states and 15265 transitions. [2025-02-05 11:59:17,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:17,811 INFO L276 IsEmpty]: Start isEmpty. Operand 14480 states and 15265 transitions. [2025-02-05 11:59:17,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1416 [2025-02-05 11:59:17,828 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:59:17,829 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-02-05 11:59:17,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 11:59:17,829 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:59:17,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:59:17,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1414381320, now seen corresponding path program 1 times [2025-02-05 11:59:17,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:59:17,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40785280] [2025-02-05 11:59:17,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:59:17,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:59:17,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1415 statements into 1 equivalence classes. [2025-02-05 11:59:17,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1415 of 1415 statements. [2025-02-05 11:59:17,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:59:17,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:59:18,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3475 backedges. 2413 proven. 0 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2025-02-05 11:59:18,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:59:18,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40785280] [2025-02-05 11:59:18,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40785280] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:59:18,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:59:18,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:59:18,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253799289] [2025-02-05 11:59:18,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:59:18,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:59:18,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:59:18,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:59:18,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:59:18,451 INFO L87 Difference]: Start difference. First operand 14480 states and 15265 transitions. Second operand has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:19,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:59:19,141 INFO L93 Difference]: Finished difference Result 28300 states and 29864 transitions. [2025-02-05 11:59:19,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:59:19,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 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 1415 [2025-02-05 11:59:19,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:59:19,156 INFO L225 Difference]: With dead ends: 28300 [2025-02-05 11:59:19,156 INFO L226 Difference]: Without dead ends: 14480 [2025-02-05 11:59:19,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:59:19,164 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 195 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:59:19,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 423 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:59:19,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14480 states. [2025-02-05 11:59:19,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14480 to 14151. [2025-02-05 11:59:19,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14151 states, 14150 states have (on average 1.044452296819788) internal successors, (14779), 14150 states have internal predecessors, (14779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:19,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14151 states to 14151 states and 14779 transitions. [2025-02-05 11:59:19,264 INFO L78 Accepts]: Start accepts. Automaton has 14151 states and 14779 transitions. Word has length 1415 [2025-02-05 11:59:19,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:59:19,264 INFO L471 AbstractCegarLoop]: Abstraction has 14151 states and 14779 transitions. [2025-02-05 11:59:19,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:19,264 INFO L276 IsEmpty]: Start isEmpty. Operand 14151 states and 14779 transitions. [2025-02-05 11:59:19,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1441 [2025-02-05 11:59:19,280 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:59:19,281 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-02-05 11:59:19,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 11:59:19,281 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:59:19,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:59:19,282 INFO L85 PathProgramCache]: Analyzing trace with hash -969281873, now seen corresponding path program 1 times [2025-02-05 11:59:19,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:59:19,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123885728] [2025-02-05 11:59:19,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:59:19,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:59:19,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1440 statements into 1 equivalence classes. [2025-02-05 11:59:19,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1440 of 1440 statements. [2025-02-05 11:59:19,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:59:19,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:59:20,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3625 backedges. 2593 proven. 0 refuted. 0 times theorem prover too weak. 1032 trivial. 0 not checked. [2025-02-05 11:59:20,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:59:20,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123885728] [2025-02-05 11:59:20,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123885728] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:59:20,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:59:20,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:59:20,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293710091] [2025-02-05 11:59:20,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:59:20,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:59:20,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:59:20,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:59:20,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:59:20,115 INFO L87 Difference]: Start difference. First operand 14151 states and 14779 transitions. Second operand has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:20,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:59:20,966 INFO L93 Difference]: Finished difference Result 27642 states and 28892 transitions. [2025-02-05 11:59:20,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:59:20,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 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 1440 [2025-02-05 11:59:20,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:59:20,980 INFO L225 Difference]: With dead ends: 27642 [2025-02-05 11:59:20,980 INFO L226 Difference]: Without dead ends: 14151 [2025-02-05 11:59:20,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:59:20,990 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 120 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:59:20,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 563 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1322 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:59:20,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14151 states. [2025-02-05 11:59:21,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14151 to 14151. [2025-02-05 11:59:21,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14151 states, 14150 states have (on average 1.0436042402826855) internal successors, (14767), 14150 states have internal predecessors, (14767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:21,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14151 states to 14151 states and 14767 transitions. [2025-02-05 11:59:21,095 INFO L78 Accepts]: Start accepts. Automaton has 14151 states and 14767 transitions. Word has length 1440 [2025-02-05 11:59:21,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:59:21,096 INFO L471 AbstractCegarLoop]: Abstraction has 14151 states and 14767 transitions. [2025-02-05 11:59:21,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:21,096 INFO L276 IsEmpty]: Start isEmpty. Operand 14151 states and 14767 transitions. [2025-02-05 11:59:21,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1533 [2025-02-05 11:59:21,170 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:59:21,171 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:59:21,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 11:59:21,171 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:59:21,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:59:21,172 INFO L85 PathProgramCache]: Analyzing trace with hash -593152075, now seen corresponding path program 1 times [2025-02-05 11:59:21,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:59:21,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111156700] [2025-02-05 11:59:21,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:59:21,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:59:21,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1532 statements into 1 equivalence classes. [2025-02-05 11:59:21,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1532 of 1532 statements. [2025-02-05 11:59:21,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:59:21,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:59:22,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3926 backedges. 1632 proven. 1230 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked. [2025-02-05 11:59:22,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:59:22,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111156700] [2025-02-05 11:59:22,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111156700] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:59:22,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513548092] [2025-02-05 11:59:22,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:59:22,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:59:22,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:59:22,481 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-02-05 11:59:22,485 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-02-05 11:59:22,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1532 statements into 1 equivalence classes. [2025-02-05 11:59:22,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1532 of 1532 statements. [2025-02-05 11:59:22,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:59:22,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:59:22,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 1731 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:59:22,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:59:23,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3926 backedges. 2314 proven. 0 refuted. 0 times theorem prover too weak. 1612 trivial. 0 not checked. [2025-02-05 11:59:23,387 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:59:23,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513548092] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:59:23,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:59:23,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 11:59:23,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216666110] [2025-02-05 11:59:23,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:59:23,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:59:23,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:59:23,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:59:23,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:59:23,390 INFO L87 Difference]: Start difference. First operand 14151 states and 14767 transitions. Second operand has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:24,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:59:24,027 INFO L93 Difference]: Finished difference Result 27640 states and 28867 transitions. [2025-02-05 11:59:24,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:59:24,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 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 1532 [2025-02-05 11:59:24,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:59:24,028 INFO L225 Difference]: With dead ends: 27640 [2025-02-05 11:59:24,028 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 11:59:24,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1536 GetRequests, 1532 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:59:24,040 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 93 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:59:24,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 374 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:59:24,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 11:59:24,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 11:59:24,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:24,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 11:59:24,041 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1532 [2025-02-05 11:59:24,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:59:24,042 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 11:59:24,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:24,042 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 11:59:24,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 11:59:24,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 11:59:24,052 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-02-05 11:59:24,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 11:59:24,248 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:59:24,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 11:59:24,666 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 11:59:24,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 11:59:24 BoogieIcfgContainer [2025-02-05 11:59:24,680 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 11:59:24,680 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 11:59:24,680 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 11:59:24,680 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 11:59:24,681 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:58:54" (3/4) ... [2025-02-05 11:59:24,682 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 11:59:24,703 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-02-05 11:59:24,704 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 11:59:24,706 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 11:59:24,707 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 11:59:24,824 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 11:59:24,824 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 11:59:24,824 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 11:59:24,825 INFO L158 Benchmark]: Toolchain (without parser) took 32889.73ms. Allocated memory was 201.3MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 154.3MB in the beginning and 802.7MB in the end (delta: -648.4MB). Peak memory consumption was 931.5MB. Max. memory is 16.1GB. [2025-02-05 11:59:24,826 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 218.1MB. Free memory is still 133.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 11:59:24,826 INFO L158 Benchmark]: CACSL2BoogieTranslator took 630.32ms. Allocated memory is still 201.3MB. Free memory was 153.9MB in the beginning and 96.8MB in the end (delta: 57.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-05 11:59:24,826 INFO L158 Benchmark]: Boogie Procedure Inliner took 143.50ms. Allocated memory is still 201.3MB. Free memory was 96.8MB in the beginning and 73.7MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 11:59:24,826 INFO L158 Benchmark]: Boogie Preprocessor took 189.07ms. Allocated memory is still 201.3MB. Free memory was 73.7MB in the beginning and 131.8MB in the end (delta: -58.1MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. [2025-02-05 11:59:24,826 INFO L158 Benchmark]: IcfgBuilder took 1670.25ms. Allocated memory is still 201.3MB. Free memory was 131.8MB in the beginning and 62.4MB in the end (delta: 69.4MB). Peak memory consumption was 84.2MB. Max. memory is 16.1GB. [2025-02-05 11:59:24,827 INFO L158 Benchmark]: TraceAbstraction took 30106.13ms. Allocated memory was 201.3MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 61.0MB in the beginning and 827.5MB in the end (delta: -766.6MB). Peak memory consumption was 813.1MB. Max. memory is 16.1GB. [2025-02-05 11:59:24,827 INFO L158 Benchmark]: Witness Printer took 144.26ms. Allocated memory is still 1.8GB. Free memory was 827.5MB in the beginning and 802.7MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 11:59:24,828 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 218.1MB. Free memory is still 133.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 630.32ms. Allocated memory is still 201.3MB. Free memory was 153.9MB in the beginning and 96.8MB in the end (delta: 57.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 143.50ms. Allocated memory is still 201.3MB. Free memory was 96.8MB in the beginning and 73.7MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 189.07ms. Allocated memory is still 201.3MB. Free memory was 73.7MB in the beginning and 131.8MB in the end (delta: -58.1MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. * IcfgBuilder took 1670.25ms. Allocated memory is still 201.3MB. Free memory was 131.8MB in the beginning and 62.4MB in the end (delta: 69.4MB). Peak memory consumption was 84.2MB. Max. memory is 16.1GB. * TraceAbstraction took 30106.13ms. Allocated memory was 201.3MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 61.0MB in the beginning and 827.5MB in the end (delta: -766.6MB). Peak memory consumption was 813.1MB. Max. memory is 16.1GB. * Witness Printer took 144.26ms. Allocated memory is still 1.8GB. Free memory was 827.5MB in the beginning and 802.7MB in the end (delta: 24.8MB). 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: 140]: 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, 396 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.6s, OverallIterations: 16, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 15.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4601 SdHoareTripleChecker+Valid, 13.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4601 mSDsluCounter, 4018 SdHoareTripleChecker+Invalid, 11.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 348 mSDsCounter, 2185 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15281 IncrementalHoareTripleChecker+Invalid, 17466 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2185 mSolverCounterUnsat, 3670 mSDtfsCounter, 15281 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3578 GetRequests, 3541 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14809occurred in iteration=12, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 3959 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 15330 NumberOfCodeBlocks, 15330 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 15310 ConstructedInterpolants, 0 QuantifiedInterpolants, 43296 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4115 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 20 InterpolantComputations, 16 PerfectInterpolantSequences, 29415/30943 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: 1783]: Location Invariant Derived location invariant: (((((((((((a12 == 9) && (a16 != 10)) && (a16 <= 11)) && (4 <= a15)) || ((a12 <= 7) && (a16 <= 11))) || (((0 <= ((long long) 87 + a18)) && (a12 == 9)) && (a15 <= 3))) || ((a15 <= 3) && (a12 <= 7))) || ((a15 <= 3) && (a12 == 8))) || (((a16 != 10) && (a12 == 8)) && (a16 <= 11))) || ((a16 <= 8) && (a15 <= 3))) || (((a12 == 9) && (a15 <= 3)) && (11 <= a16))) RESULT: Ultimate proved your program to be correct! [2025-02-05 11:59:24,845 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