./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-51.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 71fa1ece88cae2f03b972f802d0e538a87174ef11cefc651662c60c0e9dd54e7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:25:06,808 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:25:06,884 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:25:06,893 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:25:06,893 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:25:06,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:25:06,915 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:25:06,915 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:25:06,915 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:25:06,915 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:25:06,916 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:25:06,916 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:25:06,916 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:25:06,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:25:06,916 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:25:06,916 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:25:06,917 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:25:06,917 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:25:06,917 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:25:06,917 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:25:06,917 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:25:06,917 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:25:06,917 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:25:06,917 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:25:06,918 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:25:06,918 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:25:06,918 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:25:06,918 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:25:06,918 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:25:06,918 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:25:06,918 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:25:06,918 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:25:06,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:25:06,919 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:25:06,919 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:25:06,919 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:25:06,919 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:25:06,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:25:06,919 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:25:06,919 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:25:06,920 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:25:06,920 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:25:06,920 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:25:06,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:25:06,920 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:25:06,920 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:25:06,920 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:25:06,920 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:25:06,921 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 -> 71fa1ece88cae2f03b972f802d0e538a87174ef11cefc651662c60c0e9dd54e7 [2025-01-09 14:25:07,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:25:07,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:25:07,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:25:07,221 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:25:07,221 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:25:07,222 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-51.i [2025-01-09 14:25:08,474 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e45870644/eabeab61cf4e4f898af07d2d572fcad1/FLAG2b71a8540 [2025-01-09 14:25:08,809 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:25:08,809 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-51.i [2025-01-09 14:25:08,826 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e45870644/eabeab61cf4e4f898af07d2d572fcad1/FLAG2b71a8540 [2025-01-09 14:25:08,851 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e45870644/eabeab61cf4e4f898af07d2d572fcad1 [2025-01-09 14:25:08,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:25:08,855 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:25:08,856 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:25:08,857 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:25:08,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:25:08,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:25:08" (1/1) ... [2025-01-09 14:25:08,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4adfbe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:08, skipping insertion in model container [2025-01-09 14:25:08,863 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:25:08" (1/1) ... [2025-01-09 14:25:08,904 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:25:09,034 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-51.i[916,929] [2025-01-09 14:25:09,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:25:09,216 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:25:09,223 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-51.i[916,929] [2025-01-09 14:25:09,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:25:09,316 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:25:09,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:09 WrapperNode [2025-01-09 14:25:09,317 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:25:09,320 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:25:09,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:25:09,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:25:09,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:09" (1/1) ... [2025-01-09 14:25:09,346 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:09" (1/1) ... [2025-01-09 14:25:09,424 INFO L138 Inliner]: procedures = 26, calls = 80, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 456 [2025-01-09 14:25:09,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:25:09,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:25:09,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:25:09,426 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:25:09,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:09" (1/1) ... [2025-01-09 14:25:09,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:09" (1/1) ... [2025-01-09 14:25:09,455 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:09" (1/1) ... [2025-01-09 14:25:09,504 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 14:25:09,505 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:09" (1/1) ... [2025-01-09 14:25:09,506 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:09" (1/1) ... [2025-01-09 14:25:09,534 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:09" (1/1) ... [2025-01-09 14:25:09,542 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:09" (1/1) ... [2025-01-09 14:25:09,549 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:09" (1/1) ... [2025-01-09 14:25:09,563 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:09" (1/1) ... [2025-01-09 14:25:09,574 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:09" (1/1) ... [2025-01-09 14:25:09,588 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:25:09,590 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:25:09,590 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:25:09,590 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:25:09,591 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:09" (1/1) ... [2025-01-09 14:25:09,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:25:09,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:25:09,645 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 14:25:09,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 14:25:09,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:25:09,669 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:25:09,669 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:25:09,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:25:09,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:25:09,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:25:09,789 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:25:09,791 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:25:10,698 INFO L? ?]: Removed 46 outVars from TransFormulas that were not future-live. [2025-01-09 14:25:10,698 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:25:10,715 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:25:10,715 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:25:10,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:25:10 BoogieIcfgContainer [2025-01-09 14:25:10,718 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:25:10,719 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:25:10,719 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:25:10,724 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:25:10,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:25:08" (1/3) ... [2025-01-09 14:25:10,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116757a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:25:10, skipping insertion in model container [2025-01-09 14:25:10,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:09" (2/3) ... [2025-01-09 14:25:10,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116757a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:25:10, skipping insertion in model container [2025-01-09 14:25:10,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:25:10" (3/3) ... [2025-01-09 14:25:10,727 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-51.i [2025-01-09 14:25:10,740 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:25:10,744 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-51.i that has 2 procedures, 197 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:25:10,811 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:25:10,824 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;@222be36e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:25:10,824 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:25:10,830 INFO L276 IsEmpty]: Start isEmpty. Operand has 197 states, 127 states have (on average 1.4566929133858268) internal successors, (185), 128 states have internal predecessors, (185), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-01-09 14:25:10,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2025-01-09 14:25:10,853 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:10,854 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:25:10,854 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:10,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:10,860 INFO L85 PathProgramCache]: Analyzing trace with hash 885877074, now seen corresponding path program 1 times [2025-01-09 14:25:10,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:10,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405304181] [2025-01-09 14:25:10,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:10,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:10,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 420 statements into 1 equivalence classes. [2025-01-09 14:25:11,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 420 of 420 statements. [2025-01-09 14:25:11,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:11,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:11,478 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2025-01-09 14:25:11,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:11,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405304181] [2025-01-09 14:25:11,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405304181] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:25:11,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728415169] [2025-01-09 14:25:11,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:11,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:25:11,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:25:11,484 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:25:11,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 14:25:11,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 420 statements into 1 equivalence classes. [2025-01-09 14:25:11,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 420 of 420 statements. [2025-01-09 14:25:11,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:11,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:11,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 942 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:25:11,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:25:11,866 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2025-01-09 14:25:11,867 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:25:11,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728415169] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:11,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:25:11,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:25:11,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137448879] [2025-01-09 14:25:11,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:11,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:25:11,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:11,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:25:11,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:25:11,898 INFO L87 Difference]: Start difference. First operand has 197 states, 127 states have (on average 1.4566929133858268) internal successors, (185), 128 states have internal predecessors, (185), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) Second operand has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) [2025-01-09 14:25:11,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:11,940 INFO L93 Difference]: Finished difference Result 387 states and 698 transitions. [2025-01-09 14:25:11,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:25:11,942 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) Word has length 420 [2025-01-09 14:25:11,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:11,949 INFO L225 Difference]: With dead ends: 387 [2025-01-09 14:25:11,949 INFO L226 Difference]: Without dead ends: 193 [2025-01-09 14:25:11,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:25:11,957 INFO L435 NwaCegarLoop]: 310 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, 310 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:11,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:25:11,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-01-09 14:25:12,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-01-09 14:25:12,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 124 states have (on average 1.4193548387096775) internal successors, (176), 124 states have internal predecessors, (176), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-01-09 14:25:12,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 310 transitions. [2025-01-09 14:25:12,041 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 310 transitions. Word has length 420 [2025-01-09 14:25:12,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:12,043 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 310 transitions. [2025-01-09 14:25:12,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) [2025-01-09 14:25:12,043 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 310 transitions. [2025-01-09 14:25:12,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2025-01-09 14:25:12,056 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:12,056 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:25:12,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:25:12,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 14:25:12,260 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:12,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:12,261 INFO L85 PathProgramCache]: Analyzing trace with hash -343267880, now seen corresponding path program 1 times [2025-01-09 14:25:12,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:12,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805660887] [2025-01-09 14:25:12,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:12,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:12,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 420 statements into 1 equivalence classes. [2025-01-09 14:25:12,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 420 of 420 statements. [2025-01-09 14:25:12,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:12,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:12,776 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:25:12,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:12,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805660887] [2025-01-09 14:25:12,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805660887] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:12,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:25:12,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:25:12,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86702977] [2025-01-09 14:25:12,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:12,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:25:12,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:12,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:25:12,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:25:12,783 INFO L87 Difference]: Start difference. First operand 193 states and 310 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:25:12,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:12,888 INFO L93 Difference]: Finished difference Result 485 states and 774 transitions. [2025-01-09 14:25:12,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:25:12,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 420 [2025-01-09 14:25:12,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:12,896 INFO L225 Difference]: With dead ends: 485 [2025-01-09 14:25:12,897 INFO L226 Difference]: Without dead ends: 295 [2025-01-09 14:25:12,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:25:12,901 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 153 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:12,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 741 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:25:12,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-01-09 14:25:12,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 292. [2025-01-09 14:25:12,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 197 states have (on average 1.416243654822335) internal successors, (279), 198 states have internal predecessors, (279), 92 states have call successors, (92), 2 states have call predecessors, (92), 2 states have return successors, (92), 91 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 14:25:12,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 463 transitions. [2025-01-09 14:25:12,959 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 463 transitions. Word has length 420 [2025-01-09 14:25:12,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:12,962 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 463 transitions. [2025-01-09 14:25:12,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:25:12,962 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 463 transitions. [2025-01-09 14:25:12,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2025-01-09 14:25:12,970 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:12,971 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:25:12,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:25:12,975 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:12,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:12,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1181922034, now seen corresponding path program 1 times [2025-01-09 14:25:12,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:12,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052952143] [2025-01-09 14:25:12,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:12,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:13,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 421 statements into 1 equivalence classes. [2025-01-09 14:25:13,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 421 of 421 statements. [2025-01-09 14:25:13,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:13,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:16,850 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:25:16,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:16,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052952143] [2025-01-09 14:25:16,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052952143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:16,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:25:16,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 14:25:16,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586164079] [2025-01-09 14:25:16,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:16,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:25:16,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:16,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:25:16,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:25:16,855 INFO L87 Difference]: Start difference. First operand 292 states and 463 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-01-09 14:25:20,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:20,263 INFO L93 Difference]: Finished difference Result 1424 states and 2218 transitions. [2025-01-09 14:25:20,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 14:25:20,264 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) Word has length 421 [2025-01-09 14:25:20,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:20,277 INFO L225 Difference]: With dead ends: 1424 [2025-01-09 14:25:20,279 INFO L226 Difference]: Without dead ends: 1135 [2025-01-09 14:25:20,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2025-01-09 14:25:20,281 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 751 mSDsluCounter, 1881 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 2304 SdHoareTripleChecker+Invalid, 1405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:20,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 2304 Invalid, 1405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 14:25:20,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2025-01-09 14:25:20,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 903. [2025-01-09 14:25:20,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 662 states have (on average 1.4425981873111782) internal successors, (955), 668 states have internal predecessors, (955), 232 states have call successors, (232), 8 states have call predecessors, (232), 8 states have return successors, (232), 226 states have call predecessors, (232), 232 states have call successors, (232) [2025-01-09 14:25:20,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1419 transitions. [2025-01-09 14:25:20,419 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1419 transitions. Word has length 421 [2025-01-09 14:25:20,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:20,422 INFO L471 AbstractCegarLoop]: Abstraction has 903 states and 1419 transitions. [2025-01-09 14:25:20,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-01-09 14:25:20,422 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1419 transitions. [2025-01-09 14:25:20,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2025-01-09 14:25:20,430 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:20,431 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:25:20,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:25:20,431 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:20,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:20,432 INFO L85 PathProgramCache]: Analyzing trace with hash -867465808, now seen corresponding path program 1 times [2025-01-09 14:25:20,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:20,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46867522] [2025-01-09 14:25:20,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:20,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:20,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 421 statements into 1 equivalence classes. [2025-01-09 14:25:20,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 421 of 421 statements. [2025-01-09 14:25:20,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:20,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:21,257 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:25:21,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:21,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46867522] [2025-01-09 14:25:21,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46867522] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:21,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:25:21,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:25:21,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825599655] [2025-01-09 14:25:21,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:21,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:25:21,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:21,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:25:21,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:25:21,259 INFO L87 Difference]: Start difference. First operand 903 states and 1419 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:25:21,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:21,784 INFO L93 Difference]: Finished difference Result 2545 states and 3977 transitions. [2025-01-09 14:25:21,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:25:21,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 421 [2025-01-09 14:25:21,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:21,796 INFO L225 Difference]: With dead ends: 2545 [2025-01-09 14:25:21,796 INFO L226 Difference]: Without dead ends: 1645 [2025-01-09 14:25:21,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:25:21,804 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 300 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:21,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 969 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:25:21,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2025-01-09 14:25:21,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1006. [2025-01-09 14:25:21,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 765 states have (on average 1.473202614379085) internal successors, (1127), 771 states have internal predecessors, (1127), 232 states have call successors, (232), 8 states have call predecessors, (232), 8 states have return successors, (232), 226 states have call predecessors, (232), 232 states have call successors, (232) [2025-01-09 14:25:21,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1591 transitions. [2025-01-09 14:25:21,911 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1591 transitions. Word has length 421 [2025-01-09 14:25:21,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:21,911 INFO L471 AbstractCegarLoop]: Abstraction has 1006 states and 1591 transitions. [2025-01-09 14:25:21,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:25:21,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1591 transitions. [2025-01-09 14:25:21,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2025-01-09 14:25:21,918 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:21,918 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:25:21,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:25:21,919 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:21,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:21,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1433356782, now seen corresponding path program 1 times [2025-01-09 14:25:21,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:21,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836274377] [2025-01-09 14:25:21,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:21,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:21,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 421 statements into 1 equivalence classes. [2025-01-09 14:25:22,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 421 of 421 statements. [2025-01-09 14:25:22,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:22,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:22,610 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:25:22,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:22,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836274377] [2025-01-09 14:25:22,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836274377] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:22,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:25:22,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:25:22,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986892702] [2025-01-09 14:25:22,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:22,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:25:22,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:22,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:25:22,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:25:22,614 INFO L87 Difference]: Start difference. First operand 1006 states and 1591 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:25:22,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:22,993 INFO L93 Difference]: Finished difference Result 3685 states and 5795 transitions. [2025-01-09 14:25:22,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:25:22,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 421 [2025-01-09 14:25:22,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:23,009 INFO L225 Difference]: With dead ends: 3685 [2025-01-09 14:25:23,010 INFO L226 Difference]: Without dead ends: 2682 [2025-01-09 14:25:23,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:25:23,014 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 341 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:23,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 883 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:25:23,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2025-01-09 14:25:23,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 2200. [2025-01-09 14:25:23,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2200 states, 1795 states have (on average 1.4958217270194987) internal successors, (2685), 1809 states have internal predecessors, (2685), 388 states have call successors, (388), 16 states have call predecessors, (388), 16 states have return successors, (388), 374 states have call predecessors, (388), 388 states have call successors, (388) [2025-01-09 14:25:23,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 3461 transitions. [2025-01-09 14:25:23,179 INFO L78 Accepts]: Start accepts. Automaton has 2200 states and 3461 transitions. Word has length 421 [2025-01-09 14:25:23,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:23,180 INFO L471 AbstractCegarLoop]: Abstraction has 2200 states and 3461 transitions. [2025-01-09 14:25:23,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:25:23,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 3461 transitions. [2025-01-09 14:25:23,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2025-01-09 14:25:23,186 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:23,186 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:25:23,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:25:23,187 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:23,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:23,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1047469098, now seen corresponding path program 1 times [2025-01-09 14:25:23,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:23,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586814255] [2025-01-09 14:25:23,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:23,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:23,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-01-09 14:25:23,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-01-09 14:25:23,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:23,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:25,356 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 39 proven. 159 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-01-09 14:25:25,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:25,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586814255] [2025-01-09 14:25:25,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586814255] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:25:25,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852028071] [2025-01-09 14:25:25,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:25,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:25:25,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:25:25,363 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:25:25,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 14:25:25,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-01-09 14:25:25,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-01-09 14:25:25,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:25,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:25,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 14:25:25,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:25:27,592 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 3057 proven. 159 refuted. 0 times theorem prover too weak. 5628 trivial. 0 not checked. [2025-01-09 14:25:27,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:25:28,125 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 39 proven. 159 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-01-09 14:25:28,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852028071] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:25:28,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:25:28,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2025-01-09 14:25:28,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434552577] [2025-01-09 14:25:28,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:25:28,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 14:25:28,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:28,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 14:25:28,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2025-01-09 14:25:28,129 INFO L87 Difference]: Start difference. First operand 2200 states and 3461 transitions. Second operand has 20 states, 20 states have (on average 10.5) internal successors, (210), 20 states have internal predecessors, (210), 8 states have call successors, (187), 4 states have call predecessors, (187), 7 states have return successors, (187), 8 states have call predecessors, (187), 8 states have call successors, (187) [2025-01-09 14:25:30,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:30,403 INFO L93 Difference]: Finished difference Result 5546 states and 8571 transitions. [2025-01-09 14:25:30,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 14:25:30,404 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 10.5) internal successors, (210), 20 states have internal predecessors, (210), 8 states have call successors, (187), 4 states have call predecessors, (187), 7 states have return successors, (187), 8 states have call predecessors, (187), 8 states have call successors, (187) Word has length 422 [2025-01-09 14:25:30,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:30,428 INFO L225 Difference]: With dead ends: 5546 [2025-01-09 14:25:30,429 INFO L226 Difference]: Without dead ends: 3349 [2025-01-09 14:25:30,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 865 GetRequests, 837 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=221, Invalid=649, Unknown=0, NotChecked=0, Total=870 [2025-01-09 14:25:30,438 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 689 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 1465 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 1737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 1465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:30,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 1083 Invalid, 1737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 1465 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 14:25:30,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3349 states. [2025-01-09 14:25:30,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3349 to 2550. [2025-01-09 14:25:30,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2550 states, 2041 states have (on average 1.4532092111709947) internal successors, (2966), 2063 states have internal predecessors, (2966), 476 states have call successors, (476), 32 states have call predecessors, (476), 32 states have return successors, (476), 454 states have call predecessors, (476), 476 states have call successors, (476) [2025-01-09 14:25:30,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2550 states to 2550 states and 3918 transitions. [2025-01-09 14:25:30,763 INFO L78 Accepts]: Start accepts. Automaton has 2550 states and 3918 transitions. Word has length 422 [2025-01-09 14:25:30,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:30,764 INFO L471 AbstractCegarLoop]: Abstraction has 2550 states and 3918 transitions. [2025-01-09 14:25:30,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 10.5) internal successors, (210), 20 states have internal predecessors, (210), 8 states have call successors, (187), 4 states have call predecessors, (187), 7 states have return successors, (187), 8 states have call predecessors, (187), 8 states have call successors, (187) [2025-01-09 14:25:30,764 INFO L276 IsEmpty]: Start isEmpty. Operand 2550 states and 3918 transitions. [2025-01-09 14:25:30,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2025-01-09 14:25:30,771 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:30,771 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:25:30,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 14:25:30,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:25:30,976 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:30,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:30,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1376216297, now seen corresponding path program 1 times [2025-01-09 14:25:30,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:30,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976540605] [2025-01-09 14:25:30,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:30,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:31,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-01-09 14:25:31,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-01-09 14:25:31,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:31,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:32,179 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 39 proven. 159 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-01-09 14:25:32,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:32,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976540605] [2025-01-09 14:25:32,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976540605] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:25:32,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36866025] [2025-01-09 14:25:32,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:32,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:25:32,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:25:32,182 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:25:32,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 14:25:32,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-01-09 14:25:32,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-01-09 14:25:32,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:32,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:32,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 942 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 14:25:32,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:25:33,235 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 3496 proven. 51 refuted. 0 times theorem prover too weak. 5297 trivial. 0 not checked. [2025-01-09 14:25:33,236 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:25:33,833 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 147 proven. 51 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-01-09 14:25:33,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36866025] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:25:33,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:25:33,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 21 [2025-01-09 14:25:33,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632216095] [2025-01-09 14:25:33,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:25:33,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 14:25:33,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:33,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 14:25:33,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2025-01-09 14:25:33,837 INFO L87 Difference]: Start difference. First operand 2550 states and 3918 transitions. Second operand has 21 states, 21 states have (on average 10.857142857142858) internal successors, (228), 21 states have internal predecessors, (228), 6 states have call successors, (201), 3 states have call predecessors, (201), 6 states have return successors, (201), 6 states have call predecessors, (201), 6 states have call successors, (201) [2025-01-09 14:25:43,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:43,704 INFO L93 Difference]: Finished difference Result 20503 states and 31083 transitions. [2025-01-09 14:25:43,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2025-01-09 14:25:43,705 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 10.857142857142858) internal successors, (228), 21 states have internal predecessors, (228), 6 states have call successors, (201), 3 states have call predecessors, (201), 6 states have return successors, (201), 6 states have call predecessors, (201), 6 states have call successors, (201) Word has length 423 [2025-01-09 14:25:43,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:43,774 INFO L225 Difference]: With dead ends: 20503 [2025-01-09 14:25:43,774 INFO L226 Difference]: Without dead ends: 17956 [2025-01-09 14:25:43,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1008 GetRequests, 847 SyntacticMatches, 1 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10216 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3920, Invalid=22162, Unknown=0, NotChecked=0, Total=26082 [2025-01-09 14:25:43,792 INFO L435 NwaCegarLoop]: 987 mSDtfsCounter, 5898 mSDsluCounter, 7994 mSDsCounter, 0 mSdLazyCounter, 5519 mSolverCounterSat, 3319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5966 SdHoareTripleChecker+Valid, 8981 SdHoareTripleChecker+Invalid, 8838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3319 IncrementalHoareTripleChecker+Valid, 5519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:43,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5966 Valid, 8981 Invalid, 8838 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3319 Valid, 5519 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2025-01-09 14:25:43,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17956 states. [2025-01-09 14:25:44,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17956 to 4126. [2025-01-09 14:25:44,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4126 states, 3231 states have (on average 1.447539461467038) internal successors, (4677), 3260 states have internal predecessors, (4677), 827 states have call successors, (827), 67 states have call predecessors, (827), 67 states have return successors, (827), 798 states have call predecessors, (827), 827 states have call successors, (827) [2025-01-09 14:25:44,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4126 states to 4126 states and 6331 transitions. [2025-01-09 14:25:44,391 INFO L78 Accepts]: Start accepts. Automaton has 4126 states and 6331 transitions. Word has length 423 [2025-01-09 14:25:44,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:44,392 INFO L471 AbstractCegarLoop]: Abstraction has 4126 states and 6331 transitions. [2025-01-09 14:25:44,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 10.857142857142858) internal successors, (228), 21 states have internal predecessors, (228), 6 states have call successors, (201), 3 states have call predecessors, (201), 6 states have return successors, (201), 6 states have call predecessors, (201), 6 states have call successors, (201) [2025-01-09 14:25:44,393 INFO L276 IsEmpty]: Start isEmpty. Operand 4126 states and 6331 transitions. [2025-01-09 14:25:44,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2025-01-09 14:25:44,399 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:44,399 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:25:44,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 14:25:44,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:25:44,600 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:44,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:44,601 INFO L85 PathProgramCache]: Analyzing trace with hash -291949097, now seen corresponding path program 1 times [2025-01-09 14:25:44,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:44,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670197801] [2025-01-09 14:25:44,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:44,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:44,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-01-09 14:25:44,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-01-09 14:25:44,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:44,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:45,960 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 213 proven. 177 refuted. 0 times theorem prover too weak. 8454 trivial. 0 not checked. [2025-01-09 14:25:45,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:45,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670197801] [2025-01-09 14:25:45,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670197801] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:25:45,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612549372] [2025-01-09 14:25:45,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:45,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:25:45,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:25:45,964 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:25:45,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 14:25:46,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-01-09 14:25:46,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-01-09 14:25:46,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:46,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:46,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 14:25:46,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:25:47,337 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 3577 proven. 93 refuted. 0 times theorem prover too weak. 5174 trivial. 0 not checked. [2025-01-09 14:25:47,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:25:48,104 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 297 proven. 96 refuted. 0 times theorem prover too weak. 8451 trivial. 0 not checked. [2025-01-09 14:25:48,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612549372] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:25:48,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:25:48,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 11] total 27 [2025-01-09 14:25:48,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438517100] [2025-01-09 14:25:48,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:25:48,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 14:25:48,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:48,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 14:25:48,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2025-01-09 14:25:48,108 INFO L87 Difference]: Start difference. First operand 4126 states and 6331 transitions. Second operand has 27 states, 27 states have (on average 8.74074074074074) internal successors, (236), 27 states have internal predecessors, (236), 8 states have call successors, (187), 4 states have call predecessors, (187), 9 states have return successors, (188), 8 states have call predecessors, (188), 8 states have call successors, (188) [2025-01-09 14:26:07,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:07,003 INFO L93 Difference]: Finished difference Result 21248 states and 31850 transitions. [2025-01-09 14:26:07,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 270 states. [2025-01-09 14:26:07,004 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 8.74074074074074) internal successors, (236), 27 states have internal predecessors, (236), 8 states have call successors, (187), 4 states have call predecessors, (187), 9 states have return successors, (188), 8 states have call predecessors, (188), 8 states have call successors, (188) Word has length 423 [2025-01-09 14:26:07,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:07,083 INFO L225 Difference]: With dead ends: 21248 [2025-01-09 14:26:07,084 INFO L226 Difference]: Without dead ends: 17256 [2025-01-09 14:26:07,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1151 GetRequests, 864 SyntacticMatches, 1 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36800 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=11159, Invalid=71497, Unknown=0, NotChecked=0, Total=82656 [2025-01-09 14:26:07,113 INFO L435 NwaCegarLoop]: 1172 mSDtfsCounter, 4060 mSDsluCounter, 9380 mSDsCounter, 0 mSdLazyCounter, 14304 mSolverCounterSat, 1560 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4076 SdHoareTripleChecker+Valid, 10552 SdHoareTripleChecker+Invalid, 15864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1560 IncrementalHoareTripleChecker+Valid, 14304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:07,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4076 Valid, 10552 Invalid, 15864 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1560 Valid, 14304 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2025-01-09 14:26:07,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17256 states. [2025-01-09 14:26:08,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17256 to 5413. [2025-01-09 14:26:08,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5413 states, 4257 states have (on average 1.4343434343434343) internal successors, (6106), 4294 states have internal predecessors, (6106), 1048 states have call successors, (1048), 107 states have call predecessors, (1048), 107 states have return successors, (1048), 1011 states have call predecessors, (1048), 1048 states have call successors, (1048) [2025-01-09 14:26:08,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5413 states to 5413 states and 8202 transitions. [2025-01-09 14:26:08,093 INFO L78 Accepts]: Start accepts. Automaton has 5413 states and 8202 transitions. Word has length 423 [2025-01-09 14:26:08,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:08,094 INFO L471 AbstractCegarLoop]: Abstraction has 5413 states and 8202 transitions. [2025-01-09 14:26:08,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.74074074074074) internal successors, (236), 27 states have internal predecessors, (236), 8 states have call successors, (187), 4 states have call predecessors, (187), 9 states have return successors, (188), 8 states have call predecessors, (188), 8 states have call successors, (188) [2025-01-09 14:26:08,094 INFO L276 IsEmpty]: Start isEmpty. Operand 5413 states and 8202 transitions. [2025-01-09 14:26:08,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2025-01-09 14:26:08,101 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:08,101 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:26:08,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 14:26:08,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-09 14:26:08,307 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:08,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:08,308 INFO L85 PathProgramCache]: Analyzing trace with hash 628444433, now seen corresponding path program 1 times [2025-01-09 14:26:08,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:08,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545045174] [2025-01-09 14:26:08,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:08,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:08,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes. [2025-01-09 14:26:08,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements. [2025-01-09 14:26:08,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:08,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:09,221 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 75 proven. 123 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-01-09 14:26:09,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:09,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545045174] [2025-01-09 14:26:09,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545045174] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:26:09,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581373948] [2025-01-09 14:26:09,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:09,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:26:09,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:26:09,225 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:26:09,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 14:26:09,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes. [2025-01-09 14:26:09,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements. [2025-01-09 14:26:09,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:09,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:09,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 946 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:26:09,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:26:09,886 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 4216 proven. 123 refuted. 0 times theorem prover too weak. 4505 trivial. 0 not checked. [2025-01-09 14:26:09,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:26:10,257 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 75 proven. 123 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-01-09 14:26:10,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581373948] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:26:10,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:26:10,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 14:26:10,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162419219] [2025-01-09 14:26:10,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:26:10,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:26:10,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:10,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:26:10,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:26:10,261 INFO L87 Difference]: Start difference. First operand 5413 states and 8202 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 2 states have call successors, (108), 2 states have call predecessors, (108), 4 states have return successors, (109), 2 states have call predecessors, (109), 2 states have call successors, (109) [2025-01-09 14:26:11,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:11,284 INFO L93 Difference]: Finished difference Result 10079 states and 15202 transitions. [2025-01-09 14:26:11,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:26:11,289 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 2 states have call successors, (108), 2 states have call predecessors, (108), 4 states have return successors, (109), 2 states have call predecessors, (109), 2 states have call successors, (109) Word has length 424 [2025-01-09 14:26:11,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:11,312 INFO L225 Difference]: With dead ends: 10079 [2025-01-09 14:26:11,313 INFO L226 Difference]: Without dead ends: 4778 [2025-01-09 14:26:11,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 854 GetRequests, 845 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:26:11,327 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 404 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:11,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 540 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:26:11,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4778 states. [2025-01-09 14:26:12,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4778 to 4218. [2025-01-09 14:26:12,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4218 states, 3267 states have (on average 1.3905723905723906) internal successors, (4543), 3296 states have internal predecessors, (4543), 852 states have call successors, (852), 98 states have call predecessors, (852), 98 states have return successors, (852), 823 states have call predecessors, (852), 852 states have call successors, (852) [2025-01-09 14:26:12,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4218 states to 4218 states and 6247 transitions. [2025-01-09 14:26:12,139 INFO L78 Accepts]: Start accepts. Automaton has 4218 states and 6247 transitions. Word has length 424 [2025-01-09 14:26:12,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:12,140 INFO L471 AbstractCegarLoop]: Abstraction has 4218 states and 6247 transitions. [2025-01-09 14:26:12,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 2 states have call successors, (108), 2 states have call predecessors, (108), 4 states have return successors, (109), 2 states have call predecessors, (109), 2 states have call successors, (109) [2025-01-09 14:26:12,140 INFO L276 IsEmpty]: Start isEmpty. Operand 4218 states and 6247 transitions. [2025-01-09 14:26:12,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2025-01-09 14:26:12,146 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:12,146 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:26:12,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 14:26:12,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:26:12,350 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:12,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:12,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1242065304, now seen corresponding path program 1 times [2025-01-09 14:26:12,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:12,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702074990] [2025-01-09 14:26:12,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:12,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:12,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes. [2025-01-09 14:26:13,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements. [2025-01-09 14:26:13,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:13,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:14,011 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 63 proven. 327 refuted. 0 times theorem prover too weak. 8454 trivial. 0 not checked. [2025-01-09 14:26:14,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:14,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702074990] [2025-01-09 14:26:14,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702074990] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:26:14,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006328662] [2025-01-09 14:26:14,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:14,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:26:14,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:26:14,015 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:26:14,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 14:26:14,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes. [2025-01-09 14:26:14,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements. [2025-01-09 14:26:14,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:14,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:14,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 940 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 14:26:14,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:26:16,082 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 3264 proven. 441 refuted. 0 times theorem prover too weak. 5139 trivial. 0 not checked. [2025-01-09 14:26:16,083 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:26:16,735 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 93 proven. 300 refuted. 0 times theorem prover too weak. 8451 trivial. 0 not checked. [2025-01-09 14:26:16,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006328662] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:26:16,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:26:16,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 9] total 21 [2025-01-09 14:26:16,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77654573] [2025-01-09 14:26:16,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:26:16,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 14:26:16,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:16,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 14:26:16,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2025-01-09 14:26:16,740 INFO L87 Difference]: Start difference. First operand 4218 states and 6247 transitions. Second operand has 21 states, 21 states have (on average 10.476190476190476) internal successors, (220), 21 states have internal predecessors, (220), 7 states have call successors, (177), 4 states have call predecessors, (177), 7 states have return successors, (179), 7 states have call predecessors, (179), 7 states have call successors, (179)