./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-83.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_fillercode_fillercodesize_ps-cn-250_file-83.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 0b7d7572b4223b408ecca691daf97dc79641f0b4c97b6315410d3e8868a73776 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:47:56,639 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:47:56,678 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:47:56,682 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:47:56,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:47:56,701 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:47:56,702 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:47:56,702 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:47:56,702 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:47:56,702 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:47:56,702 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:47:56,702 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:47:56,703 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:47:56,703 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:47:56,703 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:47:56,703 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:47:56,703 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:47:56,703 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:47:56,703 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:47:56,703 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:47:56,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:47:56,703 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:47:56,703 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:47:56,703 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:47:56,703 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:47:56,703 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:47:56,703 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:47:56,703 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:47:56,703 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:47:56,704 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:47:56,704 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:47:56,704 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:47:56,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:47:56,704 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:47:56,704 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:47:56,704 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:47:56,704 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:47:56,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:47:56,704 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:47:56,704 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:47:56,704 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:47:56,704 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:47:56,705 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:47:56,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:47:56,705 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:47:56,705 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:47:56,705 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:47:56,705 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:47:56,705 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 -> 0b7d7572b4223b408ecca691daf97dc79641f0b4c97b6315410d3e8868a73776 [2025-01-09 09:47:56,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:47:57,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:47:57,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:47:57,015 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:47:57,015 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:47:57,016 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-83.i [2025-01-09 09:47:58,445 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/440016f56/e6119d41c3b84e549996ed6daeb367ec/FLAG73b1b1a5f [2025-01-09 09:47:58,833 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:47:58,836 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-83.i [2025-01-09 09:47:58,847 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/440016f56/e6119d41c3b84e549996ed6daeb367ec/FLAG73b1b1a5f [2025-01-09 09:47:58,861 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/440016f56/e6119d41c3b84e549996ed6daeb367ec [2025-01-09 09:47:58,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:47:58,864 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:47:58,865 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:47:58,865 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:47:58,869 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:47:58,869 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:47:58" (1/1) ... [2025-01-09 09:47:58,870 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@748c97eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:47:58, skipping insertion in model container [2025-01-09 09:47:58,870 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:47:58" (1/1) ... [2025-01-09 09:47:58,899 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:47:59,036 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-83.i[916,929] [2025-01-09 09:47:59,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:47:59,221 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:47:59,232 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-83.i[916,929] [2025-01-09 09:47:59,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:47:59,317 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:47:59,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:47:59 WrapperNode [2025-01-09 09:47:59,318 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:47:59,319 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:47:59,319 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:47:59,319 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:47:59,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:47:59" (1/1) ... [2025-01-09 09:47:59,336 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:47:59" (1/1) ... [2025-01-09 09:47:59,392 INFO L138 Inliner]: procedures = 26, calls = 102, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 695 [2025-01-09 09:47:59,393 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:47:59,393 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:47:59,394 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:47:59,394 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:47:59,400 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:47:59" (1/1) ... [2025-01-09 09:47:59,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:47:59" (1/1) ... [2025-01-09 09:47:59,418 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:47:59" (1/1) ... [2025-01-09 09:47:59,463 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 09:47:59,463 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:47:59" (1/1) ... [2025-01-09 09:47:59,463 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:47:59" (1/1) ... [2025-01-09 09:47:59,500 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:47:59" (1/1) ... [2025-01-09 09:47:59,507 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:47:59" (1/1) ... [2025-01-09 09:47:59,516 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:47:59" (1/1) ... [2025-01-09 09:47:59,526 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:47:59" (1/1) ... [2025-01-09 09:47:59,536 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:47:59" (1/1) ... [2025-01-09 09:47:59,552 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:47:59,554 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:47:59,554 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:47:59,554 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:47:59,555 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:47:59" (1/1) ... [2025-01-09 09:47:59,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:47:59,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:47:59,582 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 09:47:59,586 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 09:47:59,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:47:59,598 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:47:59,598 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:47:59,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:47:59,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:47:59,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:47:59,682 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:47:59,683 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:48:00,516 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-01-09 09:48:00,516 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:48:00,531 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:48:00,533 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:48:00,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:48:00 BoogieIcfgContainer [2025-01-09 09:48:00,533 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:48:00,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:48:00,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:48:00,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:48:00,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:47:58" (1/3) ... [2025-01-09 09:48:00,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d2fd57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:48:00, skipping insertion in model container [2025-01-09 09:48:00,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:47:59" (2/3) ... [2025-01-09 09:48:00,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d2fd57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:48:00, skipping insertion in model container [2025-01-09 09:48:00,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:48:00" (3/3) ... [2025-01-09 09:48:00,540 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-83.i [2025-01-09 09:48:00,550 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:48:00,552 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-83.i that has 2 procedures, 284 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:48:00,602 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:48:00,612 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;@604afcbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:48:00,612 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:48:00,615 INFO L276 IsEmpty]: Start isEmpty. Operand has 284 states, 192 states have (on average 1.53125) internal successors, (294), 193 states have internal predecessors, (294), 89 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) [2025-01-09 09:48:00,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2025-01-09 09:48:00,637 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:00,637 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:00,638 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:00,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:00,643 INFO L85 PathProgramCache]: Analyzing trace with hash 549609970, now seen corresponding path program 1 times [2025-01-09 09:48:00,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:00,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439377410] [2025-01-09 09:48:00,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:00,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:00,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 557 statements into 1 equivalence classes. [2025-01-09 09:48:00,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 557 of 557 statements. [2025-01-09 09:48:00,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:00,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:01,148 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 15488 trivial. 0 not checked. [2025-01-09 09:48:01,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:01,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439377410] [2025-01-09 09:48:01,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439377410] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:48:01,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201909998] [2025-01-09 09:48:01,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:01,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:48:01,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:48:01,155 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 09:48:01,156 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 09:48:01,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 557 statements into 1 equivalence classes. [2025-01-09 09:48:01,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 557 of 557 statements. [2025-01-09 09:48:01,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:01,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:01,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 1222 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:48:01,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:48:01,500 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 15488 trivial. 0 not checked. [2025-01-09 09:48:01,501 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:48:01,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201909998] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:01,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:48:01,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:48:01,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867433650] [2025-01-09 09:48:01,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:01,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:48:01,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:01,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:48:01,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:48:01,529 INFO L87 Difference]: Start difference. First operand has 284 states, 192 states have (on average 1.53125) internal successors, (294), 193 states have internal predecessors, (294), 89 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) Second operand has 2 states, 2 states have (on average 58.5) internal successors, (117), 2 states have internal predecessors, (117), 2 states have call successors, (89), 2 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 2 states have call successors, (89) [2025-01-09 09:48:01,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:01,570 INFO L93 Difference]: Finished difference Result 562 states and 1028 transitions. [2025-01-09 09:48:01,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:48:01,572 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 58.5) internal successors, (117), 2 states have internal predecessors, (117), 2 states have call successors, (89), 2 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 2 states have call successors, (89) Word has length 557 [2025-01-09 09:48:01,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:01,582 INFO L225 Difference]: With dead ends: 562 [2025-01-09 09:48:01,583 INFO L226 Difference]: Without dead ends: 281 [2025-01-09 09:48:01,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 558 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 09:48:01,591 INFO L435 NwaCegarLoop]: 467 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, 467 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 09:48:01,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:48:01,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-01-09 09:48:01,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2025-01-09 09:48:01,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 190 states have (on average 1.5210526315789474) internal successors, (289), 190 states have internal predecessors, (289), 89 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) [2025-01-09 09:48:01,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 467 transitions. [2025-01-09 09:48:01,682 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 467 transitions. Word has length 557 [2025-01-09 09:48:01,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:01,685 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 467 transitions. [2025-01-09 09:48:01,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 58.5) internal successors, (117), 2 states have internal predecessors, (117), 2 states have call successors, (89), 2 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 2 states have call successors, (89) [2025-01-09 09:48:01,685 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 467 transitions. [2025-01-09 09:48:01,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2025-01-09 09:48:01,698 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:01,698 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:01,709 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 09:48:01,899 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 09:48:01,900 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:01,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:01,902 INFO L85 PathProgramCache]: Analyzing trace with hash -380671092, now seen corresponding path program 1 times [2025-01-09 09:48:01,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:01,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870267085] [2025-01-09 09:48:01,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:01,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:01,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 557 statements into 1 equivalence classes. [2025-01-09 09:48:02,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 557 of 557 statements. [2025-01-09 09:48:02,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:02,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:02,420 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-01-09 09:48:02,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:02,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870267085] [2025-01-09 09:48:02,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870267085] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:02,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:02,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:48:02,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819509913] [2025-01-09 09:48:02,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:02,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:48:02,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:02,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:48:02,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:48:02,426 INFO L87 Difference]: Start difference. First operand 281 states and 467 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 09:48:02,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:02,497 INFO L93 Difference]: Finished difference Result 732 states and 1218 transitions. [2025-01-09 09:48:02,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:48:02,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 557 [2025-01-09 09:48:02,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:02,505 INFO L225 Difference]: With dead ends: 732 [2025-01-09 09:48:02,506 INFO L226 Difference]: Without dead ends: 454 [2025-01-09 09:48:02,507 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 09:48:02,508 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 266 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:02,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 919 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:48:02,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-01-09 09:48:02,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 451. [2025-01-09 09:48:02,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 315 states have (on average 1.5365079365079366) internal successors, (484), 316 states have internal predecessors, (484), 133 states have call successors, (133), 2 states have call predecessors, (133), 2 states have return successors, (133), 132 states have call predecessors, (133), 133 states have call successors, (133) [2025-01-09 09:48:02,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 750 transitions. [2025-01-09 09:48:02,560 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 750 transitions. Word has length 557 [2025-01-09 09:48:02,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:02,562 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 750 transitions. [2025-01-09 09:48:02,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 09:48:02,562 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 750 transitions. [2025-01-09 09:48:02,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2025-01-09 09:48:02,571 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:02,571 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:02,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:48:02,571 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:02,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:02,572 INFO L85 PathProgramCache]: Analyzing trace with hash 104070348, now seen corresponding path program 1 times [2025-01-09 09:48:02,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:02,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457112783] [2025-01-09 09:48:02,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:02,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:02,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 557 statements into 1 equivalence classes. [2025-01-09 09:48:02,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 557 of 557 statements. [2025-01-09 09:48:02,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:02,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:03,390 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-01-09 09:48:03,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:03,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457112783] [2025-01-09 09:48:03,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457112783] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:03,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:03,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:48:03,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136490361] [2025-01-09 09:48:03,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:03,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:48:03,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:03,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:48:03,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:48:03,395 INFO L87 Difference]: Start difference. First operand 451 states and 750 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 09:48:04,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:04,432 INFO L93 Difference]: Finished difference Result 3151 states and 5252 transitions. [2025-01-09 09:48:04,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 09:48:04,433 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 557 [2025-01-09 09:48:04,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:04,456 INFO L225 Difference]: With dead ends: 3151 [2025-01-09 09:48:04,456 INFO L226 Difference]: Without dead ends: 2703 [2025-01-09 09:48:04,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-01-09 09:48:04,458 INFO L435 NwaCegarLoop]: 1139 mSDtfsCounter, 1991 mSDsluCounter, 3263 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1991 SdHoareTripleChecker+Valid, 4402 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:04,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1991 Valid, 4402 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [364 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 09:48:04,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2703 states. [2025-01-09 09:48:04,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2703 to 1977. [2025-01-09 09:48:04,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1977 states, 1436 states have (on average 1.565459610027855) internal successors, (2248), 1440 states have internal predecessors, (2248), 532 states have call successors, (532), 8 states have call predecessors, (532), 8 states have return successors, (532), 528 states have call predecessors, (532), 532 states have call successors, (532) [2025-01-09 09:48:04,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 3312 transitions. [2025-01-09 09:48:04,670 INFO L78 Accepts]: Start accepts. Automaton has 1977 states and 3312 transitions. Word has length 557 [2025-01-09 09:48:04,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:04,671 INFO L471 AbstractCegarLoop]: Abstraction has 1977 states and 3312 transitions. [2025-01-09 09:48:04,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 09:48:04,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 3312 transitions. [2025-01-09 09:48:04,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2025-01-09 09:48:04,692 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:04,693 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:04,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:48:04,693 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:04,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:04,693 INFO L85 PathProgramCache]: Analyzing trace with hash -319576374, now seen corresponding path program 1 times [2025-01-09 09:48:04,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:04,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759218880] [2025-01-09 09:48:04,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:04,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:04,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 557 statements into 1 equivalence classes. [2025-01-09 09:48:05,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 557 of 557 statements. [2025-01-09 09:48:05,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:05,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:05,381 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-01-09 09:48:05,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:05,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759218880] [2025-01-09 09:48:05,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759218880] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:05,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:05,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:48:05,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860836564] [2025-01-09 09:48:05,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:05,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:48:05,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:05,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:48:05,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:48:05,383 INFO L87 Difference]: Start difference. First operand 1977 states and 3312 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 09:48:05,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:05,463 INFO L93 Difference]: Finished difference Result 3963 states and 6645 transitions. [2025-01-09 09:48:05,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:48:05,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 557 [2025-01-09 09:48:05,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:05,475 INFO L225 Difference]: With dead ends: 3963 [2025-01-09 09:48:05,475 INFO L226 Difference]: Without dead ends: 1989 [2025-01-09 09:48:05,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:48:05,481 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 0 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:05,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 926 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:48:05,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2025-01-09 09:48:05,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1989. [2025-01-09 09:48:05,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1989 states, 1448 states have (on average 1.5607734806629834) internal successors, (2260), 1452 states have internal predecessors, (2260), 532 states have call successors, (532), 8 states have call predecessors, (532), 8 states have return successors, (532), 528 states have call predecessors, (532), 532 states have call successors, (532) [2025-01-09 09:48:05,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 3324 transitions. [2025-01-09 09:48:05,696 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 3324 transitions. Word has length 557 [2025-01-09 09:48:05,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:05,697 INFO L471 AbstractCegarLoop]: Abstraction has 1989 states and 3324 transitions. [2025-01-09 09:48:05,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 09:48:05,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 3324 transitions. [2025-01-09 09:48:05,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2025-01-09 09:48:05,703 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:05,704 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:05,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:48:05,704 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:05,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:05,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1369367368, now seen corresponding path program 1 times [2025-01-09 09:48:05,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:05,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609667591] [2025-01-09 09:48:05,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:05,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:05,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 557 statements into 1 equivalence classes. [2025-01-09 09:48:06,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 557 of 557 statements. [2025-01-09 09:48:06,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:06,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:06,507 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 84 proven. 180 refuted. 0 times theorem prover too weak. 15400 trivial. 0 not checked. [2025-01-09 09:48:06,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:06,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609667591] [2025-01-09 09:48:06,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609667591] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:48:06,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10573413] [2025-01-09 09:48:06,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:06,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:48:06,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:48:06,510 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 09:48:06,512 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 09:48:06,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 557 statements into 1 equivalence classes. [2025-01-09 09:48:06,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 557 of 557 statements. [2025-01-09 09:48:06,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:06,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:06,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 1228 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 09:48:06,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:48:07,270 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 7648 proven. 156 refuted. 0 times theorem prover too weak. 7860 trivial. 0 not checked. [2025-01-09 09:48:07,271 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:48:07,780 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 108 proven. 156 refuted. 0 times theorem prover too weak. 15400 trivial. 0 not checked. [2025-01-09 09:48:07,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10573413] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:48:07,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:48:07,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-01-09 09:48:07,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758267681] [2025-01-09 09:48:07,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:48:07,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 09:48:07,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:07,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 09:48:07,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:48:07,789 INFO L87 Difference]: Start difference. First operand 1989 states and 3324 transitions. Second operand has 9 states, 9 states have (on average 24.333333333333332) internal successors, (219), 9 states have internal predecessors, (219), 4 states have call successors, (201), 2 states have call predecessors, (201), 4 states have return successors, (203), 4 states have call predecessors, (203), 4 states have call successors, (203) [2025-01-09 09:48:08,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:08,492 INFO L93 Difference]: Finished difference Result 4055 states and 6709 transitions. [2025-01-09 09:48:08,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 09:48:08,494 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 24.333333333333332) internal successors, (219), 9 states have internal predecessors, (219), 4 states have call successors, (201), 2 states have call predecessors, (201), 4 states have return successors, (203), 4 states have call predecessors, (203), 4 states have call successors, (203) Word has length 557 [2025-01-09 09:48:08,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:08,510 INFO L225 Difference]: With dead ends: 4055 [2025-01-09 09:48:08,510 INFO L226 Difference]: Without dead ends: 2069 [2025-01-09 09:48:08,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1126 GetRequests, 1111 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2025-01-09 09:48:08,518 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 491 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:08,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 821 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 09:48:08,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2025-01-09 09:48:08,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 2053. [2025-01-09 09:48:08,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 1496 states have (on average 1.5240641711229947) internal successors, (2280), 1500 states have internal predecessors, (2280), 532 states have call successors, (532), 24 states have call predecessors, (532), 24 states have return successors, (532), 528 states have call predecessors, (532), 532 states have call successors, (532) [2025-01-09 09:48:08,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 3344 transitions. [2025-01-09 09:48:08,697 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 3344 transitions. Word has length 557 [2025-01-09 09:48:08,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:08,698 INFO L471 AbstractCegarLoop]: Abstraction has 2053 states and 3344 transitions. [2025-01-09 09:48:08,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 24.333333333333332) internal successors, (219), 9 states have internal predecessors, (219), 4 states have call successors, (201), 2 states have call predecessors, (201), 4 states have return successors, (203), 4 states have call predecessors, (203), 4 states have call successors, (203) [2025-01-09 09:48:08,698 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 3344 transitions. [2025-01-09 09:48:08,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2025-01-09 09:48:08,703 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:08,703 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:08,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 09:48:08,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:48:08,908 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:08,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:08,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1286519625, now seen corresponding path program 1 times [2025-01-09 09:48:08,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:08,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403874150] [2025-01-09 09:48:08,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:08,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:08,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 559 statements into 1 equivalence classes. [2025-01-09 09:48:08,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 559 of 559 statements. [2025-01-09 09:48:08,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:08,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:09,248 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-01-09 09:48:09,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:09,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403874150] [2025-01-09 09:48:09,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403874150] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:09,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:09,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:48:09,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376721552] [2025-01-09 09:48:09,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:09,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:48:09,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:09,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:48:09,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:48:09,251 INFO L87 Difference]: Start difference. First operand 2053 states and 3344 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 09:48:10,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:10,102 INFO L93 Difference]: Finished difference Result 7723 states and 12579 transitions. [2025-01-09 09:48:10,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:48:10,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 559 [2025-01-09 09:48:10,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:10,139 INFO L225 Difference]: With dead ends: 7723 [2025-01-09 09:48:10,139 INFO L226 Difference]: Without dead ends: 5673 [2025-01-09 09:48:10,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:48:10,146 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 691 mSDsluCounter, 1225 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 1773 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:10,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 1773 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 09:48:10,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5673 states. [2025-01-09 09:48:10,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5673 to 3793. [2025-01-09 09:48:10,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3793 states, 2820 states have (on average 1.5361702127659576) internal successors, (4332), 2832 states have internal predecessors, (4332), 924 states have call successors, (924), 48 states have call predecessors, (924), 48 states have return successors, (924), 912 states have call predecessors, (924), 924 states have call successors, (924) [2025-01-09 09:48:10,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3793 states to 3793 states and 6180 transitions. [2025-01-09 09:48:10,550 INFO L78 Accepts]: Start accepts. Automaton has 3793 states and 6180 transitions. Word has length 559 [2025-01-09 09:48:10,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:10,551 INFO L471 AbstractCegarLoop]: Abstraction has 3793 states and 6180 transitions. [2025-01-09 09:48:10,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 09:48:10,551 INFO L276 IsEmpty]: Start isEmpty. Operand 3793 states and 6180 transitions. [2025-01-09 09:48:10,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2025-01-09 09:48:10,556 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:10,556 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:10,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:48:10,556 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:10,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:10,557 INFO L85 PathProgramCache]: Analyzing trace with hash 2144267393, now seen corresponding path program 1 times [2025-01-09 09:48:10,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:10,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794213470] [2025-01-09 09:48:10,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:10,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:10,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 560 statements into 1 equivalence classes. [2025-01-09 09:48:10,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 560 of 560 statements. [2025-01-09 09:48:10,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:10,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:11,050 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-01-09 09:48:11,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:11,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794213470] [2025-01-09 09:48:11,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794213470] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:11,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:11,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 09:48:11,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61361931] [2025-01-09 09:48:11,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:11,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 09:48:11,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:11,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 09:48:11,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 09:48:11,053 INFO L87 Difference]: Start difference. First operand 3793 states and 6180 transitions. Second operand has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 09:48:12,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:12,879 INFO L93 Difference]: Finished difference Result 17883 states and 29220 transitions. [2025-01-09 09:48:12,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 09:48:12,888 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 560 [2025-01-09 09:48:12,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:12,961 INFO L225 Difference]: With dead ends: 17883 [2025-01-09 09:48:12,962 INFO L226 Difference]: Without dead ends: 14093 [2025-01-09 09:48:12,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-01-09 09:48:12,978 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 2803 mSDsluCounter, 2052 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 637 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2803 SdHoareTripleChecker+Valid, 2491 SdHoareTripleChecker+Invalid, 1612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 637 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:12,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2803 Valid, 2491 Invalid, 1612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [637 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 09:48:12,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14093 states. [2025-01-09 09:48:13,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14093 to 4157. [2025-01-09 09:48:13,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4157 states, 3168 states have (on average 1.547979797979798) internal successors, (4904), 3180 states have internal predecessors, (4904), 924 states have call successors, (924), 64 states have call predecessors, (924), 64 states have return successors, (924), 912 states have call predecessors, (924), 924 states have call successors, (924) [2025-01-09 09:48:13,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4157 states to 4157 states and 6752 transitions. [2025-01-09 09:48:13,504 INFO L78 Accepts]: Start accepts. Automaton has 4157 states and 6752 transitions. Word has length 560 [2025-01-09 09:48:13,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:13,505 INFO L471 AbstractCegarLoop]: Abstraction has 4157 states and 6752 transitions. [2025-01-09 09:48:13,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 09:48:13,510 INFO L276 IsEmpty]: Start isEmpty. Operand 4157 states and 6752 transitions. [2025-01-09 09:48:13,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2025-01-09 09:48:13,515 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:13,516 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:13,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:48:13,516 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:13,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:13,516 INFO L85 PathProgramCache]: Analyzing trace with hash 302587648, now seen corresponding path program 1 times [2025-01-09 09:48:13,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:13,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539784535] [2025-01-09 09:48:13,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:13,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:13,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 560 statements into 1 equivalence classes. [2025-01-09 09:48:13,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 560 of 560 statements. [2025-01-09 09:48:13,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:13,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:14,418 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 84 proven. 180 refuted. 0 times theorem prover too weak. 15400 trivial. 0 not checked. [2025-01-09 09:48:14,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:14,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539784535] [2025-01-09 09:48:14,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539784535] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:48:14,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923770912] [2025-01-09 09:48:14,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:14,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:48:14,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:48:14,428 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 09:48:14,430 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 09:48:14,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 560 statements into 1 equivalence classes. [2025-01-09 09:48:14,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 560 of 560 statements. [2025-01-09 09:48:14,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:14,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:14,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 1232 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 09:48:14,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:48:19,749 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 3343 proven. 1152 refuted. 0 times theorem prover too weak. 11169 trivial. 0 not checked. [2025-01-09 09:48:19,749 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:48:21,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923770912] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:48:21,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 09:48:21,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 18] total 21 [2025-01-09 09:48:21,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284697424] [2025-01-09 09:48:21,118 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 09:48:21,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 09:48:21,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:21,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 09:48:21,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=691, Unknown=0, NotChecked=0, Total=870 [2025-01-09 09:48:21,121 INFO L87 Difference]: Start difference. First operand 4157 states and 6752 transitions. Second operand has 21 states, 21 states have (on average 11.523809523809524) internal successors, (242), 20 states have internal predecessors, (242), 7 states have call successors, (171), 6 states have call predecessors, (171), 10 states have return successors, (172), 7 states have call predecessors, (172), 7 states have call successors, (172) [2025-01-09 09:48:24,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:24,974 INFO L93 Difference]: Finished difference Result 12461 states and 19654 transitions. [2025-01-09 09:48:24,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-01-09 09:48:24,976 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 11.523809523809524) internal successors, (242), 20 states have internal predecessors, (242), 7 states have call successors, (171), 6 states have call predecessors, (171), 10 states have return successors, (172), 7 states have call predecessors, (172), 7 states have call successors, (172) Word has length 560 [2025-01-09 09:48:24,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:24,995 INFO L225 Difference]: With dead ends: 12461 [2025-01-09 09:48:24,995 INFO L226 Difference]: Without dead ends: 8307 [2025-01-09 09:48:25,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1119 GetRequests, 1043 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1470, Invalid=4536, Unknown=0, NotChecked=0, Total=6006 [2025-01-09 09:48:25,004 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 1410 mSDsluCounter, 2369 mSDsCounter, 0 mSdLazyCounter, 2378 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1410 SdHoareTripleChecker+Valid, 2882 SdHoareTripleChecker+Invalid, 2796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 2378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:25,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1410 Valid, 2882 Invalid, 2796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 2378 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 09:48:25,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8307 states. [2025-01-09 09:48:25,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8307 to 4569. [2025-01-09 09:48:25,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4569 states, 3500 states have (on average 1.5051428571428571) internal successors, (5268), 3512 states have internal predecessors, (5268), 924 states have call successors, (924), 144 states have call predecessors, (924), 144 states have return successors, (924), 912 states have call predecessors, (924), 924 states have call successors, (924) [2025-01-09 09:48:25,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4569 states to 4569 states and 7116 transitions. [2025-01-09 09:48:25,536 INFO L78 Accepts]: Start accepts. Automaton has 4569 states and 7116 transitions. Word has length 560 [2025-01-09 09:48:25,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:25,537 INFO L471 AbstractCegarLoop]: Abstraction has 4569 states and 7116 transitions. [2025-01-09 09:48:25,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 11.523809523809524) internal successors, (242), 20 states have internal predecessors, (242), 7 states have call successors, (171), 6 states have call predecessors, (171), 10 states have return successors, (172), 7 states have call predecessors, (172), 7 states have call successors, (172) [2025-01-09 09:48:25,538 INFO L276 IsEmpty]: Start isEmpty. Operand 4569 states and 7116 transitions. [2025-01-09 09:48:25,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2025-01-09 09:48:25,544 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:25,544 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:25,556 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 09:48:25,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:48:25,749 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:25,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:25,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1177507333, now seen corresponding path program 1 times [2025-01-09 09:48:25,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:25,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613613146] [2025-01-09 09:48:25,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:25,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:25,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 561 statements into 1 equivalence classes. [2025-01-09 09:48:25,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 561 of 561 statements. [2025-01-09 09:48:25,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:25,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:26,088 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-01-09 09:48:26,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:26,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613613146] [2025-01-09 09:48:26,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613613146] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:26,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:26,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:48:26,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638352025] [2025-01-09 09:48:26,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:26,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:48:26,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:26,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:48:26,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:48:26,089 INFO L87 Difference]: Start difference. First operand 4569 states and 7116 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 09:48:26,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:26,704 INFO L93 Difference]: Finished difference Result 12585 states and 19662 transitions. [2025-01-09 09:48:26,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:48:26,704 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 561 [2025-01-09 09:48:26,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:26,727 INFO L225 Difference]: With dead ends: 12585 [2025-01-09 09:48:26,727 INFO L226 Difference]: Without dead ends: 8019 [2025-01-09 09:48:26,736 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 09:48:26,737 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 299 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 1610 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:26,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 1610 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:48:26,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8019 states. [2025-01-09 09:48:27,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8019 to 4573. [2025-01-09 09:48:27,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4573 states, 3504 states have (on average 1.504566210045662) internal successors, (5272), 3516 states have internal predecessors, (5272), 924 states have call successors, (924), 144 states have call predecessors, (924), 144 states have return successors, (924), 912 states have call predecessors, (924), 924 states have call successors, (924) [2025-01-09 09:48:27,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4573 states to 4573 states and 7120 transitions. [2025-01-09 09:48:27,459 INFO L78 Accepts]: Start accepts. Automaton has 4573 states and 7120 transitions. Word has length 561 [2025-01-09 09:48:27,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:27,460 INFO L471 AbstractCegarLoop]: Abstraction has 4573 states and 7120 transitions. [2025-01-09 09:48:27,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 09:48:27,460 INFO L276 IsEmpty]: Start isEmpty. Operand 4573 states and 7120 transitions. [2025-01-09 09:48:27,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2025-01-09 09:48:27,492 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:27,492 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:27,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 09:48:27,493 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:27,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:27,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1603919930, now seen corresponding path program 1 times [2025-01-09 09:48:27,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:27,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918585316] [2025-01-09 09:48:27,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:27,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:27,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 562 statements into 1 equivalence classes. [2025-01-09 09:48:27,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 562 of 562 statements. [2025-01-09 09:48:27,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:27,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:50,891 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 195 proven. 327 refuted. 0 times theorem prover too weak. 15142 trivial. 0 not checked. [2025-01-09 09:48:50,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:50,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918585316] [2025-01-09 09:48:50,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918585316] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:48:50,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559133353] [2025-01-09 09:48:50,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:50,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:48:50,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:48:50,898 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 09:48:50,905 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 09:48:51,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 562 statements into 1 equivalence classes. [2025-01-09 09:48:51,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 562 of 562 statements. [2025-01-09 09:48:51,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:51,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:51,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 1234 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-09 09:48:51,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:48:54,801 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 8436 proven. 918 refuted. 0 times theorem prover too weak. 6310 trivial. 0 not checked. [2025-01-09 09:48:54,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:48:55,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559133353] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:48:55,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 09:48:55,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23] total 36 [2025-01-09 09:48:55,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845343939] [2025-01-09 09:48:55,609 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 09:48:55,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-01-09 09:48:55,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:55,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-01-09 09:48:55,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1837, Unknown=0, NotChecked=0, Total=2070 [2025-01-09 09:48:55,613 INFO L87 Difference]: Start difference. First operand 4573 states and 7120 transitions. Second operand has 36 states, 36 states have (on average 6.777777777777778) internal successors, (244), 33 states have internal predecessors, (244), 10 states have call successors, (178), 7 states have call predecessors, (178), 9 states have return successors, (178), 10 states have call predecessors, (178), 10 states have call successors, (178)