./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-0.i --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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-0.i -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 465302550670ddfe2aca9dabc319e04462635a8aa1413623f09c27b5df4d6427 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:31:18,439 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:31:18,490 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:31:18,494 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:31:18,494 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:31:18,506 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:31:18,507 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:31:18,507 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:31:18,507 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:31:18,507 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:31:18,507 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:31:18,507 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:31:18,507 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:31:18,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:31:18,508 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:31:18,508 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:31:18,508 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:31:18,508 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:31:18,508 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:31:18,508 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:31:18,508 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:31:18,508 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:31:18,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:31:18,508 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:31:18,508 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:31:18,508 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:31:18,509 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:31:18,509 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:31:18,509 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:31:18,509 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:31:18,509 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:31:18,509 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:31:18,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:31:18,509 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:31:18,509 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:31:18,509 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:31:18,509 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:31:18,509 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:31:18,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:31:18,509 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:31:18,509 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:31:18,509 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:31:18,509 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:31:18,510 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 -> 465302550670ddfe2aca9dabc319e04462635a8aa1413623f09c27b5df4d6427 [2025-02-05 21:31:18,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:31:18,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:31:18,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:31:18,728 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:31:18,728 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:31:18,729 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-0.i [2025-02-05 21:31:19,890 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce335e615/7e410e6927344c7693b9890633c4d63a/FLAGa2c42862a [2025-02-05 21:31:20,165 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:31:20,165 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-0.i [2025-02-05 21:31:20,177 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce335e615/7e410e6927344c7693b9890633c4d63a/FLAGa2c42862a [2025-02-05 21:31:20,470 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce335e615/7e410e6927344c7693b9890633c4d63a [2025-02-05 21:31:20,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:31:20,475 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:31:20,479 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:31:20,479 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:31:20,482 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:31:20,483 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:31:20" (1/1) ... [2025-02-05 21:31:20,484 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@390b6cb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:31:20, skipping insertion in model container [2025-02-05 21:31:20,484 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:31:20" (1/1) ... [2025-02-05 21:31:20,518 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:31:20,646 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-0.i[915,928] [2025-02-05 21:31:20,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:31:20,789 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:31:20,796 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-0.i[915,928] [2025-02-05 21:31:20,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:31:20,848 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:31:20,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:31:20 WrapperNode [2025-02-05 21:31:20,848 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:31:20,849 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:31:20,849 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:31:20,849 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:31:20,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:31:20" (1/1) ... [2025-02-05 21:31:20,863 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:31:20" (1/1) ... [2025-02-05 21:31:20,896 INFO L138 Inliner]: procedures = 26, calls = 85, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 475 [2025-02-05 21:31:20,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:31:20,897 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:31:20,897 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:31:20,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:31:20,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:31:20" (1/1) ... [2025-02-05 21:31:20,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:31:20" (1/1) ... [2025-02-05 21:31:20,909 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:31:20" (1/1) ... [2025-02-05 21:31:20,929 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 21:31:20,929 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:31:20" (1/1) ... [2025-02-05 21:31:20,929 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:31:20" (1/1) ... [2025-02-05 21:31:20,945 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:31:20" (1/1) ... [2025-02-05 21:31:20,952 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:31:20" (1/1) ... [2025-02-05 21:31:20,957 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:31:20" (1/1) ... [2025-02-05 21:31:20,959 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:31:20" (1/1) ... [2025-02-05 21:31:20,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:31:20,968 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:31:20,968 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:31:20,968 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:31:20,969 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:31:20" (1/1) ... [2025-02-05 21:31:20,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:31:20,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:31:20,992 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 21:31:20,993 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 21:31:21,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:31:21,010 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:31:21,010 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:31:21,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:31:21,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:31:21,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:31:21,110 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:31:21,111 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:31:21,715 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-02-05 21:31:21,715 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:31:21,736 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:31:21,737 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:31:21,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:31:21 BoogieIcfgContainer [2025-02-05 21:31:21,737 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:31:21,739 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:31:21,740 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:31:21,743 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:31:21,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:31:20" (1/3) ... [2025-02-05 21:31:21,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56bf429a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:31:21, skipping insertion in model container [2025-02-05 21:31:21,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:31:20" (2/3) ... [2025-02-05 21:31:21,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56bf429a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:31:21, skipping insertion in model container [2025-02-05 21:31:21,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:31:21" (3/3) ... [2025-02-05 21:31:21,746 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-0.i [2025-02-05 21:31:21,758 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:31:21,761 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-0.i that has 2 procedures, 202 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:31:21,820 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:31:21,829 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;@46991f39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:31:21,831 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:31:21,837 INFO L276 IsEmpty]: Start isEmpty. Operand has 202 states, 127 states have (on average 1.5196850393700787) internal successors, (193), 128 states have internal predecessors, (193), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-02-05 21:31:21,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-02-05 21:31:21,859 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:31:21,860 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:21,860 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:31:21,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:31:21,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1977480831, now seen corresponding path program 1 times [2025-02-05 21:31:21,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:31:21,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113403681] [2025-02-05 21:31:21,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:31:21,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:31:21,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-02-05 21:31:22,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-02-05 21:31:22,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:31:22,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:31:22,354 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 10082 trivial. 0 not checked. [2025-02-05 21:31:22,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:31:22,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113403681] [2025-02-05 21:31:22,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113403681] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:31:22,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182613706] [2025-02-05 21:31:22,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:31:22,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:31:22,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:31:22,359 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 21:31:22,363 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 21:31:22,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-02-05 21:31:22,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-02-05 21:31:22,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:31:22,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:31:22,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:31:22,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:31:22,725 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 10082 trivial. 0 not checked. [2025-02-05 21:31:22,725 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:31:22,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182613706] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:31:22,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:31:22,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:31:22,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944070599] [2025-02-05 21:31:22,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:31:22,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:31:22,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:31:22,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:31:22,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:31:22,754 INFO L87 Difference]: Start difference. First operand has 202 states, 127 states have (on average 1.5196850393700787) internal successors, (193), 128 states have internal predecessors, (193), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand has 2 states, 2 states have (on average 51.0) internal successors, (102), 2 states have internal predecessors, (102), 2 states have call successors, (72), 2 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 2 states have call successors, (72) [2025-02-05 21:31:22,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:31:22,794 INFO L93 Difference]: Finished difference Result 398 states and 741 transitions. [2025-02-05 21:31:22,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:31:22,796 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 51.0) internal successors, (102), 2 states have internal predecessors, (102), 2 states have call successors, (72), 2 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 2 states have call successors, (72) Word has length 457 [2025-02-05 21:31:22,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:31:22,804 INFO L225 Difference]: With dead ends: 398 [2025-02-05 21:31:22,804 INFO L226 Difference]: Without dead ends: 199 [2025-02-05 21:31:22,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:31:22,809 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:31:22,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 329 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:31:22,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-02-05 21:31:22,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-02-05 21:31:22,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 125 states have (on average 1.504) internal successors, (188), 125 states have internal predecessors, (188), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-02-05 21:31:22,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 332 transitions. [2025-02-05 21:31:22,864 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 332 transitions. Word has length 457 [2025-02-05 21:31:22,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:31:22,866 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 332 transitions. [2025-02-05 21:31:22,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 51.0) internal successors, (102), 2 states have internal predecessors, (102), 2 states have call successors, (72), 2 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 2 states have call successors, (72) [2025-02-05 21:31:22,866 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 332 transitions. [2025-02-05 21:31:22,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-02-05 21:31:22,875 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:31:22,875 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:22,884 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 21:31:23,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 21:31:23,081 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:31:23,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:31:23,081 INFO L85 PathProgramCache]: Analyzing trace with hash 793905545, now seen corresponding path program 1 times [2025-02-05 21:31:23,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:31:23,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910303976] [2025-02-05 21:31:23,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:31:23,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:31:23,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-02-05 21:31:23,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-02-05 21:31:23,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:31:23,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:31:23,501 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-02-05 21:31:23,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:31:23,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910303976] [2025-02-05 21:31:23,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910303976] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:31:23,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:31:23,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:31:23,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037019845] [2025-02-05 21:31:23,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:31:23,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:31:23,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:31:23,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:31:23,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:31:23,505 INFO L87 Difference]: Start difference. First operand 199 states and 332 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-05 21:31:23,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:31:23,585 INFO L93 Difference]: Finished difference Result 556 states and 922 transitions. [2025-02-05 21:31:23,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:31:23,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 457 [2025-02-05 21:31:23,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:31:23,593 INFO L225 Difference]: With dead ends: 556 [2025-02-05 21:31:23,594 INFO L226 Difference]: Without dead ends: 360 [2025-02-05 21:31:23,595 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 21:31:23,596 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 251 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:31:23,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 842 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:31:23,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-02-05 21:31:23,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 216. [2025-02-05 21:31:23,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 142 states have (on average 1.5422535211267605) internal successors, (219), 142 states have internal predecessors, (219), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-02-05 21:31:23,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 363 transitions. [2025-02-05 21:31:23,632 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 363 transitions. Word has length 457 [2025-02-05 21:31:23,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:31:23,634 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 363 transitions. [2025-02-05 21:31:23,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-05 21:31:23,635 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 363 transitions. [2025-02-05 21:31:23,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-02-05 21:31:23,640 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:31:23,641 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:23,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:31:23,641 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:31:23,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:31:23,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1216198296, now seen corresponding path program 1 times [2025-02-05 21:31:23,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:31:23,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426528820] [2025-02-05 21:31:23,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:31:23,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:31:23,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-02-05 21:31:23,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-02-05 21:31:23,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:31:23,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:31:23,882 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-02-05 21:31:23,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:31:23,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426528820] [2025-02-05 21:31:23,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426528820] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:31:23,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:31:23,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:31:23,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824544644] [2025-02-05 21:31:23,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:31:23,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:31:23,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:31:23,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:31:23,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:31:23,884 INFO L87 Difference]: Start difference. First operand 216 states and 363 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-05 21:31:23,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:31:23,937 INFO L93 Difference]: Finished difference Result 573 states and 951 transitions. [2025-02-05 21:31:23,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:31:23,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 457 [2025-02-05 21:31:23,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:31:23,941 INFO L225 Difference]: With dead ends: 573 [2025-02-05 21:31:23,941 INFO L226 Difference]: Without dead ends: 360 [2025-02-05 21:31:23,942 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 21:31:23,943 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 249 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:31:23,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 668 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:31:23,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-02-05 21:31:23,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 216. [2025-02-05 21:31:23,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 142 states have (on average 1.528169014084507) internal successors, (217), 142 states have internal predecessors, (217), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-02-05 21:31:23,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 361 transitions. [2025-02-05 21:31:23,969 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 361 transitions. Word has length 457 [2025-02-05 21:31:23,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:31:23,971 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 361 transitions. [2025-02-05 21:31:23,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-05 21:31:23,972 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 361 transitions. [2025-02-05 21:31:23,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-02-05 21:31:23,978 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:31:23,979 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:23,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:31:23,979 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:31:23,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:31:23,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1004847383, now seen corresponding path program 1 times [2025-02-05 21:31:23,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:31:23,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914981144] [2025-02-05 21:31:23,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:31:23,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:31:24,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-02-05 21:31:24,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-02-05 21:31:24,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:31:24,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:31:24,596 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-02-05 21:31:24,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:31:24,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914981144] [2025-02-05 21:31:24,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914981144] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:31:24,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:31:24,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:31:24,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006343948] [2025-02-05 21:31:24,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:31:24,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:31:24,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:31:24,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:31:24,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:31:24,600 INFO L87 Difference]: Start difference. First operand 216 states and 361 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-05 21:31:25,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:31:25,046 INFO L93 Difference]: Finished difference Result 643 states and 1078 transitions. [2025-02-05 21:31:25,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:31:25,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 457 [2025-02-05 21:31:25,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:31:25,062 INFO L225 Difference]: With dead ends: 643 [2025-02-05 21:31:25,062 INFO L226 Difference]: Without dead ends: 430 [2025-02-05 21:31:25,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:31:25,067 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 262 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:31:25,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 1133 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:31:25,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-02-05 21:31:25,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 413. [2025-02-05 21:31:25,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 266 states have (on average 1.5338345864661653) internal successors, (408), 266 states have internal predecessors, (408), 144 states have call successors, (144), 2 states have call predecessors, (144), 2 states have return successors, (144), 144 states have call predecessors, (144), 144 states have call successors, (144) [2025-02-05 21:31:25,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 696 transitions. [2025-02-05 21:31:25,132 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 696 transitions. Word has length 457 [2025-02-05 21:31:25,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:31:25,134 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 696 transitions. [2025-02-05 21:31:25,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-05 21:31:25,135 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 696 transitions. [2025-02-05 21:31:25,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-02-05 21:31:25,141 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:31:25,141 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:25,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:31:25,141 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:31:25,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:31:25,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1298250390, now seen corresponding path program 1 times [2025-02-05 21:31:25,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:31:25,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887681080] [2025-02-05 21:31:25,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:31:25,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:31:25,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-02-05 21:31:25,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-02-05 21:31:25,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:31:25,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:31:25,613 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-02-05 21:31:25,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:31:25,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887681080] [2025-02-05 21:31:25,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887681080] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:31:25,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:31:25,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:31:25,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101209655] [2025-02-05 21:31:25,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:31:25,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:31:25,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:31:25,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:31:25,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:31:25,616 INFO L87 Difference]: Start difference. First operand 413 states and 696 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-05 21:31:25,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:31:25,670 INFO L93 Difference]: Finished difference Result 957 states and 1625 transitions. [2025-02-05 21:31:25,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:31:25,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 457 [2025-02-05 21:31:25,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:31:25,677 INFO L225 Difference]: With dead ends: 957 [2025-02-05 21:31:25,677 INFO L226 Difference]: Without dead ends: 692 [2025-02-05 21:31:25,678 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 21:31:25,679 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 189 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:31:25,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 713 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:31:25,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2025-02-05 21:31:25,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 690. [2025-02-05 21:31:25,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 470 states have (on average 1.5638297872340425) internal successors, (735), 470 states have internal predecessors, (735), 216 states have call successors, (216), 3 states have call predecessors, (216), 3 states have return successors, (216), 216 states have call predecessors, (216), 216 states have call successors, (216) [2025-02-05 21:31:25,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1167 transitions. [2025-02-05 21:31:25,752 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1167 transitions. Word has length 457 [2025-02-05 21:31:25,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:31:25,753 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 1167 transitions. [2025-02-05 21:31:25,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-05 21:31:25,753 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1167 transitions. [2025-02-05 21:31:25,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-02-05 21:31:25,757 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:31:25,757 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:25,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:31:25,758 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:31:25,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:31:25,758 INFO L85 PathProgramCache]: Analyzing trace with hash 402490089, now seen corresponding path program 1 times [2025-02-05 21:31:25,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:31:25,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550802452] [2025-02-05 21:31:25,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:31:25,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:31:25,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-02-05 21:31:25,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-02-05 21:31:25,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:31:25,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:31:26,549 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-02-05 21:31:26,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:31:26,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550802452] [2025-02-05 21:31:26,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550802452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:31:26,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:31:26,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:31:26,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990998540] [2025-02-05 21:31:26,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:31:26,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:31:26,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:31:26,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:31:26,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:31:26,555 INFO L87 Difference]: Start difference. First operand 690 states and 1167 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-05 21:31:26,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:31:26,869 INFO L93 Difference]: Finished difference Result 1568 states and 2630 transitions. [2025-02-05 21:31:26,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:31:26,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 457 [2025-02-05 21:31:26,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:31:26,879 INFO L225 Difference]: With dead ends: 1568 [2025-02-05 21:31:26,879 INFO L226 Difference]: Without dead ends: 1139 [2025-02-05 21:31:26,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 21:31:26,881 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 307 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:31:26,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 966 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:31:26,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2025-02-05 21:31:26,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1111. [2025-02-05 21:31:26,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 745 states have (on average 1.5463087248322147) internal successors, (1152), 745 states have internal predecessors, (1152), 360 states have call successors, (360), 5 states have call predecessors, (360), 5 states have return successors, (360), 360 states have call predecessors, (360), 360 states have call successors, (360) [2025-02-05 21:31:27,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1872 transitions. [2025-02-05 21:31:27,004 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1872 transitions. Word has length 457 [2025-02-05 21:31:27,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:31:27,005 INFO L471 AbstractCegarLoop]: Abstraction has 1111 states and 1872 transitions. [2025-02-05 21:31:27,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-05 21:31:27,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1872 transitions. [2025-02-05 21:31:27,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-02-05 21:31:27,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:31:27,010 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:27,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:31:27,010 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:31:27,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:31:27,011 INFO L85 PathProgramCache]: Analyzing trace with hash -108044088, now seen corresponding path program 1 times [2025-02-05 21:31:27,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:31:27,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194050318] [2025-02-05 21:31:27,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:31:27,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:31:27,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-02-05 21:31:27,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-02-05 21:31:27,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:31:27,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:31:27,770 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-02-05 21:31:27,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:31:27,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194050318] [2025-02-05 21:31:27,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194050318] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:31:27,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:31:27,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:31:27,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883869203] [2025-02-05 21:31:27,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:31:27,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:31:27,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:31:27,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:31:27,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:31:27,772 INFO L87 Difference]: Start difference. First operand 1111 states and 1872 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-05 21:31:28,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:31:28,588 INFO L93 Difference]: Finished difference Result 3250 states and 5475 transitions. [2025-02-05 21:31:28,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 21:31:28,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 457 [2025-02-05 21:31:28,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:31:28,605 INFO L225 Difference]: With dead ends: 3250 [2025-02-05 21:31:28,605 INFO L226 Difference]: Without dead ends: 2803 [2025-02-05 21:31:28,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:31:28,609 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 1422 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1422 SdHoareTripleChecker+Valid, 1366 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:31:28,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1422 Valid, 1366 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:31:28,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2803 states. [2025-02-05 21:31:28,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2803 to 2085. [2025-02-05 21:31:28,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2085 states, 1510 states have (on average 1.5867549668874172) internal successors, (2396), 1516 states have internal predecessors, (2396), 560 states have call successors, (560), 14 states have call predecessors, (560), 14 states have return successors, (560), 554 states have call predecessors, (560), 560 states have call successors, (560) [2025-02-05 21:31:28,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 3516 transitions. [2025-02-05 21:31:28,793 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 3516 transitions. Word has length 457 [2025-02-05 21:31:28,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:31:28,794 INFO L471 AbstractCegarLoop]: Abstraction has 2085 states and 3516 transitions. [2025-02-05 21:31:28,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-05 21:31:28,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 3516 transitions. [2025-02-05 21:31:28,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-02-05 21:31:28,798 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:31:28,799 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:28,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:31:28,799 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:31:28,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:31:28,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1025146505, now seen corresponding path program 1 times [2025-02-05 21:31:28,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:31:28,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277219381] [2025-02-05 21:31:28,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:31:28,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:31:28,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-02-05 21:31:28,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-02-05 21:31:28,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:31:28,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:31:29,692 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-02-05 21:31:29,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:31:29,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277219381] [2025-02-05 21:31:29,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277219381] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:31:29,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:31:29,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 21:31:29,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359911414] [2025-02-05 21:31:29,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:31:29,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:31:29,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:31:29,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:31:29,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:31:29,695 INFO L87 Difference]: Start difference. First operand 2085 states and 3516 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-05 21:31:31,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:31:31,131 INFO L93 Difference]: Finished difference Result 8573 states and 14406 transitions. [2025-02-05 21:31:31,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:31:31,132 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 457 [2025-02-05 21:31:31,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:31:31,168 INFO L225 Difference]: With dead ends: 8573 [2025-02-05 21:31:31,168 INFO L226 Difference]: Without dead ends: 6865 [2025-02-05 21:31:31,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:31:31,177 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 939 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 410 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 410 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:31:31,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 1441 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [410 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 21:31:31,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6865 states. [2025-02-05 21:31:31,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6865 to 6169. [2025-02-05 21:31:31,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6169 states, 4821 states have (on average 1.6345156606513171) internal successors, (7880), 4843 states have internal predecessors, (7880), 1308 states have call successors, (1308), 39 states have call predecessors, (1308), 39 states have return successors, (1308), 1286 states have call predecessors, (1308), 1308 states have call successors, (1308) [2025-02-05 21:31:31,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6169 states to 6169 states and 10496 transitions. [2025-02-05 21:31:31,602 INFO L78 Accepts]: Start accepts. Automaton has 6169 states and 10496 transitions. Word has length 457 [2025-02-05 21:31:31,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:31:31,603 INFO L471 AbstractCegarLoop]: Abstraction has 6169 states and 10496 transitions. [2025-02-05 21:31:31,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-05 21:31:31,603 INFO L276 IsEmpty]: Start isEmpty. Operand 6169 states and 10496 transitions. [2025-02-05 21:31:31,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-02-05 21:31:31,607 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:31:31,608 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:31,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:31:31,608 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:31:31,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:31:31,608 INFO L85 PathProgramCache]: Analyzing trace with hash 28074152, now seen corresponding path program 1 times [2025-02-05 21:31:31,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:31:31,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016315829] [2025-02-05 21:31:31,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:31:31,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:31:31,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-02-05 21:31:31,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-02-05 21:31:31,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:31:31,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:31:32,242 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 51 proven. 162 refuted. 0 times theorem prover too weak. 10011 trivial. 0 not checked. [2025-02-05 21:31:32,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:31:32,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016315829] [2025-02-05 21:31:32,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016315829] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:31:32,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292875930] [2025-02-05 21:31:32,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:31:32,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:31:32,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:31:32,246 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 21:31:32,247 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 21:31:32,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-02-05 21:31:32,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-02-05 21:31:32,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:31:32,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:31:32,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 21:31:32,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:31:33,895 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 3786 proven. 330 refuted. 0 times theorem prover too weak. 6108 trivial. 0 not checked. [2025-02-05 21:31:33,896 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:31:34,711 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 90 proven. 333 refuted. 0 times theorem prover too weak. 9801 trivial. 0 not checked. [2025-02-05 21:31:34,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292875930] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:31:34,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:31:34,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 11] total 20 [2025-02-05 21:31:34,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627392141] [2025-02-05 21:31:34,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:31:34,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 21:31:34,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:31:34,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 21:31:34,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2025-02-05 21:31:34,714 INFO L87 Difference]: Start difference. First operand 6169 states and 10496 transitions. Second operand has 20 states, 20 states have (on average 9.55) internal successors, (191), 20 states have internal predecessors, (191), 4 states have call successors, (186), 3 states have call predecessors, (186), 7 states have return successors, (188), 4 states have call predecessors, (188), 4 states have call successors, (188) [2025-02-05 21:31:37,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:31:37,743 INFO L93 Difference]: Finished difference Result 11410 states and 18952 transitions. [2025-02-05 21:31:37,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-02-05 21:31:37,744 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 9.55) internal successors, (191), 20 states have internal predecessors, (191), 4 states have call successors, (186), 3 states have call predecessors, (186), 7 states have return successors, (188), 4 states have call predecessors, (188), 4 states have call successors, (188) Word has length 457 [2025-02-05 21:31:37,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:31:37,775 INFO L225 Difference]: With dead ends: 11410 [2025-02-05 21:31:37,775 INFO L226 Difference]: Without dead ends: 5736 [2025-02-05 21:31:37,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 965 GetRequests, 903 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=973, Invalid=2809, Unknown=0, NotChecked=0, Total=3782 [2025-02-05 21:31:37,791 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 1349 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 2305 mSolverCounterSat, 909 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1349 SdHoareTripleChecker+Valid, 2013 SdHoareTripleChecker+Invalid, 3214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 909 IncrementalHoareTripleChecker+Valid, 2305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 21:31:37,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1349 Valid, 2013 Invalid, 3214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [909 Valid, 2305 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 21:31:37,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5736 states. [2025-02-05 21:31:38,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5736 to 2821. [2025-02-05 21:31:38,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2821 states, 1982 states have (on average 1.5116044399596367) internal successors, (2996), 1990 states have internal predecessors, (2996), 784 states have call successors, (784), 54 states have call predecessors, (784), 54 states have return successors, (784), 776 states have call predecessors, (784), 784 states have call successors, (784) [2025-02-05 21:31:38,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2821 states to 2821 states and 4564 transitions. [2025-02-05 21:31:38,111 INFO L78 Accepts]: Start accepts. Automaton has 2821 states and 4564 transitions. Word has length 457 [2025-02-05 21:31:38,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:31:38,112 INFO L471 AbstractCegarLoop]: Abstraction has 2821 states and 4564 transitions. [2025-02-05 21:31:38,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 9.55) internal successors, (191), 20 states have internal predecessors, (191), 4 states have call successors, (186), 3 states have call predecessors, (186), 7 states have return successors, (188), 4 states have call predecessors, (188), 4 states have call successors, (188) [2025-02-05 21:31:38,117 INFO L276 IsEmpty]: Start isEmpty. Operand 2821 states and 4564 transitions. [2025-02-05 21:31:38,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-02-05 21:31:38,120 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:31:38,120 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:38,129 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 21:31:38,321 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 21:31:38,321 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:31:38,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:31:38,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1778920644, now seen corresponding path program 1 times [2025-02-05 21:31:38,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:31:38,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457071319] [2025-02-05 21:31:38,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:31:38,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:31:38,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-02-05 21:31:38,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-02-05 21:31:38,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:31:38,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:31:38,634 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 57 proven. 156 refuted. 0 times theorem prover too weak. 10011 trivial. 0 not checked. [2025-02-05 21:31:38,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:31:38,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457071319] [2025-02-05 21:31:38,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457071319] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:31:38,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488908670] [2025-02-05 21:31:38,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:31:38,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:31:38,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:31:38,637 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 21:31:38,639 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 21:31:38,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-02-05 21:31:38,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-02-05 21:31:38,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:31:38,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:31:38,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 21:31:38,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:31:39,251 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 4061 proven. 156 refuted. 0 times theorem prover too weak. 6007 trivial. 0 not checked. [2025-02-05 21:31:39,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:31:39,604 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 57 proven. 156 refuted. 0 times theorem prover too weak. 10011 trivial. 0 not checked. [2025-02-05 21:31:39,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488908670] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:31:39,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:31:39,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-05 21:31:39,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286108645] [2025-02-05 21:31:39,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:31:39,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:31:39,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:31:39,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:31:39,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:31:39,607 INFO L87 Difference]: Start difference. First operand 2821 states and 4564 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 2 states have call successors, (124), 2 states have call predecessors, (124), 4 states have return successors, (125), 2 states have call predecessors, (125), 2 states have call successors, (125) [2025-02-05 21:31:40,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:31:40,026 INFO L93 Difference]: Finished difference Result 5515 states and 8795 transitions. [2025-02-05 21:31:40,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 21:31:40,027 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 2 states have call successors, (124), 2 states have call predecessors, (124), 4 states have return successors, (125), 2 states have call predecessors, (125), 2 states have call successors, (125) Word has length 459 [2025-02-05 21:31:40,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:31:40,046 INFO L225 Difference]: With dead ends: 5515 [2025-02-05 21:31:40,046 INFO L226 Difference]: Without dead ends: 2975 [2025-02-05 21:31:40,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 925 GetRequests, 915 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:31:40,053 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 149 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:31:40,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 589 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:31:40,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2025-02-05 21:31:40,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 2869. [2025-02-05 21:31:40,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2869 states, 2018 states have (on average 1.4905847373637264) internal successors, (3008), 2026 states have internal predecessors, (3008), 784 states have call successors, (784), 66 states have call predecessors, (784), 66 states have return successors, (784), 776 states have call predecessors, (784), 784 states have call successors, (784) [2025-02-05 21:31:40,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2869 states to 2869 states and 4576 transitions. [2025-02-05 21:31:40,262 INFO L78 Accepts]: Start accepts. Automaton has 2869 states and 4576 transitions. Word has length 459 [2025-02-05 21:31:40,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:31:40,262 INFO L471 AbstractCegarLoop]: Abstraction has 2869 states and 4576 transitions. [2025-02-05 21:31:40,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 2 states have call successors, (124), 2 states have call predecessors, (124), 4 states have return successors, (125), 2 states have call predecessors, (125), 2 states have call successors, (125) [2025-02-05 21:31:40,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2869 states and 4576 transitions. [2025-02-05 21:31:40,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-02-05 21:31:40,266 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:31:40,266 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:40,274 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 21:31:40,467 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 21:31:40,467 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:31:40,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:31:40,468 INFO L85 PathProgramCache]: Analyzing trace with hash 171379611, now seen corresponding path program 1 times [2025-02-05 21:31:40,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:31:40,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232677261] [2025-02-05 21:31:40,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:31:40,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:31:40,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-02-05 21:31:40,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-02-05 21:31:40,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:31:40,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:31:41,264 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 162 proven. 459 refuted. 0 times theorem prover too weak. 9603 trivial. 0 not checked. [2025-02-05 21:31:41,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:31:41,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232677261] [2025-02-05 21:31:41,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232677261] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:31:41,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058084437] [2025-02-05 21:31:41,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:31:41,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:31:41,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:31:41,267 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 21:31:41,269 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 21:31:41,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-02-05 21:31:41,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-02-05 21:31:41,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:31:41,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:31:41,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 1033 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 21:31:41,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:31:43,403 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 4302 proven. 459 refuted. 0 times theorem prover too weak. 5463 trivial. 0 not checked. [2025-02-05 21:31:43,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:31:44,498 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 162 proven. 468 refuted. 0 times theorem prover too weak. 9594 trivial. 0 not checked. [2025-02-05 21:31:44,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058084437] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:31:44,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:31:44,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 13] total 30 [2025-02-05 21:31:44,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013408293] [2025-02-05 21:31:44,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:31:44,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-05 21:31:44,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:31:44,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-05 21:31:44,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=655, Unknown=0, NotChecked=0, Total=870 [2025-02-05 21:31:44,501 INFO L87 Difference]: Start difference. First operand 2869 states and 4576 transitions. Second operand has 30 states, 30 states have (on average 7.9) internal successors, (237), 30 states have internal predecessors, (237), 11 states have call successors, (198), 5 states have call predecessors, (198), 12 states have return successors, (199), 11 states have call predecessors, (199), 11 states have call successors, (199) [2025-02-05 21:31:45,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:31:45,565 INFO L93 Difference]: Finished difference Result 5771 states and 9096 transitions. [2025-02-05 21:31:45,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 21:31:45,566 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 7.9) internal successors, (237), 30 states have internal predecessors, (237), 11 states have call successors, (198), 5 states have call predecessors, (198), 12 states have return successors, (199), 11 states have call predecessors, (199), 11 states have call successors, (199) Word has length 459 [2025-02-05 21:31:45,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:31:45,589 INFO L225 Difference]: With dead ends: 5771 [2025-02-05 21:31:45,589 INFO L226 Difference]: Without dead ends: 3053 [2025-02-05 21:31:45,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 949 GetRequests, 903 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=640, Invalid=1616, Unknown=0, NotChecked=0, Total=2256 [2025-02-05 21:31:45,598 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 1506 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 585 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 585 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:31:45,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1053 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [585 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:31:45,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3053 states. [2025-02-05 21:31:45,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3053 to 2921. [2025-02-05 21:31:45,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2921 states, 2057 states have (on average 1.476421973748177) internal successors, (3037), 2065 states have internal predecessors, (3037), 784 states have call successors, (784), 79 states have call predecessors, (784), 79 states have return successors, (784), 776 states have call predecessors, (784), 784 states have call successors, (784) [2025-02-05 21:31:45,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2921 states to 2921 states and 4605 transitions. [2025-02-05 21:31:45,851 INFO L78 Accepts]: Start accepts. Automaton has 2921 states and 4605 transitions. Word has length 459 [2025-02-05 21:31:45,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:31:45,851 INFO L471 AbstractCegarLoop]: Abstraction has 2921 states and 4605 transitions. [2025-02-05 21:31:45,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.9) internal successors, (237), 30 states have internal predecessors, (237), 11 states have call successors, (198), 5 states have call predecessors, (198), 12 states have return successors, (199), 11 states have call predecessors, (199), 11 states have call successors, (199) [2025-02-05 21:31:45,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2921 states and 4605 transitions. [2025-02-05 21:31:45,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-02-05 21:31:45,854 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:31:45,854 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:45,862 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 21:31:46,055 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,SelfDestructingSolverStorable10 [2025-02-05 21:31:46,055 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:31:46,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:31:46,056 INFO L85 PathProgramCache]: Analyzing trace with hash -69160518, now seen corresponding path program 1 times [2025-02-05 21:31:46,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:31:46,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268489275] [2025-02-05 21:31:46,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:31:46,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:31:46,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-02-05 21:31:46,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-02-05 21:31:46,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:31:46,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:31:46,200 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-02-05 21:31:46,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:31:46,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268489275] [2025-02-05 21:31:46,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268489275] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:31:46,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:31:46,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:31:46,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936913570] [2025-02-05 21:31:46,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:31:46,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:31:46,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:31:46,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:31:46,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:31:46,201 INFO L87 Difference]: Start difference. First operand 2921 states and 4605 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-05 21:31:46,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:31:46,366 INFO L93 Difference]: Finished difference Result 5667 states and 8942 transitions. [2025-02-05 21:31:46,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:31:46,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 459 [2025-02-05 21:31:46,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:31:46,379 INFO L225 Difference]: With dead ends: 5667 [2025-02-05 21:31:46,379 INFO L226 Difference]: Without dead ends: 2921 [2025-02-05 21:31:46,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 21:31:46,387 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 197 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:31:46,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 312 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:31:46,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2025-02-05 21:31:46,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 2921. [2025-02-05 21:31:46,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2921 states, 2057 states have (on average 1.4705882352941178) internal successors, (3025), 2065 states have internal predecessors, (3025), 784 states have call successors, (784), 79 states have call predecessors, (784), 79 states have return successors, (784), 776 states have call predecessors, (784), 784 states have call successors, (784) [2025-02-05 21:31:46,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2921 states to 2921 states and 4593 transitions. [2025-02-05 21:31:46,791 INFO L78 Accepts]: Start accepts. Automaton has 2921 states and 4593 transitions. Word has length 459 [2025-02-05 21:31:46,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:31:46,792 INFO L471 AbstractCegarLoop]: Abstraction has 2921 states and 4593 transitions. [2025-02-05 21:31:46,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-05 21:31:46,792 INFO L276 IsEmpty]: Start isEmpty. Operand 2921 states and 4593 transitions. [2025-02-05 21:31:46,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-02-05 21:31:46,798 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:31:46,798 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:46,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 21:31:46,799 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:31:46,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:31:46,802 INFO L85 PathProgramCache]: Analyzing trace with hash -2058958588, now seen corresponding path program 1 times [2025-02-05 21:31:46,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:31:46,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155485002] [2025-02-05 21:31:46,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:31:46,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:31:46,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-02-05 21:31:46,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-02-05 21:31:46,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:31:46,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:31:48,477 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 117 proven. 96 refuted. 0 times theorem prover too weak. 10011 trivial. 0 not checked. [2025-02-05 21:31:48,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:31:48,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155485002] [2025-02-05 21:31:48,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155485002] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:31:48,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468685] [2025-02-05 21:31:48,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:31:48,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:31:48,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:31:48,480 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:31:48,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 21:31:48,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-02-05 21:31:48,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-02-05 21:31:48,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:31:48,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:31:48,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 1035 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-05 21:31:48,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:31:51,774 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 6282 proven. 249 refuted. 0 times theorem prover too weak. 3693 trivial. 0 not checked. [2025-02-05 21:31:51,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:31:56,308 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 372 proven. 258 refuted. 0 times theorem prover too weak. 9594 trivial. 0 not checked. [2025-02-05 21:31:56,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468685] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:31:56,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:31:56,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 36 [2025-02-05 21:31:56,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438511913] [2025-02-05 21:31:56,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:31:56,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-05 21:31:56,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:31:56,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-05 21:31:56,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1042, Unknown=0, NotChecked=0, Total=1260 [2025-02-05 21:31:56,311 INFO L87 Difference]: Start difference. First operand 2921 states and 4593 transitions. Second operand has 36 states, 36 states have (on average 6.25) internal successors, (225), 35 states have internal predecessors, (225), 10 states have call successors, (142), 4 states have call predecessors, (142), 10 states have return successors, (143), 11 states have call predecessors, (143), 10 states have call successors, (143) [2025-02-05 21:32:03,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 21:32:31,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:32:31,756 INFO L93 Difference]: Finished difference Result 33665 states and 49868 transitions. [2025-02-05 21:32:31,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2025-02-05 21:32:31,757 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 6.25) internal successors, (225), 35 states have internal predecessors, (225), 10 states have call successors, (142), 4 states have call predecessors, (142), 10 states have return successors, (143), 11 states have call predecessors, (143), 10 states have call successors, (143) Word has length 460 [2025-02-05 21:32:31,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:32:31,845 INFO L225 Difference]: With dead ends: 33665 [2025-02-05 21:32:31,845 INFO L226 Difference]: Without dead ends: 31133 [2025-02-05 21:32:31,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1078 GetRequests, 912 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10658 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=6010, Invalid=22046, Unknown=0, NotChecked=0, Total=28056 [2025-02-05 21:32:31,867 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 4626 mSDsluCounter, 3960 mSDsCounter, 0 mSdLazyCounter, 5250 mSolverCounterSat, 3287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4662 SdHoareTripleChecker+Valid, 4486 SdHoareTripleChecker+Invalid, 8537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3287 IncrementalHoareTripleChecker+Valid, 5250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:32:31,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4662 Valid, 4486 Invalid, 8537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3287 Valid, 5250 Invalid, 0 Unknown, 0 Unchecked, 14.3s Time] [2025-02-05 21:32:31,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31133 states. [2025-02-05 21:32:33,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31133 to 6225. [2025-02-05 21:32:33,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6225 states, 4828 states have (on average 1.5186412593206298) internal successors, (7332), 4848 states have internal predecessors, (7332), 1208 states have call successors, (1208), 188 states have call predecessors, (1208), 188 states have return successors, (1208), 1188 states have call predecessors, (1208), 1208 states have call successors, (1208) [2025-02-05 21:32:33,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6225 states to 6225 states and 9748 transitions. [2025-02-05 21:32:33,399 INFO L78 Accepts]: Start accepts. Automaton has 6225 states and 9748 transitions. Word has length 460 [2025-02-05 21:32:33,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:32:33,400 INFO L471 AbstractCegarLoop]: Abstraction has 6225 states and 9748 transitions. [2025-02-05 21:32:33,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 6.25) internal successors, (225), 35 states have internal predecessors, (225), 10 states have call successors, (142), 4 states have call predecessors, (142), 10 states have return successors, (143), 11 states have call predecessors, (143), 10 states have call successors, (143) [2025-02-05 21:32:33,401 INFO L276 IsEmpty]: Start isEmpty. Operand 6225 states and 9748 transitions. [2025-02-05 21:32:33,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-02-05 21:32:33,404 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:32:33,404 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:32:33,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 21:32:33,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-05 21:32:33,609 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:32:33,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:32:33,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1729192827, now seen corresponding path program 1 times [2025-02-05 21:32:33,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:32:33,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730422523] [2025-02-05 21:32:33,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:32:33,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:32:33,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-02-05 21:32:33,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-02-05 21:32:33,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:32:33,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:32:35,785 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-02-05 21:32:35,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:32:35,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730422523] [2025-02-05 21:32:35,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730422523] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:32:35,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:32:35,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 21:32:35,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920055174] [2025-02-05 21:32:35,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:32:35,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 21:32:35,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:32:35,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 21:32:35,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-02-05 21:32:35,787 INFO L87 Difference]: Start difference. First operand 6225 states and 9748 transitions. Second operand has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 5 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 5 states have call predecessors, (72), 5 states have call successors, (72)