./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-42.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 5e104cbbe92849db5f4f231224a2ac2d2f04205e465893be255099ba4190cda0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:24:01,928 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:24:01,985 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:24:01,990 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:24:01,990 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:24:02,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:24:02,015 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:24:02,015 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:24:02,015 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:24:02,016 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:24:02,017 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:24:02,017 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:24:02,017 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:24:02,017 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:24:02,018 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:24:02,018 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:24:02,018 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:24:02,018 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:24:02,018 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:24:02,018 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:24:02,018 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:24:02,018 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:24:02,019 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:24:02,019 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:24:02,019 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:24:02,019 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:24:02,019 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:24:02,019 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:24:02,019 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:24:02,019 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:24:02,019 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:24:02,019 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:24:02,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:24:02,020 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:24:02,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:24:02,020 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:24:02,020 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:24:02,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:24:02,020 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:24:02,020 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:24:02,020 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:24:02,020 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:24:02,020 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:24:02,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:24:02,021 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:24:02,021 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:24:02,021 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:24:02,021 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:24:02,021 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 -> 5e104cbbe92849db5f4f231224a2ac2d2f04205e465893be255099ba4190cda0 [2025-01-09 14:24:02,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:24:02,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:24:02,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:24:02,225 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:24:02,225 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:24:02,226 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-42.i [2025-01-09 14:24:03,336 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c6bedb1b9/0c042869e2cc42dca3616b7824b9db5d/FLAGd63d7b5ec [2025-01-09 14:24:03,566 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:24:03,567 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-42.i [2025-01-09 14:24:03,574 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c6bedb1b9/0c042869e2cc42dca3616b7824b9db5d/FLAGd63d7b5ec [2025-01-09 14:24:03,905 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c6bedb1b9/0c042869e2cc42dca3616b7824b9db5d [2025-01-09 14:24:03,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:24:03,907 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:24:03,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:24:03,908 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:24:03,910 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:24:03,911 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:24:03" (1/1) ... [2025-01-09 14:24:03,911 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@186b46e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:03, skipping insertion in model container [2025-01-09 14:24:03,911 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:24:03" (1/1) ... [2025-01-09 14:24:03,927 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:24:04,019 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_operatoramount_amount250_file-42.i[916,929] [2025-01-09 14:24:04,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:24:04,115 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:24:04,121 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_operatoramount_amount250_file-42.i[916,929] [2025-01-09 14:24:04,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:24:04,189 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:24:04,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:04 WrapperNode [2025-01-09 14:24:04,191 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:24:04,191 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:24:04,192 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:24:04,192 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:24:04,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:04" (1/1) ... [2025-01-09 14:24:04,216 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:04" (1/1) ... [2025-01-09 14:24:04,265 INFO L138 Inliner]: procedures = 26, calls = 56, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 423 [2025-01-09 14:24:04,265 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:24:04,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:24:04,266 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:24:04,266 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:24:04,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:04" (1/1) ... [2025-01-09 14:24:04,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:04" (1/1) ... [2025-01-09 14:24:04,287 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:04" (1/1) ... [2025-01-09 14:24:04,319 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 14:24:04,319 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:04" (1/1) ... [2025-01-09 14:24:04,319 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:04" (1/1) ... [2025-01-09 14:24:04,343 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:04" (1/1) ... [2025-01-09 14:24:04,346 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:04" (1/1) ... [2025-01-09 14:24:04,351 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:04" (1/1) ... [2025-01-09 14:24:04,358 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:04" (1/1) ... [2025-01-09 14:24:04,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:04" (1/1) ... [2025-01-09 14:24:04,371 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:24:04,372 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:24:04,372 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:24:04,372 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:24:04,373 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:04" (1/1) ... [2025-01-09 14:24:04,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:24:04,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:24:04,394 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 14:24:04,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 14:24:04,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:24:04,417 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:24:04,417 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:24:04,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:24:04,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:24:04,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:24:04,513 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:24:04,514 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:24:05,178 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-01-09 14:24:05,179 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:24:05,187 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:24:05,187 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:24:05,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:24:05 BoogieIcfgContainer [2025-01-09 14:24:05,187 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:24:05,189 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:24:05,189 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:24:05,192 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:24:05,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:24:03" (1/3) ... [2025-01-09 14:24:05,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510a6dd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:24:05, skipping insertion in model container [2025-01-09 14:24:05,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:04" (2/3) ... [2025-01-09 14:24:05,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510a6dd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:24:05, skipping insertion in model container [2025-01-09 14:24:05,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:24:05" (3/3) ... [2025-01-09 14:24:05,195 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-42.i [2025-01-09 14:24:05,205 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:24:05,207 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-42.i that has 2 procedures, 174 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:24:05,249 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:24:05,259 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;@72fbee17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:24:05,260 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:24:05,264 INFO L276 IsEmpty]: Start isEmpty. Operand has 174 states, 128 states have (on average 1.53125) internal successors, (196), 129 states have internal predecessors, (196), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-01-09 14:24:05,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2025-01-09 14:24:05,277 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:05,278 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:24:05,278 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:24:05,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:24:05,282 INFO L85 PathProgramCache]: Analyzing trace with hash 341385810, now seen corresponding path program 1 times [2025-01-09 14:24:05,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:24:05,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200330564] [2025-01-09 14:24:05,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:05,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:24:05,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-01-09 14:24:05,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-01-09 14:24:05,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:05,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:05,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2025-01-09 14:24:05,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:24:05,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200330564] [2025-01-09 14:24:05,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200330564] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:24:05,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379439771] [2025-01-09 14:24:05,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:05,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:24:05,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:24:05,747 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:24:05,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 14:24:05,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-01-09 14:24:05,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-01-09 14:24:05,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:05,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:05,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:24:05,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:24:06,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2025-01-09 14:24:06,002 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:24:06,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379439771] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:24:06,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:24:06,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:24:06,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053460791] [2025-01-09 14:24:06,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:24:06,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:24:06,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:24:06,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:24:06,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:24:06,035 INFO L87 Difference]: Start difference. First operand has 174 states, 128 states have (on average 1.53125) internal successors, (196), 129 states have internal predecessors, (196), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) [2025-01-09 14:24:06,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:24:06,064 INFO L93 Difference]: Finished difference Result 342 states and 602 transitions. [2025-01-09 14:24:06,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:24:06,065 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) Word has length 285 [2025-01-09 14:24:06,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:24:06,070 INFO L225 Difference]: With dead ends: 342 [2025-01-09 14:24:06,071 INFO L226 Difference]: Without dead ends: 171 [2025-01-09 14:24:06,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 286 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-01-09 14:24:06,075 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:24:06,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:24:06,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-01-09 14:24:06,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2025-01-09 14:24:06,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 126 states have (on average 1.492063492063492) internal successors, (188), 126 states have internal predecessors, (188), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-01-09 14:24:06,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 274 transitions. [2025-01-09 14:24:06,115 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 274 transitions. Word has length 285 [2025-01-09 14:24:06,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:24:06,116 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 274 transitions. [2025-01-09 14:24:06,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) [2025-01-09 14:24:06,117 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 274 transitions. [2025-01-09 14:24:06,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-01-09 14:24:06,122 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:06,123 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:24:06,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:24:06,328 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-01-09 14:24:06,328 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:24:06,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:24:06,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1957695951, now seen corresponding path program 1 times [2025-01-09 14:24:06,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:24:06,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084507049] [2025-01-09 14:24:06,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:06,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:24:06,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-01-09 14:24:06,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-01-09 14:24:06,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:06,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:06,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:24:06,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:24:06,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084507049] [2025-01-09 14:24:06,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084507049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:24:06,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:24:06,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:24:06,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772786105] [2025-01-09 14:24:06,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:24:06,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:24:06,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:24:06,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:24:06,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:24:06,969 INFO L87 Difference]: Start difference. First operand 171 states and 274 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:24:07,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:24:07,231 INFO L93 Difference]: Finished difference Result 508 states and 817 transitions. [2025-01-09 14:24:07,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:24:07,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 286 [2025-01-09 14:24:07,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:24:07,235 INFO L225 Difference]: With dead ends: 508 [2025-01-09 14:24:07,235 INFO L226 Difference]: Without dead ends: 340 [2025-01-09 14:24:07,239 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-01-09 14:24:07,241 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 186 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:24:07,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 797 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:24:07,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-01-09 14:24:07,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 258. [2025-01-09 14:24:07,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 169 states have (on average 1.4201183431952662) internal successors, (240), 169 states have internal predecessors, (240), 86 states have call successors, (86), 2 states have call predecessors, (86), 2 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 14:24:07,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 412 transitions. [2025-01-09 14:24:07,282 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 412 transitions. Word has length 286 [2025-01-09 14:24:07,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:24:07,283 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 412 transitions. [2025-01-09 14:24:07,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:24:07,283 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 412 transitions. [2025-01-09 14:24:07,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2025-01-09 14:24:07,286 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:07,286 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:24:07,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:24:07,286 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:24:07,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:24:07,287 INFO L85 PathProgramCache]: Analyzing trace with hash 770601338, now seen corresponding path program 1 times [2025-01-09 14:24:07,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:24:07,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850560229] [2025-01-09 14:24:07,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:07,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:24:07,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-01-09 14:24:07,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-01-09 14:24:07,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:07,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:07,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:24:07,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:24:07,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850560229] [2025-01-09 14:24:07,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850560229] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:24:07,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:24:07,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:24:07,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864502935] [2025-01-09 14:24:07,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:24:07,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:24:07,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:24:07,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:24:07,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:24:07,607 INFO L87 Difference]: Start difference. First operand 258 states and 412 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:24:07,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:24:07,702 INFO L93 Difference]: Finished difference Result 527 states and 841 transitions. [2025-01-09 14:24:07,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:24:07,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 288 [2025-01-09 14:24:07,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:24:07,706 INFO L225 Difference]: With dead ends: 527 [2025-01-09 14:24:07,706 INFO L226 Difference]: Without dead ends: 359 [2025-01-09 14:24:07,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:24:07,707 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 151 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:24:07,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 535 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:24:07,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-01-09 14:24:07,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 356. [2025-01-09 14:24:07,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 252 states have (on average 1.4563492063492063) internal successors, (367), 253 states have internal predecessors, (367), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 14:24:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 567 transitions. [2025-01-09 14:24:07,731 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 567 transitions. Word has length 288 [2025-01-09 14:24:07,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:24:07,732 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 567 transitions. [2025-01-09 14:24:07,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:24:07,732 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 567 transitions. [2025-01-09 14:24:07,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2025-01-09 14:24:07,735 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:07,735 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:24:07,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:24:07,735 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:24:07,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:24:07,736 INFO L85 PathProgramCache]: Analyzing trace with hash 989456056, now seen corresponding path program 1 times [2025-01-09 14:24:07,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:24:07,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078181294] [2025-01-09 14:24:07,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:07,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:24:07,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-01-09 14:24:07,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-01-09 14:24:07,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:07,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:16,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:24:16,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:24:16,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078181294] [2025-01-09 14:24:16,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078181294] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:24:16,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:24:16,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:24:16,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809605031] [2025-01-09 14:24:16,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:24:16,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:24:16,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:24:16,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:24:16,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:24:16,146 INFO L87 Difference]: Start difference. First operand 356 states and 567 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:24:17,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:24:17,253 INFO L93 Difference]: Finished difference Result 924 states and 1483 transitions. [2025-01-09 14:24:17,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 14:24:17,254 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 288 [2025-01-09 14:24:17,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:24:17,261 INFO L225 Difference]: With dead ends: 924 [2025-01-09 14:24:17,261 INFO L226 Difference]: Without dead ends: 658 [2025-01-09 14:24:17,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:24:17,263 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 239 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:24:17,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 1358 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:24:17,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2025-01-09 14:24:17,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 400. [2025-01-09 14:24:17,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 296 states have (on average 1.4932432432432432) internal successors, (442), 297 states have internal predecessors, (442), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 14:24:17,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 642 transitions. [2025-01-09 14:24:17,305 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 642 transitions. Word has length 288 [2025-01-09 14:24:17,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:24:17,306 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 642 transitions. [2025-01-09 14:24:17,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:24:17,307 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 642 transitions. [2025-01-09 14:24:17,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2025-01-09 14:24:17,310 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:17,311 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:24:17,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:24:17,311 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:24:17,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:24:17,312 INFO L85 PathProgramCache]: Analyzing trace with hash 171807606, now seen corresponding path program 1 times [2025-01-09 14:24:17,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:24:17,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375271102] [2025-01-09 14:24:17,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:17,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:24:17,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-01-09 14:24:17,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-01-09 14:24:17,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:17,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:17,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:24:17,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:24:17,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375271102] [2025-01-09 14:24:17,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375271102] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:24:17,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:24:17,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:24:17,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511452926] [2025-01-09 14:24:17,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:24:17,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:24:17,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:24:17,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:24:17,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:24:17,799 INFO L87 Difference]: Start difference. First operand 400 states and 642 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:24:18,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:24:18,008 INFO L93 Difference]: Finished difference Result 1100 states and 1752 transitions. [2025-01-09 14:24:18,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:24:18,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 288 [2025-01-09 14:24:18,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:24:18,013 INFO L225 Difference]: With dead ends: 1100 [2025-01-09 14:24:18,014 INFO L226 Difference]: Without dead ends: 797 [2025-01-09 14:24:18,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:24:18,015 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 373 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:24:18,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 875 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:24:18,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2025-01-09 14:24:18,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 791. [2025-01-09 14:24:18,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 613 states have (on average 1.495921696574225) internal successors, (917), 617 states have internal predecessors, (917), 169 states have call successors, (169), 8 states have call predecessors, (169), 8 states have return successors, (169), 165 states have call predecessors, (169), 169 states have call successors, (169) [2025-01-09 14:24:18,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1255 transitions. [2025-01-09 14:24:18,072 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1255 transitions. Word has length 288 [2025-01-09 14:24:18,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:24:18,073 INFO L471 AbstractCegarLoop]: Abstraction has 791 states and 1255 transitions. [2025-01-09 14:24:18,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:24:18,073 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1255 transitions. [2025-01-09 14:24:18,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2025-01-09 14:24:18,076 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:18,076 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:24:18,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:24:18,076 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:24:18,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:24:18,077 INFO L85 PathProgramCache]: Analyzing trace with hash 312356216, now seen corresponding path program 1 times [2025-01-09 14:24:18,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:24:18,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115443774] [2025-01-09 14:24:18,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:18,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:24:18,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-01-09 14:24:18,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-01-09 14:24:18,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:18,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:18,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:24:18,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:24:18,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115443774] [2025-01-09 14:24:18,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115443774] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:24:18,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:24:18,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:24:18,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325304160] [2025-01-09 14:24:18,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:24:18,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:24:18,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:24:18,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:24:18,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:24:18,165 INFO L87 Difference]: Start difference. First operand 791 states and 1255 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:24:18,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:24:18,246 INFO L93 Difference]: Finished difference Result 2051 states and 3233 transitions. [2025-01-09 14:24:18,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:24:18,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 288 [2025-01-09 14:24:18,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:24:18,255 INFO L225 Difference]: With dead ends: 2051 [2025-01-09 14:24:18,256 INFO L226 Difference]: Without dead ends: 1361 [2025-01-09 14:24:18,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:24:18,260 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 239 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:24:18,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 687 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:24:18,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2025-01-09 14:24:18,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 921. [2025-01-09 14:24:18,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 743 states have (on average 1.5141318977119784) internal successors, (1125), 747 states have internal predecessors, (1125), 169 states have call successors, (169), 8 states have call predecessors, (169), 8 states have return successors, (169), 165 states have call predecessors, (169), 169 states have call successors, (169) [2025-01-09 14:24:18,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1463 transitions. [2025-01-09 14:24:18,337 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1463 transitions. Word has length 288 [2025-01-09 14:24:18,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:24:18,338 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1463 transitions. [2025-01-09 14:24:18,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:24:18,338 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1463 transitions. [2025-01-09 14:24:18,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2025-01-09 14:24:18,342 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:18,342 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:24:18,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:24:18,343 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:24:18,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:24:18,343 INFO L85 PathProgramCache]: Analyzing trace with hash 971887738, now seen corresponding path program 1 times [2025-01-09 14:24:18,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:24:18,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226912524] [2025-01-09 14:24:18,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:18,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:24:18,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-01-09 14:24:18,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-01-09 14:24:18,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:18,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:18,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:24:18,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:24:18,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226912524] [2025-01-09 14:24:18,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226912524] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:24:18,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:24:18,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:24:18,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419195441] [2025-01-09 14:24:18,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:24:18,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:24:18,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:24:18,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:24:18,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:24:18,608 INFO L87 Difference]: Start difference. First operand 921 states and 1463 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:24:18,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:24:18,679 INFO L93 Difference]: Finished difference Result 2463 states and 3921 transitions. [2025-01-09 14:24:18,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:24:18,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 288 [2025-01-09 14:24:18,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:24:18,689 INFO L225 Difference]: With dead ends: 2463 [2025-01-09 14:24:18,689 INFO L226 Difference]: Without dead ends: 1649 [2025-01-09 14:24:18,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:24:18,693 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 164 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:24:18,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 635 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:24:18,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2025-01-09 14:24:18,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1605. [2025-01-09 14:24:18,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1605 states, 1295 states have (on average 1.5127413127413127) internal successors, (1959), 1303 states have internal predecessors, (1959), 295 states have call successors, (295), 14 states have call predecessors, (295), 14 states have return successors, (295), 287 states have call predecessors, (295), 295 states have call successors, (295) [2025-01-09 14:24:18,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 2549 transitions. [2025-01-09 14:24:18,802 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 2549 transitions. Word has length 288 [2025-01-09 14:24:18,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:24:18,803 INFO L471 AbstractCegarLoop]: Abstraction has 1605 states and 2549 transitions. [2025-01-09 14:24:18,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:24:18,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 2549 transitions. [2025-01-09 14:24:18,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-01-09 14:24:18,807 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:18,807 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:24:18,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:24:18,807 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:24:18,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:24:18,808 INFO L85 PathProgramCache]: Analyzing trace with hash 868296674, now seen corresponding path program 1 times [2025-01-09 14:24:18,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:24:18,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96880384] [2025-01-09 14:24:18,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:18,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:24:18,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-01-09 14:24:19,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-01-09 14:24:19,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:19,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:19,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 18 proven. 108 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-01-09 14:24:19,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:24:19,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96880384] [2025-01-09 14:24:19,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96880384] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:24:19,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227936976] [2025-01-09 14:24:19,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:19,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:24:19,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:24:19,297 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:24:19,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 14:24:19,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-01-09 14:24:19,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-01-09 14:24:19,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:19,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:19,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:24:19,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:24:19,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 1638 proven. 84 refuted. 0 times theorem prover too weak. 1890 trivial. 0 not checked. [2025-01-09 14:24:19,811 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:24:20,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 42 proven. 84 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-01-09 14:24:20,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227936976] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:24:20,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:24:20,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-01-09 14:24:20,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981732512] [2025-01-09 14:24:20,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:24:20,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:24:20,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:24:20,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:24:20,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:24:20,080 INFO L87 Difference]: Start difference. First operand 1605 states and 2549 transitions. Second operand has 9 states, 9 states have (on average 19.333333333333332) internal successors, (174), 9 states have internal predecessors, (174), 4 states have call successors, (107), 2 states have call predecessors, (107), 4 states have return successors, (109), 4 states have call predecessors, (109), 4 states have call successors, (109) [2025-01-09 14:24:20,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:24:20,418 INFO L93 Difference]: Finished difference Result 2229 states and 3528 transitions. [2025-01-09 14:24:20,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 14:24:20,418 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.333333333333332) internal successors, (174), 9 states have internal predecessors, (174), 4 states have call successors, (107), 2 states have call predecessors, (107), 4 states have return successors, (109), 4 states have call predecessors, (109), 4 states have call successors, (109) Word has length 289 [2025-01-09 14:24:20,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:24:20,423 INFO L225 Difference]: With dead ends: 2229 [2025-01-09 14:24:20,423 INFO L226 Difference]: Without dead ends: 713 [2025-01-09 14:24:20,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 575 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:24:20,426 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 548 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:24:20,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 516 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:24:20,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2025-01-09 14:24:20,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 704. [2025-01-09 14:24:20,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 550 states have (on average 1.44) internal successors, (792), 552 states have internal predecessors, (792), 141 states have call successors, (141), 12 states have call predecessors, (141), 12 states have return successors, (141), 139 states have call predecessors, (141), 141 states have call successors, (141) [2025-01-09 14:24:20,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1074 transitions. [2025-01-09 14:24:20,457 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1074 transitions. Word has length 289 [2025-01-09 14:24:20,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:24:20,457 INFO L471 AbstractCegarLoop]: Abstraction has 704 states and 1074 transitions. [2025-01-09 14:24:20,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.333333333333332) internal successors, (174), 9 states have internal predecessors, (174), 4 states have call successors, (107), 2 states have call predecessors, (107), 4 states have return successors, (109), 4 states have call predecessors, (109), 4 states have call successors, (109) [2025-01-09 14:24:20,458 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1074 transitions. [2025-01-09 14:24:20,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2025-01-09 14:24:20,460 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:20,460 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:24:20,468 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-01-09 14:24:20,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:24:20,661 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:24:20,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:24:20,662 INFO L85 PathProgramCache]: Analyzing trace with hash -576677458, now seen corresponding path program 1 times [2025-01-09 14:24:20,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:24:20,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186892930] [2025-01-09 14:24:20,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:20,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:24:20,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-01-09 14:24:20,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-01-09 14:24:20,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:20,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:21,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 78 proven. 48 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-01-09 14:24:21,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:24:21,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186892930] [2025-01-09 14:24:21,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186892930] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:24:21,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367679733] [2025-01-09 14:24:21,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:21,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:24:21,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:24:21,141 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:24:21,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 14:24:21,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-01-09 14:24:21,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-01-09 14:24:21,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:21,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:21,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:24:21,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:24:21,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 1758 proven. 48 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2025-01-09 14:24:21,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:24:21,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 78 proven. 48 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-01-09 14:24:21,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367679733] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:24:21,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:24:21,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 14:24:21,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873601979] [2025-01-09 14:24:21,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:24:21,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:24:21,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:24:21,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:24:21,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:24:21,746 INFO L87 Difference]: Start difference. First operand 704 states and 1074 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 3 states have call successors, (75), 2 states have call predecessors, (75), 4 states have return successors, (76), 3 states have call predecessors, (76), 3 states have call successors, (76) [2025-01-09 14:24:22,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:24:22,012 INFO L93 Difference]: Finished difference Result 1333 states and 2029 transitions. [2025-01-09 14:24:22,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:24:22,012 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 3 states have call successors, (75), 2 states have call predecessors, (75), 4 states have return successors, (76), 3 states have call predecessors, (76), 3 states have call successors, (76) Word has length 290 [2025-01-09 14:24:22,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:24:22,018 INFO L225 Difference]: With dead ends: 1333 [2025-01-09 14:24:22,018 INFO L226 Difference]: Without dead ends: 722 [2025-01-09 14:24:22,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 577 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:24:22,020 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 317 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:24:22,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 523 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:24:22,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2025-01-09 14:24:22,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 716. [2025-01-09 14:24:22,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 559 states have (on average 1.4096601073345258) internal successors, (788), 561 states have internal predecessors, (788), 141 states have call successors, (141), 15 states have call predecessors, (141), 15 states have return successors, (141), 139 states have call predecessors, (141), 141 states have call successors, (141) [2025-01-09 14:24:22,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1070 transitions. [2025-01-09 14:24:22,072 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1070 transitions. Word has length 290 [2025-01-09 14:24:22,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:24:22,072 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 1070 transitions. [2025-01-09 14:24:22,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 3 states have call successors, (75), 2 states have call predecessors, (75), 4 states have return successors, (76), 3 states have call predecessors, (76), 3 states have call successors, (76) [2025-01-09 14:24:22,073 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1070 transitions. [2025-01-09 14:24:22,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2025-01-09 14:24:22,075 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:22,076 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:24:22,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 14:24:22,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:24:22,277 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:24:22,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:24:22,277 INFO L85 PathProgramCache]: Analyzing trace with hash 478964907, now seen corresponding path program 1 times [2025-01-09 14:24:22,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:24:22,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079179033] [2025-01-09 14:24:22,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:22,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:24:22,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-01-09 14:24:22,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-01-09 14:24:22,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:22,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:23,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 105 proven. 21 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-01-09 14:24:23,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:24:23,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079179033] [2025-01-09 14:24:23,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079179033] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:24:23,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58922178] [2025-01-09 14:24:23,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:23,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:24:23,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:24:23,256 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:24:23,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 14:24:23,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-01-09 14:24:23,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-01-09 14:24:23,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:23,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:23,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 14:24:23,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:24:23,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 2033 proven. 117 refuted. 0 times theorem prover too weak. 1462 trivial. 0 not checked. [2025-01-09 14:24:23,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:24:24,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 129 proven. 120 refuted. 0 times theorem prover too weak. 3363 trivial. 0 not checked. [2025-01-09 14:24:24,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58922178] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:24:24,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:24:24,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2025-01-09 14:24:24,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985924384] [2025-01-09 14:24:24,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:24:24,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 14:24:24,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:24:24,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 14:24:24,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2025-01-09 14:24:24,324 INFO L87 Difference]: Start difference. First operand 716 states and 1070 transitions. Second operand has 18 states, 18 states have (on average 7.722222222222222) internal successors, (139), 18 states have internal predecessors, (139), 5 states have call successors, (119), 3 states have call predecessors, (119), 7 states have return successors, (120), 5 states have call predecessors, (120), 5 states have call successors, (120) [2025-01-09 14:24:26,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:24:26,593 INFO L93 Difference]: Finished difference Result 2318 states and 3402 transitions. [2025-01-09 14:24:26,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-01-09 14:24:26,594 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.722222222222222) internal successors, (139), 18 states have internal predecessors, (139), 5 states have call successors, (119), 3 states have call predecessors, (119), 7 states have return successors, (120), 5 states have call predecessors, (120), 5 states have call successors, (120) Word has length 291 [2025-01-09 14:24:26,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:24:26,601 INFO L225 Difference]: With dead ends: 2318 [2025-01-09 14:24:26,602 INFO L226 Difference]: Without dead ends: 1711 [2025-01-09 14:24:26,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 581 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2067 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1320, Invalid=4842, Unknown=0, NotChecked=0, Total=6162 [2025-01-09 14:24:26,605 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 4250 mSDsluCounter, 1680 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 1266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4260 SdHoareTripleChecker+Valid, 1964 SdHoareTripleChecker+Invalid, 2355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1266 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:24:26,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4260 Valid, 1964 Invalid, 2355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1266 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 14:24:26,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2025-01-09 14:24:26,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 876. [2025-01-09 14:24:26,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 663 states have (on average 1.3514328808446456) internal successors, (896), 666 states have internal predecessors, (896), 184 states have call successors, (184), 28 states have call predecessors, (184), 28 states have return successors, (184), 181 states have call predecessors, (184), 184 states have call successors, (184) [2025-01-09 14:24:26,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1264 transitions. [2025-01-09 14:24:26,664 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1264 transitions. Word has length 291 [2025-01-09 14:24:26,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:24:26,665 INFO L471 AbstractCegarLoop]: Abstraction has 876 states and 1264 transitions. [2025-01-09 14:24:26,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.722222222222222) internal successors, (139), 18 states have internal predecessors, (139), 5 states have call successors, (119), 3 states have call predecessors, (119), 7 states have return successors, (120), 5 states have call predecessors, (120), 5 states have call successors, (120) [2025-01-09 14:24:26,665 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1264 transitions. [2025-01-09 14:24:26,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2025-01-09 14:24:26,667 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:26,668 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:24:26,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 14:24:26,868 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,SelfDestructingSolverStorable9 [2025-01-09 14:24:26,868 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:24:26,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:24:26,869 INFO L85 PathProgramCache]: Analyzing trace with hash -892842391, now seen corresponding path program 1 times [2025-01-09 14:24:26,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:24:26,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026079508] [2025-01-09 14:24:26,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:26,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:24:26,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-01-09 14:24:27,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-01-09 14:24:27,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:27,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:27,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 27 proven. 99 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-01-09 14:24:27,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:24:27,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026079508] [2025-01-09 14:24:27,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026079508] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:24:27,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160707740] [2025-01-09 14:24:27,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:27,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:24:27,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:24:27,372 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:24:27,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 14:24:27,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-01-09 14:24:27,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-01-09 14:24:27,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:27,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:27,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 14:24:27,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:24:27,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 1248 proven. 99 refuted. 0 times theorem prover too weak. 2265 trivial. 0 not checked. [2025-01-09 14:24:27,875 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:24:28,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 27 proven. 99 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-01-09 14:24:28,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160707740] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:24:28,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:24:28,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-01-09 14:24:28,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813613853] [2025-01-09 14:24:28,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:24:28,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:24:28,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:24:28,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:24:28,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:24:28,151 INFO L87 Difference]: Start difference. First operand 876 states and 1264 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 2 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 2 states have call predecessors, (77), 2 states have call successors, (77) [2025-01-09 14:24:28,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:24:28,595 INFO L93 Difference]: Finished difference Result 1389 states and 1983 transitions. [2025-01-09 14:24:28,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 14:24:28,596 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 2 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 2 states have call predecessors, (77), 2 states have call successors, (77) Word has length 291 [2025-01-09 14:24:28,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:24:28,600 INFO L225 Difference]: With dead ends: 1389 [2025-01-09 14:24:28,601 INFO L226 Difference]: Without dead ends: 896 [2025-01-09 14:24:28,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 576 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:24:28,604 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 415 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:24:28,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1231 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:24:28,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2025-01-09 14:24:28,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 855. [2025-01-09 14:24:28,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 639 states have (on average 1.325508607198748) internal successors, (847), 642 states have internal predecessors, (847), 184 states have call successors, (184), 31 states have call predecessors, (184), 31 states have return successors, (184), 181 states have call predecessors, (184), 184 states have call successors, (184) [2025-01-09 14:24:28,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1215 transitions. [2025-01-09 14:24:28,668 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1215 transitions. Word has length 291 [2025-01-09 14:24:28,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:24:28,669 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 1215 transitions. [2025-01-09 14:24:28,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 2 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 2 states have call predecessors, (77), 2 states have call successors, (77) [2025-01-09 14:24:28,669 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1215 transitions. [2025-01-09 14:24:28,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-01-09 14:24:28,671 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:28,671 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:24:28,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 14:24:28,872 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,SelfDestructingSolverStorable10 [2025-01-09 14:24:28,872 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:24:28,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:24:28,873 INFO L85 PathProgramCache]: Analyzing trace with hash -120388302, now seen corresponding path program 1 times [2025-01-09 14:24:28,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:24:28,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836813016] [2025-01-09 14:24:28,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:28,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:24:28,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-01-09 14:24:29,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-01-09 14:24:29,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:29,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:29,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 105 proven. 21 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-01-09 14:24:29,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:24:29,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836813016] [2025-01-09 14:24:29,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836813016] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:24:29,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224877968] [2025-01-09 14:24:29,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:29,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:24:29,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:24:29,687 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:24:29,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 14:24:29,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-01-09 14:24:29,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-01-09 14:24:29,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:29,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:29,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 14:24:29,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:24:30,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 2201 proven. 138 refuted. 0 times theorem prover too weak. 1273 trivial. 0 not checked. [2025-01-09 14:24:30,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:24:31,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 222 proven. 147 refuted. 0 times theorem prover too weak. 3243 trivial. 0 not checked. [2025-01-09 14:24:31,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224877968] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:24:31,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:24:31,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 14] total 25 [2025-01-09 14:24:31,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444442766] [2025-01-09 14:24:31,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:24:31,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 14:24:31,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:24:31,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 14:24:31,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2025-01-09 14:24:31,016 INFO L87 Difference]: Start difference. First operand 855 states and 1215 transitions. Second operand has 25 states, 25 states have (on average 7.08) internal successors, (177), 25 states have internal predecessors, (177), 6 states have call successors, (119), 4 states have call predecessors, (119), 10 states have return successors, (120), 6 states have call predecessors, (120), 6 states have call successors, (120) [2025-01-09 14:24:32,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:24:32,504 INFO L93 Difference]: Finished difference Result 1250 states and 1756 transitions. [2025-01-09 14:24:32,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-01-09 14:24:32,506 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 7.08) internal successors, (177), 25 states have internal predecessors, (177), 6 states have call successors, (119), 4 states have call predecessors, (119), 10 states have return successors, (120), 6 states have call predecessors, (120), 6 states have call successors, (120) Word has length 292 [2025-01-09 14:24:32,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:24:32,510 INFO L225 Difference]: With dead ends: 1250 [2025-01-09 14:24:32,510 INFO L226 Difference]: Without dead ends: 780 [2025-01-09 14:24:32,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 574 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1001, Invalid=2905, Unknown=0, NotChecked=0, Total=3906 [2025-01-09 14:24:32,514 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 1604 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 762 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1604 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 1658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 762 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:24:32,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1604 Valid, 1474 Invalid, 1658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [762 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:24:32,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2025-01-09 14:24:32,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 383. [2025-01-09 14:24:32,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 272 states have (on average 1.2573529411764706) internal successors, (342), 273 states have internal predecessors, (342), 92 states have call successors, (92), 18 states have call predecessors, (92), 18 states have return successors, (92), 91 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 14:24:32,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 526 transitions. [2025-01-09 14:24:32,551 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 526 transitions. Word has length 292 [2025-01-09 14:24:32,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:24:32,551 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 526 transitions. [2025-01-09 14:24:32,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.08) internal successors, (177), 25 states have internal predecessors, (177), 6 states have call successors, (119), 4 states have call predecessors, (119), 10 states have return successors, (120), 6 states have call predecessors, (120), 6 states have call successors, (120) [2025-01-09 14:24:32,552 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 526 transitions. [2025-01-09 14:24:32,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-01-09 14:24:32,553 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:32,553 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:24:32,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 14:24:32,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-09 14:24:32,754 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:24:32,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:24:32,755 INFO L85 PathProgramCache]: Analyzing trace with hash -331515613, now seen corresponding path program 1 times [2025-01-09 14:24:32,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:24:32,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115172425] [2025-01-09 14:24:32,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:32,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:24:32,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-01-09 14:24:32,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-01-09 14:24:32,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:32,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:33,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:24:33,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:24:33,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115172425] [2025-01-09 14:24:33,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115172425] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:24:33,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:24:33,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:24:33,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462278938] [2025-01-09 14:24:33,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:24:33,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:24:33,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:24:33,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:24:33,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:24:33,083 INFO L87 Difference]: Start difference. First operand 383 states and 526 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:24:33,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:24:33,365 INFO L93 Difference]: Finished difference Result 1180 states and 1652 transitions. [2025-01-09 14:24:33,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:24:33,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 292 [2025-01-09 14:24:33,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:24:33,369 INFO L225 Difference]: With dead ends: 1180 [2025-01-09 14:24:33,369 INFO L226 Difference]: Without dead ends: 655 [2025-01-09 14:24:33,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:24:33,370 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 710 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:24:33,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 1306 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:24:33,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2025-01-09 14:24:33,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 518. [2025-01-09 14:24:33,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 407 states have (on average 1.3341523341523343) internal successors, (543), 408 states have internal predecessors, (543), 92 states have call successors, (92), 18 states have call predecessors, (92), 18 states have return successors, (92), 91 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 14:24:33,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 727 transitions. [2025-01-09 14:24:33,403 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 727 transitions. Word has length 292 [2025-01-09 14:24:33,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:24:33,403 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 727 transitions. [2025-01-09 14:24:33,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:24:33,403 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 727 transitions. [2025-01-09 14:24:33,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-01-09 14:24:33,405 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:33,405 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:24:33,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:24:33,405 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:24:33,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:24:33,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1914063841, now seen corresponding path program 1 times [2025-01-09 14:24:33,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:24:33,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096733283] [2025-01-09 14:24:33,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:33,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:24:33,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-01-09 14:24:33,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-01-09 14:24:33,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:33,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:33,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:24:33,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:24:33,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096733283] [2025-01-09 14:24:33,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096733283] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:24:33,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:24:33,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:24:33,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432785716] [2025-01-09 14:24:33,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:24:33,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:24:33,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:24:33,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:24:33,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:24:33,901 INFO L87 Difference]: Start difference. First operand 518 states and 727 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:24:34,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:24:34,004 INFO L93 Difference]: Finished difference Result 1070 states and 1505 transitions. [2025-01-09 14:24:34,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:24:34,004 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 292 [2025-01-09 14:24:34,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:24:34,008 INFO L225 Difference]: With dead ends: 1070 [2025-01-09 14:24:34,008 INFO L226 Difference]: Without dead ends: 665 [2025-01-09 14:24:34,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:24:34,009 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 275 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:24:34,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 1479 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:24:34,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-01-09 14:24:34,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 580. [2025-01-09 14:24:34,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 458 states have (on average 1.3231441048034935) internal successors, (606), 460 states have internal predecessors, (606), 100 states have call successors, (100), 21 states have call predecessors, (100), 21 states have return successors, (100), 98 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 14:24:34,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 806 transitions. [2025-01-09 14:24:34,050 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 806 transitions. Word has length 292 [2025-01-09 14:24:34,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:24:34,051 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 806 transitions. [2025-01-09 14:24:34,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:24:34,051 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 806 transitions. [2025-01-09 14:24:34,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-01-09 14:24:34,052 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:34,052 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:24:34,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 14:24:34,053 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:24:34,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:24:34,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1208735147, now seen corresponding path program 1 times [2025-01-09 14:24:34,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:24:34,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141539314] [2025-01-09 14:24:34,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:34,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:24:34,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-01-09 14:24:34,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-01-09 14:24:34,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:34,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:34,542 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 18 proven. 108 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-01-09 14:24:34,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:24:34,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141539314] [2025-01-09 14:24:34,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141539314] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:24:34,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264237185] [2025-01-09 14:24:34,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:34,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:24:34,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:24:34,545 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:24:34,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 14:24:34,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-01-09 14:24:34,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-01-09 14:24:34,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:34,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:34,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 14:24:34,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:24:35,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 918 proven. 108 refuted. 0 times theorem prover too weak. 2586 trivial. 0 not checked. [2025-01-09 14:24:35,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:24:35,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 18 proven. 108 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-01-09 14:24:35,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264237185] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:24:35,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:24:35,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 17 [2025-01-09 14:24:35,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816447706] [2025-01-09 14:24:35,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:24:35,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 14:24:35,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:24:35,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 14:24:35,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:24:35,900 INFO L87 Difference]: Start difference. First operand 580 states and 806 transitions. Second operand has 17 states, 17 states have (on average 13.0) internal successors, (221), 17 states have internal predecessors, (221), 5 states have call successors, (122), 3 states have call predecessors, (122), 6 states have return successors, (123), 5 states have call predecessors, (123), 5 states have call successors, (123) [2025-01-09 14:24:36,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:24:36,780 INFO L93 Difference]: Finished difference Result 1091 states and 1513 transitions. [2025-01-09 14:24:36,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 14:24:36,781 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 13.0) internal successors, (221), 17 states have internal predecessors, (221), 5 states have call successors, (122), 3 states have call predecessors, (122), 6 states have return successors, (123), 5 states have call predecessors, (123), 5 states have call successors, (123) Word has length 293 [2025-01-09 14:24:36,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:24:36,785 INFO L225 Difference]: With dead ends: 1091 [2025-01-09 14:24:36,785 INFO L226 Difference]: Without dead ends: 647 [2025-01-09 14:24:36,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 611 GetRequests, 580 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 14:24:36,788 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 657 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 1449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:24:36,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 1337 Invalid, 1449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 1174 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:24:36,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2025-01-09 14:24:36,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 528. [2025-01-09 14:24:36,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 406 states have (on average 1.3029556650246306) internal successors, (529), 408 states have internal predecessors, (529), 100 states have call successors, (100), 21 states have call predecessors, (100), 21 states have return successors, (100), 98 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 14:24:36,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 729 transitions. [2025-01-09 14:24:36,830 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 729 transitions. Word has length 293 [2025-01-09 14:24:36,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:24:36,830 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 729 transitions. [2025-01-09 14:24:36,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 13.0) internal successors, (221), 17 states have internal predecessors, (221), 5 states have call successors, (122), 3 states have call predecessors, (122), 6 states have return successors, (123), 5 states have call predecessors, (123), 5 states have call successors, (123) [2025-01-09 14:24:36,831 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 729 transitions. [2025-01-09 14:24:36,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-01-09 14:24:36,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:36,832 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:24:36,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 14:24:37,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:24:37,033 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:24:37,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:24:37,033 INFO L85 PathProgramCache]: Analyzing trace with hash -931352205, now seen corresponding path program 1 times [2025-01-09 14:24:37,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:24:37,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410402749] [2025-01-09 14:24:37,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:37,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:24:37,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-01-09 14:24:37,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-01-09 14:24:37,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:37,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:11,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 96 proven. 150 refuted. 0 times theorem prover too weak. 3366 trivial. 0 not checked. [2025-01-09 14:25:11,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:11,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410402749] [2025-01-09 14:25:11,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410402749] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:25:11,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941710284] [2025-01-09 14:25:11,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:11,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:25:11,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:25:11,030 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:25:11,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 14:25:11,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-01-09 14:25:11,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-01-09 14:25:11,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:11,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:11,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 14:25:11,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:25:14,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 1993 proven. 222 refuted. 0 times theorem prover too weak. 1397 trivial. 0 not checked. [2025-01-09 14:25:14,978 INFO L312 TraceCheckSpWp]: Computing backward predicates...