./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-53.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_amount500_file-53.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 433e151ff3abdaf4e4718c9ced99d2dc7cf27dfb3e48e73977d43bba901b54fd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:47:52,464 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:47:52,508 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:47:52,512 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:47:52,515 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:47:52,531 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:47:52,531 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:47:52,532 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:47:52,532 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:47:52,532 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:47:52,532 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:47:52,532 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:47:52,532 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:47:52,532 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:47:52,532 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:47:52,533 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:47:52,533 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:47:52,533 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:47:52,533 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:47:52,533 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:47:52,533 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:47:52,533 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:47:52,533 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:47:52,533 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:47:52,533 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:47:52,534 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:47:52,534 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:47:52,534 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:47:52,534 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:47:52,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:47:52,534 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:47:52,534 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:47:52,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:47:52,534 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:47:52,535 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:47:52,535 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:47:52,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:47:52,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:47:52,535 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:47:52,535 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:47:52,535 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:47:52,535 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:47:52,535 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:47:52,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:47:52,536 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:47:52,536 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:47:52,536 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:47:52,536 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:47:52,536 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 -> 433e151ff3abdaf4e4718c9ced99d2dc7cf27dfb3e48e73977d43bba901b54fd [2025-01-09 14:47:52,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:47:52,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:47:52,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:47:52,758 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:47:52,758 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:47:52,759 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-53.i [2025-01-09 14:47:54,000 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2b9a95b02/cd4961629c6744298ff72bacb1934f09/FLAGbc1dd80d8 [2025-01-09 14:47:54,333 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:47:54,334 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-53.i [2025-01-09 14:47:54,344 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2b9a95b02/cd4961629c6744298ff72bacb1934f09/FLAGbc1dd80d8 [2025-01-09 14:47:54,575 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2b9a95b02/cd4961629c6744298ff72bacb1934f09 [2025-01-09 14:47:54,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:47:54,578 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:47:54,582 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:47:54,582 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:47:54,585 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:47:54,586 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:47:54" (1/1) ... [2025-01-09 14:47:54,588 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5326b995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:54, skipping insertion in model container [2025-01-09 14:47:54,588 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:47:54" (1/1) ... [2025-01-09 14:47:54,617 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:47:54,718 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_amount500_file-53.i[916,929] [2025-01-09 14:47:54,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:47:54,871 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:47:54,878 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_amount500_file-53.i[916,929] [2025-01-09 14:47:54,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:47:54,954 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:47:54,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:54 WrapperNode [2025-01-09 14:47:54,955 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:47:54,956 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:47:54,958 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:47:54,958 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:47:54,963 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:47:54" (1/1) ... [2025-01-09 14:47:54,980 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:47:54" (1/1) ... [2025-01-09 14:47:55,058 INFO L138 Inliner]: procedures = 26, calls = 80, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 609 [2025-01-09 14:47:55,059 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:47:55,059 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:47:55,060 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:47:55,060 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:47:55,067 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:54" (1/1) ... [2025-01-09 14:47:55,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:54" (1/1) ... [2025-01-09 14:47:55,086 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:54" (1/1) ... [2025-01-09 14:47:55,167 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:47:55,167 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:54" (1/1) ... [2025-01-09 14:47:55,168 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:54" (1/1) ... [2025-01-09 14:47:55,196 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:54" (1/1) ... [2025-01-09 14:47:55,210 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:54" (1/1) ... [2025-01-09 14:47:55,216 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:54" (1/1) ... [2025-01-09 14:47:55,234 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:54" (1/1) ... [2025-01-09 14:47:55,238 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:54" (1/1) ... [2025-01-09 14:47:55,252 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:47:55,254 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:47:55,254 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:47:55,254 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:47:55,255 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:54" (1/1) ... [2025-01-09 14:47:55,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:47:55,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:55,282 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:47:55,293 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:47:55,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:47:55,312 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:47:55,312 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:47:55,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:47:55,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:47:55,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:47:55,428 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:47:55,429 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:47:56,297 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-01-09 14:47:56,297 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:47:56,313 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:47:56,313 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:47:56,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:47:56 BoogieIcfgContainer [2025-01-09 14:47:56,314 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:47:56,316 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:47:56,317 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:47:56,320 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:47:56,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:47:54" (1/3) ... [2025-01-09 14:47:56,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36fb5d0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:47:56, skipping insertion in model container [2025-01-09 14:47:56,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:54" (2/3) ... [2025-01-09 14:47:56,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36fb5d0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:47:56, skipping insertion in model container [2025-01-09 14:47:56,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:47:56" (3/3) ... [2025-01-09 14:47:56,323 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-53.i [2025-01-09 14:47:56,333 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:47:56,335 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-53.i that has 2 procedures, 247 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:47:56,390 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:47:56,402 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;@42d5ea69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:47:56,402 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:47:56,407 INFO L276 IsEmpty]: Start isEmpty. Operand has 247 states, 177 states have (on average 1.576271186440678) internal successors, (279), 178 states have internal predecessors, (279), 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:47:56,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-01-09 14:47:56,427 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:56,429 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:56,429 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:56,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:56,435 INFO L85 PathProgramCache]: Analyzing trace with hash -717631323, now seen corresponding path program 1 times [2025-01-09 14:47:56,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:56,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986632715] [2025-01-09 14:47:56,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:56,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:56,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-01-09 14:47:56,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-01-09 14:47:56,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:56,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:56,980 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:47:56,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:56,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986632715] [2025-01-09 14:47:56,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986632715] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:47:56,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343391959] [2025-01-09 14:47:56,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:56,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:56,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:56,989 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:47:56,991 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:47:57,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-01-09 14:47:57,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-01-09 14:47:57,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:57,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:57,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 1142 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:47:57,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:47:57,391 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:47:57,392 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:47:57,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343391959] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:57,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:47:57,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:47:57,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723202290] [2025-01-09 14:47:57,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:57,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:47:57,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:57,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:47:57,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:47:57,420 INFO L87 Difference]: Start difference. First operand has 247 states, 177 states have (on average 1.576271186440678) internal successors, (279), 178 states have internal predecessors, (279), 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 63.0) internal successors, (126), 2 states have internal predecessors, (126), 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:47:57,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:57,472 INFO L93 Difference]: Finished difference Result 488 states and 888 transitions. [2025-01-09 14:47:57,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:47:57,473 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 63.0) internal successors, (126), 2 states have internal predecessors, (126), 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 456 [2025-01-09 14:47:57,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:57,481 INFO L225 Difference]: With dead ends: 488 [2025-01-09 14:47:57,481 INFO L226 Difference]: Without dead ends: 244 [2025-01-09 14:47:57,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 457 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:47:57,487 INFO L435 NwaCegarLoop]: 406 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, 406 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:47:57,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:47:57,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-01-09 14:47:57,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2025-01-09 14:47:57,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 175 states have (on average 1.5542857142857143) internal successors, (272), 175 states have internal predecessors, (272), 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:47:57,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 406 transitions. [2025-01-09 14:47:57,557 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 406 transitions. Word has length 456 [2025-01-09 14:47:57,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:57,557 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 406 transitions. [2025-01-09 14:47:57,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 63.0) internal successors, (126), 2 states have internal predecessors, (126), 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:47:57,559 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 406 transitions. [2025-01-09 14:47:57,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-01-09 14:47:57,575 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:57,575 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:57,584 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:47:57,776 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:47:57,777 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:57,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:57,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1699040223, now seen corresponding path program 1 times [2025-01-09 14:47:57,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:57,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550542123] [2025-01-09 14:47:57,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:57,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:57,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-01-09 14:47:57,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-01-09 14:47:57,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:57,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:58,336 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:47:58,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:58,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550542123] [2025-01-09 14:47:58,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550542123] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:58,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:58,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:58,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900812549] [2025-01-09 14:47:58,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:58,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:58,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:58,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:58,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:58,339 INFO L87 Difference]: Start difference. First operand 244 states and 406 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:47:58,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:58,435 INFO L93 Difference]: Finished difference Result 634 states and 1056 transitions. [2025-01-09 14:47:58,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:58,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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 456 [2025-01-09 14:47:58,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:58,443 INFO L225 Difference]: With dead ends: 634 [2025-01-09 14:47:58,443 INFO L226 Difference]: Without dead ends: 393 [2025-01-09 14:47:58,444 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:47:58,445 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 227 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:58,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 788 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:47:58,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-01-09 14:47:58,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 390. [2025-01-09 14:47:58,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 294 states have (on average 1.5748299319727892) internal successors, (463), 295 states have internal predecessors, (463), 93 states have call successors, (93), 2 states have call predecessors, (93), 2 states have return successors, (93), 92 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 14:47:58,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 649 transitions. [2025-01-09 14:47:58,492 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 649 transitions. Word has length 456 [2025-01-09 14:47:58,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:58,493 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 649 transitions. [2025-01-09 14:47:58,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:47:58,493 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 649 transitions. [2025-01-09 14:47:58,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-01-09 14:47:58,499 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:58,499 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:58,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:47:58,500 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:58,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:58,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1702440735, now seen corresponding path program 1 times [2025-01-09 14:47:58,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:58,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840567546] [2025-01-09 14:47:58,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:58,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:58,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-01-09 14:47:58,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-01-09 14:47:58,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:58,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:58,965 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:47:58,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:58,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840567546] [2025-01-09 14:47:58,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840567546] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:58,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:58,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:58,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631338749] [2025-01-09 14:47:58,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:58,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:58,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:58,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:58,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:58,967 INFO L87 Difference]: Start difference. First operand 390 states and 649 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:47:59,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:59,069 INFO L93 Difference]: Finished difference Result 1162 states and 1937 transitions. [2025-01-09 14:47:59,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:59,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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 456 [2025-01-09 14:47:59,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:59,079 INFO L225 Difference]: With dead ends: 1162 [2025-01-09 14:47:59,079 INFO L226 Difference]: Without dead ends: 775 [2025-01-09 14:47:59,080 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:47:59,081 INFO L435 NwaCegarLoop]: 769 mSDtfsCounter, 387 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:59,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 1160 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:47:59,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2025-01-09 14:47:59,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 771. [2025-01-09 14:47:59,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 580 states have (on average 1.5655172413793104) internal successors, (908), 582 states have internal predecessors, (908), 186 states have call successors, (186), 4 states have call predecessors, (186), 4 states have return successors, (186), 184 states have call predecessors, (186), 186 states have call successors, (186) [2025-01-09 14:47:59,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1280 transitions. [2025-01-09 14:47:59,146 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1280 transitions. Word has length 456 [2025-01-09 14:47:59,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:59,147 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 1280 transitions. [2025-01-09 14:47:59,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:47:59,147 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1280 transitions. [2025-01-09 14:47:59,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-01-09 14:47:59,152 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:59,152 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:59,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:47:59,152 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:59,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:59,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1748521059, now seen corresponding path program 1 times [2025-01-09 14:47:59,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:59,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664745159] [2025-01-09 14:47:59,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:59,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:59,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-01-09 14:47:59,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-01-09 14:47:59,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:59,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:59,412 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:47:59,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:59,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664745159] [2025-01-09 14:47:59,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664745159] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:59,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:59,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:59,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323071178] [2025-01-09 14:47:59,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:59,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:59,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:59,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:59,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:59,414 INFO L87 Difference]: Start difference. First operand 771 states and 1280 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:47:59,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:59,517 INFO L93 Difference]: Finished difference Result 2147 states and 3566 transitions. [2025-01-09 14:47:59,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:59,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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 456 [2025-01-09 14:47:59,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:59,525 INFO L225 Difference]: With dead ends: 2147 [2025-01-09 14:47:59,525 INFO L226 Difference]: Without dead ends: 1379 [2025-01-09 14:47:59,527 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:47:59,527 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 249 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:59,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 845 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:47:59,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2025-01-09 14:47:59,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1373. [2025-01-09 14:47:59,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1373 states, 1082 states have (on average 1.5693160813308689) internal successors, (1698), 1088 states have internal predecessors, (1698), 282 states have call successors, (282), 8 states have call predecessors, (282), 8 states have return successors, (282), 276 states have call predecessors, (282), 282 states have call successors, (282) [2025-01-09 14:47:59,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 2262 transitions. [2025-01-09 14:47:59,648 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 2262 transitions. Word has length 456 [2025-01-09 14:47:59,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:59,649 INFO L471 AbstractCegarLoop]: Abstraction has 1373 states and 2262 transitions. [2025-01-09 14:47:59,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:47:59,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 2262 transitions. [2025-01-09 14:47:59,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-01-09 14:47:59,656 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:59,656 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:59,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:47:59,657 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:59,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:59,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1110012061, now seen corresponding path program 1 times [2025-01-09 14:47:59,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:59,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403431002] [2025-01-09 14:47:59,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:59,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:59,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-01-09 14:47:59,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-01-09 14:47:59,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:59,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:59,912 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:47:59,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:59,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403431002] [2025-01-09 14:47:59,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403431002] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:59,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:59,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:59,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138372809] [2025-01-09 14:47:59,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:59,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:59,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:59,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:59,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:59,914 INFO L87 Difference]: Start difference. First operand 1373 states and 2262 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:48:00,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:00,063 INFO L93 Difference]: Finished difference Result 4097 states and 6748 transitions. [2025-01-09 14:48:00,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:48:00,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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 456 [2025-01-09 14:48:00,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:00,078 INFO L225 Difference]: With dead ends: 4097 [2025-01-09 14:48:00,078 INFO L226 Difference]: Without dead ends: 2727 [2025-01-09 14:48:00,082 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:48:00,083 INFO L435 NwaCegarLoop]: 747 mSDtfsCounter, 379 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:00,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 1138 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:48:00,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2727 states. [2025-01-09 14:48:00,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2727 to 2725. [2025-01-09 14:48:00,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2725 states, 2144 states have (on average 1.5559701492537314) internal successors, (3336), 2156 states have internal predecessors, (3336), 564 states have call successors, (564), 16 states have call predecessors, (564), 16 states have return successors, (564), 552 states have call predecessors, (564), 564 states have call successors, (564) [2025-01-09 14:48:00,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2725 states to 2725 states and 4464 transitions. [2025-01-09 14:48:00,236 INFO L78 Accepts]: Start accepts. Automaton has 2725 states and 4464 transitions. Word has length 456 [2025-01-09 14:48:00,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:00,236 INFO L471 AbstractCegarLoop]: Abstraction has 2725 states and 4464 transitions. [2025-01-09 14:48:00,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:48:00,238 INFO L276 IsEmpty]: Start isEmpty. Operand 2725 states and 4464 transitions. [2025-01-09 14:48:00,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-01-09 14:48:00,243 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:00,243 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:00,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:48:00,244 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:00,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:00,245 INFO L85 PathProgramCache]: Analyzing trace with hash -450480539, now seen corresponding path program 1 times [2025-01-09 14:48:00,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:00,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817686759] [2025-01-09 14:48:00,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:00,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:00,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-01-09 14:48:00,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-01-09 14:48:00,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:00,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:00,938 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:48:00,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:00,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817686759] [2025-01-09 14:48:00,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817686759] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:00,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:00,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:48:00,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305878649] [2025-01-09 14:48:00,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:00,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:48:00,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:00,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:48:00,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:48:00,940 INFO L87 Difference]: Start difference. First operand 2725 states and 4464 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:48:01,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:01,171 INFO L93 Difference]: Finished difference Result 8169 states and 13386 transitions. [2025-01-09 14:48:01,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:48:01,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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 456 [2025-01-09 14:48:01,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:01,197 INFO L225 Difference]: With dead ends: 8169 [2025-01-09 14:48:01,198 INFO L226 Difference]: Without dead ends: 5447 [2025-01-09 14:48:01,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:48:01,204 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 223 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:01,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 792 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:48:01,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5447 states. [2025-01-09 14:48:01,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5447 to 5429. [2025-01-09 14:48:01,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5429 states, 4268 states have (on average 1.549203373945642) internal successors, (6612), 4292 states have internal predecessors, (6612), 1128 states have call successors, (1128), 32 states have call predecessors, (1128), 32 states have return successors, (1128), 1104 states have call predecessors, (1128), 1128 states have call successors, (1128) [2025-01-09 14:48:01,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5429 states to 5429 states and 8868 transitions. [2025-01-09 14:48:01,558 INFO L78 Accepts]: Start accepts. Automaton has 5429 states and 8868 transitions. Word has length 456 [2025-01-09 14:48:01,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:01,559 INFO L471 AbstractCegarLoop]: Abstraction has 5429 states and 8868 transitions. [2025-01-09 14:48:01,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:48:01,560 INFO L276 IsEmpty]: Start isEmpty. Operand 5429 states and 8868 transitions. [2025-01-09 14:48:01,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-01-09 14:48:01,565 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:01,565 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:01,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:48:01,566 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:01,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:01,566 INFO L85 PathProgramCache]: Analyzing trace with hash -843507549, now seen corresponding path program 1 times [2025-01-09 14:48:01,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:01,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400199920] [2025-01-09 14:48:01,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:01,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:01,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-01-09 14:48:01,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-01-09 14:48:01,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:01,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:03,262 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:48:03,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:03,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400199920] [2025-01-09 14:48:03,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400199920] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:03,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:03,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:48:03,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307437349] [2025-01-09 14:48:03,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:03,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:48:03,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:03,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:48:03,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:48:03,264 INFO L87 Difference]: Start difference. First operand 5429 states and 8868 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 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:48:04,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:04,389 INFO L93 Difference]: Finished difference Result 15779 states and 25693 transitions. [2025-01-09 14:48:04,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:48:04,392 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 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 456 [2025-01-09 14:48:04,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:04,437 INFO L225 Difference]: With dead ends: 15779 [2025-01-09 14:48:04,437 INFO L226 Difference]: Without dead ends: 10353 [2025-01-09 14:48:04,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:48:04,454 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 1231 mSDsluCounter, 1810 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1231 SdHoareTripleChecker+Valid, 2323 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:04,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1231 Valid, 2323 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:48:04,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10353 states. [2025-01-09 14:48:04,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10353 to 6711. [2025-01-09 14:48:04,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6711 states, 5479 states have (on average 1.5803978828253331) internal successors, (8659), 5503 states have internal predecessors, (8659), 1195 states have call successors, (1195), 36 states have call predecessors, (1195), 36 states have return successors, (1195), 1171 states have call predecessors, (1195), 1195 states have call successors, (1195) [2025-01-09 14:48:04,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6711 states to 6711 states and 11049 transitions. [2025-01-09 14:48:04,937 INFO L78 Accepts]: Start accepts. Automaton has 6711 states and 11049 transitions. Word has length 456 [2025-01-09 14:48:04,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:04,938 INFO L471 AbstractCegarLoop]: Abstraction has 6711 states and 11049 transitions. [2025-01-09 14:48:04,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 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:48:04,939 INFO L276 IsEmpty]: Start isEmpty. Operand 6711 states and 11049 transitions. [2025-01-09 14:48:04,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-01-09 14:48:04,944 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:04,944 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:04,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:48:04,945 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:04,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:04,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1540417189, now seen corresponding path program 1 times [2025-01-09 14:48:04,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:04,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921982584] [2025-01-09 14:48:04,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:04,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:04,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-01-09 14:48:05,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-01-09 14:48:05,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:05,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:05,840 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:48:05,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:05,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921982584] [2025-01-09 14:48:05,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921982584] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:05,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:05,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:48:05,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827684520] [2025-01-09 14:48:05,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:05,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:48:05,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:05,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:48:05,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:48:05,844 INFO L87 Difference]: Start difference. First operand 6711 states and 11049 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 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:48:06,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:06,336 INFO L93 Difference]: Finished difference Result 17349 states and 28464 transitions. [2025-01-09 14:48:06,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:48:06,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 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 456 [2025-01-09 14:48:06,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:06,386 INFO L225 Difference]: With dead ends: 17349 [2025-01-09 14:48:06,386 INFO L226 Difference]: Without dead ends: 10775 [2025-01-09 14:48:06,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:48:06,403 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 652 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:06,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 1191 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:48:06,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10775 states. [2025-01-09 14:48:06,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10775 to 8255. [2025-01-09 14:48:06,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8255 states, 6443 states have (on average 1.5388794040043459) internal successors, (9915), 6480 states have internal predecessors, (9915), 1759 states have call successors, (1759), 52 states have call predecessors, (1759), 52 states have return successors, (1759), 1722 states have call predecessors, (1759), 1759 states have call successors, (1759) [2025-01-09 14:48:06,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8255 states to 8255 states and 13433 transitions. [2025-01-09 14:48:06,815 INFO L78 Accepts]: Start accepts. Automaton has 8255 states and 13433 transitions. Word has length 456 [2025-01-09 14:48:06,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:06,816 INFO L471 AbstractCegarLoop]: Abstraction has 8255 states and 13433 transitions. [2025-01-09 14:48:06,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 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:48:06,817 INFO L276 IsEmpty]: Start isEmpty. Operand 8255 states and 13433 transitions. [2025-01-09 14:48:06,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-01-09 14:48:06,822 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:06,822 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:06,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:48:06,822 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:06,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:06,823 INFO L85 PathProgramCache]: Analyzing trace with hash 890596901, now seen corresponding path program 1 times [2025-01-09 14:48:06,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:06,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559948192] [2025-01-09 14:48:06,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:06,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:06,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-01-09 14:48:07,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-01-09 14:48:07,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:07,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:08,015 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:48:08,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:08,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559948192] [2025-01-09 14:48:08,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559948192] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:08,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:08,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 14:48:08,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594648728] [2025-01-09 14:48:08,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:08,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:48:08,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:08,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:48:08,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:48:08,018 INFO L87 Difference]: Start difference. First operand 8255 states and 13433 transitions. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 2 states have call successors, (67), 1 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:48:09,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:09,207 INFO L93 Difference]: Finished difference Result 21317 states and 34601 transitions. [2025-01-09 14:48:09,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:48:09,208 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 2 states have call successors, (67), 1 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 456 [2025-01-09 14:48:09,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:09,245 INFO L225 Difference]: With dead ends: 21317 [2025-01-09 14:48:09,245 INFO L226 Difference]: Without dead ends: 13187 [2025-01-09 14:48:09,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:48:09,269 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 1093 mSDsluCounter, 1645 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1093 SdHoareTripleChecker+Valid, 2132 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:09,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1093 Valid, 2132 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 14:48:09,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13187 states. [2025-01-09 14:48:09,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13187 to 10031. [2025-01-09 14:48:09,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10031 states, 8219 states have (on average 1.5750091251977125) internal successors, (12945), 8255 states have internal predecessors, (12945), 1759 states have call successors, (1759), 52 states have call predecessors, (1759), 52 states have return successors, (1759), 1723 states have call predecessors, (1759), 1759 states have call successors, (1759) [2025-01-09 14:48:09,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10031 states to 10031 states and 16463 transitions. [2025-01-09 14:48:09,755 INFO L78 Accepts]: Start accepts. Automaton has 10031 states and 16463 transitions. Word has length 456 [2025-01-09 14:48:09,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:09,757 INFO L471 AbstractCegarLoop]: Abstraction has 10031 states and 16463 transitions. [2025-01-09 14:48:09,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 2 states have call successors, (67), 1 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:48:09,757 INFO L276 IsEmpty]: Start isEmpty. Operand 10031 states and 16463 transitions. [2025-01-09 14:48:09,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-01-09 14:48:09,765 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:09,765 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:09,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:48:09,765 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:09,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:09,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1020445657, now seen corresponding path program 1 times [2025-01-09 14:48:09,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:09,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389701752] [2025-01-09 14:48:09,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:09,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:09,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-01-09 14:48:10,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-01-09 14:48:10,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:10,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:10,492 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:48:10,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:10,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389701752] [2025-01-09 14:48:10,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389701752] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:10,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:10,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:48:10,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316174181] [2025-01-09 14:48:10,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:10,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:48:10,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:10,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:48:10,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:48:10,494 INFO L87 Difference]: Start difference. First operand 10031 states and 16463 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 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:48:10,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:10,909 INFO L93 Difference]: Finished difference Result 18849 states and 30771 transitions. [2025-01-09 14:48:10,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:48:10,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 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 456 [2025-01-09 14:48:10,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:10,939 INFO L225 Difference]: With dead ends: 18849 [2025-01-09 14:48:10,940 INFO L226 Difference]: Without dead ends: 10117 [2025-01-09 14:48:10,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 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:48:10,960 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 502 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:10,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 717 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:48:10,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10117 states. [2025-01-09 14:48:11,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10117 to 7855. [2025-01-09 14:48:11,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7855 states, 6619 states have (on average 1.5840761444326938) internal successors, (10485), 6631 states have internal predecessors, (10485), 1183 states have call successors, (1183), 52 states have call predecessors, (1183), 52 states have return successors, (1183), 1171 states have call predecessors, (1183), 1183 states have call successors, (1183) [2025-01-09 14:48:11,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7855 states to 7855 states and 12851 transitions. [2025-01-09 14:48:11,310 INFO L78 Accepts]: Start accepts. Automaton has 7855 states and 12851 transitions. Word has length 456 [2025-01-09 14:48:11,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:11,311 INFO L471 AbstractCegarLoop]: Abstraction has 7855 states and 12851 transitions. [2025-01-09 14:48:11,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 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:48:11,311 INFO L276 IsEmpty]: Start isEmpty. Operand 7855 states and 12851 transitions. [2025-01-09 14:48:11,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-01-09 14:48:11,316 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:11,316 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:11,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:48:11,317 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:11,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:11,318 INFO L85 PathProgramCache]: Analyzing trace with hash -741872667, now seen corresponding path program 1 times [2025-01-09 14:48:11,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:11,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819654013] [2025-01-09 14:48:11,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:11,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:11,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-01-09 14:48:11,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-01-09 14:48:11,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:11,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:12,674 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:48:12,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:12,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819654013] [2025-01-09 14:48:12,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819654013] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:12,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:12,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:48:12,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200721554] [2025-01-09 14:48:12,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:12,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:48:12,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:12,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:48:12,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:48:12,676 INFO L87 Difference]: Start difference. First operand 7855 states and 12851 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 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:48:13,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:13,858 INFO L93 Difference]: Finished difference Result 27675 states and 45315 transitions. [2025-01-09 14:48:13,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:48:13,859 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 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 456 [2025-01-09 14:48:13,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:13,904 INFO L225 Difference]: With dead ends: 27675 [2025-01-09 14:48:13,905 INFO L226 Difference]: Without dead ends: 20853 [2025-01-09 14:48:13,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:48:13,918 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 989 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:13,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 1204 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:48:13,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20853 states. [2025-01-09 14:48:14,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20853 to 13689. [2025-01-09 14:48:14,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13689 states, 12285 states have (on average 1.6092796092796093) internal successors, (19770), 12321 states have internal predecessors, (19770), 1327 states have call successors, (1327), 76 states have call predecessors, (1327), 76 states have return successors, (1327), 1291 states have call predecessors, (1327), 1327 states have call successors, (1327) [2025-01-09 14:48:14,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13689 states to 13689 states and 22424 transitions. [2025-01-09 14:48:14,409 INFO L78 Accepts]: Start accepts. Automaton has 13689 states and 22424 transitions. Word has length 456 [2025-01-09 14:48:14,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:14,410 INFO L471 AbstractCegarLoop]: Abstraction has 13689 states and 22424 transitions. [2025-01-09 14:48:14,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 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:48:14,410 INFO L276 IsEmpty]: Start isEmpty. Operand 13689 states and 22424 transitions. [2025-01-09 14:48:14,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-01-09 14:48:14,420 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:14,420 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:14,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:48:14,421 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:14,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:14,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1864150887, now seen corresponding path program 1 times [2025-01-09 14:48:14,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:14,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354215567] [2025-01-09 14:48:14,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:14,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:14,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-01-09 14:48:14,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-01-09 14:48:14,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:14,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:15,183 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:48:15,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:15,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354215567] [2025-01-09 14:48:15,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354215567] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:15,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:15,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:48:15,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479965137] [2025-01-09 14:48:15,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:15,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:48:15,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:15,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:48:15,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:48:15,185 INFO L87 Difference]: Start difference. First operand 13689 states and 22424 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 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:48:15,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:15,613 INFO L93 Difference]: Finished difference Result 24891 states and 40681 transitions. [2025-01-09 14:48:15,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:48:15,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 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 456 [2025-01-09 14:48:15,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:15,652 INFO L225 Difference]: With dead ends: 24891 [2025-01-09 14:48:15,652 INFO L226 Difference]: Without dead ends: 13609 [2025-01-09 14:48:15,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:48:15,671 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 375 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:15,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 656 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:48:15,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13609 states. [2025-01-09 14:48:16,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13609 to 13609. [2025-01-09 14:48:16,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13609 states, 12205 states have (on average 1.6040966816878328) internal successors, (19578), 12241 states have internal predecessors, (19578), 1327 states have call successors, (1327), 76 states have call predecessors, (1327), 76 states have return successors, (1327), 1291 states have call predecessors, (1327), 1327 states have call successors, (1327) [2025-01-09 14:48:16,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13609 states to 13609 states and 22232 transitions. [2025-01-09 14:48:16,143 INFO L78 Accepts]: Start accepts. Automaton has 13609 states and 22232 transitions. Word has length 456 [2025-01-09 14:48:16,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:16,144 INFO L471 AbstractCegarLoop]: Abstraction has 13609 states and 22232 transitions. [2025-01-09 14:48:16,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 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:48:16,144 INFO L276 IsEmpty]: Start isEmpty. Operand 13609 states and 22232 transitions. [2025-01-09 14:48:16,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-01-09 14:48:16,154 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:16,154 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:16,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:48:16,154 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:16,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:16,156 INFO L85 PathProgramCache]: Analyzing trace with hash 721148199, now seen corresponding path program 1 times [2025-01-09 14:48:16,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:16,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424302763] [2025-01-09 14:48:16,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:16,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:16,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-01-09 14:48:16,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-01-09 14:48:16,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:16,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:16,299 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:48:16,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:16,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424302763] [2025-01-09 14:48:16,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424302763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:16,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:16,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:48:16,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360134861] [2025-01-09 14:48:16,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:16,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:48:16,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:16,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:48:16,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:48:16,301 INFO L87 Difference]: Start difference. First operand 13609 states and 22232 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:48:17,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:17,133 INFO L93 Difference]: Finished difference Result 35041 states and 56953 transitions. [2025-01-09 14:48:17,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:48:17,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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 456 [2025-01-09 14:48:17,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:17,189 INFO L225 Difference]: With dead ends: 35041 [2025-01-09 14:48:17,189 INFO L226 Difference]: Without dead ends: 22895 [2025-01-09 14:48:17,200 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:48:17,201 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 271 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:17,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 821 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:48:17,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22895 states. [2025-01-09 14:48:18,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22895 to 22881. [2025-01-09 14:48:18,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22881 states, 20168 states have (on average 1.574821499404998) internal successors, (31761), 20252 states have internal predecessors, (31761), 2563 states have call successors, (2563), 149 states have call predecessors, (2563), 149 states have return successors, (2563), 2479 states have call predecessors, (2563), 2563 states have call successors, (2563) [2025-01-09 14:48:18,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22881 states to 22881 states and 36887 transitions. [2025-01-09 14:48:18,425 INFO L78 Accepts]: Start accepts. Automaton has 22881 states and 36887 transitions. Word has length 456 [2025-01-09 14:48:18,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:18,427 INFO L471 AbstractCegarLoop]: Abstraction has 22881 states and 36887 transitions. [2025-01-09 14:48:18,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:48:18,427 INFO L276 IsEmpty]: Start isEmpty. Operand 22881 states and 36887 transitions. [2025-01-09 14:48:18,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-01-09 14:48:18,446 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:18,447 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:18,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:48:18,447 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:18,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:18,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1634657051, now seen corresponding path program 1 times [2025-01-09 14:48:18,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:18,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745820944] [2025-01-09 14:48:18,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:18,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:18,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-01-09 14:48:20,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-01-09 14:48:20,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:20,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:20,496 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 6 proven. 192 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-01-09 14:48:20,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:20,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745820944] [2025-01-09 14:48:20,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745820944] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:48:20,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651581332] [2025-01-09 14:48:20,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:20,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:48:20,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:48:20,503 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:48:20,504 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:48:20,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-01-09 14:48:20,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-01-09 14:48:20,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:20,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:20,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 1138 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:48:20,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:48:21,163 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 1518 proven. 180 refuted. 0 times theorem prover too weak. 7146 trivial. 0 not checked. [2025-01-09 14:48:21,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:48:21,486 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 18 proven. 180 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-01-09 14:48:21,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651581332] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:48:21,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:48:21,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-01-09 14:48:21,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3038742] [2025-01-09 14:48:21,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:48:21,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:48:21,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:21,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:48:21,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:48:21,489 INFO L87 Difference]: Start difference. First operand 22881 states and 36887 transitions. Second operand has 9 states, 9 states have (on average 28.77777777777778) internal successors, (259), 9 states have internal predecessors, (259), 4 states have call successors, (191), 2 states have call predecessors, (191), 4 states have return successors, (193), 4 states have call predecessors, (193), 4 states have call successors, (193) [2025-01-09 14:48:22,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:22,699 INFO L93 Difference]: Finished difference Result 37543 states and 60159 transitions. [2025-01-09 14:48:22,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 14:48:22,700 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 28.77777777777778) internal successors, (259), 9 states have internal predecessors, (259), 4 states have call successors, (191), 2 states have call predecessors, (191), 4 states have return successors, (193), 4 states have call predecessors, (193), 4 states have call successors, (193) Word has length 456 [2025-01-09 14:48:22,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:22,761 INFO L225 Difference]: With dead ends: 37543 [2025-01-09 14:48:22,761 INFO L226 Difference]: Without dead ends: 14794 [2025-01-09 14:48:22,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 924 GetRequests, 909 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:48:22,794 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 975 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:22,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [976 Valid, 704 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:48:22,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14794 states. [2025-01-09 14:48:23,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14794 to 11183. [2025-01-09 14:48:23,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11183 states, 8708 states have (on average 1.4740468534680753) internal successors, (12836), 8745 states have internal predecessors, (12836), 2275 states have call successors, (2275), 199 states have call predecessors, (2275), 199 states have return successors, (2275), 2238 states have call predecessors, (2275), 2275 states have call successors, (2275) [2025-01-09 14:48:23,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11183 states to 11183 states and 17386 transitions. [2025-01-09 14:48:23,918 INFO L78 Accepts]: Start accepts. Automaton has 11183 states and 17386 transitions. Word has length 456 [2025-01-09 14:48:23,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:23,919 INFO L471 AbstractCegarLoop]: Abstraction has 11183 states and 17386 transitions. [2025-01-09 14:48:23,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.77777777777778) internal successors, (259), 9 states have internal predecessors, (259), 4 states have call successors, (191), 2 states have call predecessors, (191), 4 states have return successors, (193), 4 states have call predecessors, (193), 4 states have call successors, (193) [2025-01-09 14:48:23,920 INFO L276 IsEmpty]: Start isEmpty. Operand 11183 states and 17386 transitions. [2025-01-09 14:48:23,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-01-09 14:48:23,925 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:23,926 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:23,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 14:48:24,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:48:24,130 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:24,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:24,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1077083172, now seen corresponding path program 1 times [2025-01-09 14:48:24,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:24,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085836913] [2025-01-09 14:48:24,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:24,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:24,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-01-09 14:48:24,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-01-09 14:48:24,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:24,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:25,843 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:48:25,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:25,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085836913] [2025-01-09 14:48:25,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085836913] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:25,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:25,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:48:25,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973943379] [2025-01-09 14:48:25,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:25,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:48:25,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:25,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:48:25,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:48:25,846 INFO L87 Difference]: Start difference. First operand 11183 states and 17386 transitions. Second operand has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 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:48:27,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:27,649 INFO L93 Difference]: Finished difference Result 30259 states and 47318 transitions. [2025-01-09 14:48:27,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 14:48:27,650 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 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 458 [2025-01-09 14:48:27,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:27,709 INFO L225 Difference]: With dead ends: 30259 [2025-01-09 14:48:27,710 INFO L226 Difference]: Without dead ends: 19213 [2025-01-09 14:48:27,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:48:27,734 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 1111 mSDsluCounter, 2007 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1111 SdHoareTripleChecker+Valid, 2476 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:27,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1111 Valid, 2476 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 14:48:27,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19213 states. [2025-01-09 14:48:28,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19213 to 13507. [2025-01-09 14:48:28,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13507 states, 11032 states have (on average 1.5072516316171138) internal successors, (16628), 11068 states have internal predecessors, (16628), 2275 states have call successors, (2275), 199 states have call predecessors, (2275), 199 states have return successors, (2275), 2239 states have call predecessors, (2275), 2275 states have call successors, (2275) [2025-01-09 14:48:28,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13507 states to 13507 states and 21178 transitions. [2025-01-09 14:48:28,505 INFO L78 Accepts]: Start accepts. Automaton has 13507 states and 21178 transitions. Word has length 458 [2025-01-09 14:48:28,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:28,506 INFO L471 AbstractCegarLoop]: Abstraction has 13507 states and 21178 transitions. [2025-01-09 14:48:28,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 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:48:28,506 INFO L276 IsEmpty]: Start isEmpty. Operand 13507 states and 21178 transitions. [2025-01-09 14:48:28,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-01-09 14:48:28,514 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:28,514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:28,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 14:48:28,514 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:28,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:28,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1483779674, now seen corresponding path program 1 times [2025-01-09 14:48:28,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:28,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981298965] [2025-01-09 14:48:28,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:28,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:28,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-01-09 14:48:30,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-01-09 14:48:30,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:30,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:31,777 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-01-09 14:48:31,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:31,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981298965] [2025-01-09 14:48:31,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981298965] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:48:31,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894799853] [2025-01-09 14:48:31,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:31,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:48:31,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:48:31,779 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:48:31,783 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:48:31,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-01-09 14:48:32,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-01-09 14:48:32,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:32,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:32,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 1142 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 14:48:32,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:48:32,416 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 4482 proven. 102 refuted. 0 times theorem prover too weak. 4260 trivial. 0 not checked. [2025-01-09 14:48:32,416 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:48:32,795 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 96 proven. 102 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-01-09 14:48:32,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894799853] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:48:32,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:48:32,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-01-09 14:48:32,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853697848] [2025-01-09 14:48:32,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:48:32,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 14:48:32,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:32,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 14:48:32,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:48:32,798 INFO L87 Difference]: Start difference. First operand 13507 states and 21178 transitions. Second operand has 15 states, 15 states have (on average 18.933333333333334) internal successors, (284), 15 states have internal predecessors, (284), 4 states have call successors, (167), 2 states have call predecessors, (167), 4 states have return successors, (169), 4 states have call predecessors, (169), 4 states have call successors, (169) [2025-01-09 14:48:36,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:36,988 INFO L93 Difference]: Finished difference Result 61017 states and 94519 transitions. [2025-01-09 14:48:36,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-01-09 14:48:36,989 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 18.933333333333334) internal successors, (284), 15 states have internal predecessors, (284), 4 states have call successors, (167), 2 states have call predecessors, (167), 4 states have return successors, (169), 4 states have call predecessors, (169), 4 states have call successors, (169) Word has length 458 [2025-01-09 14:48:36,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:37,072 INFO L225 Difference]: With dead ends: 61017 [2025-01-09 14:48:37,072 INFO L226 Difference]: Without dead ends: 47847 [2025-01-09 14:48:37,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 963 GetRequests, 916 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=526, Invalid=1826, Unknown=0, NotChecked=0, Total=2352 [2025-01-09 14:48:37,098 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 2777 mSDsluCounter, 2024 mSDsCounter, 0 mSdLazyCounter, 1981 mSolverCounterSat, 521 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2779 SdHoareTripleChecker+Valid, 2403 SdHoareTripleChecker+Invalid, 2502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 521 IncrementalHoareTripleChecker+Valid, 1981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:37,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2779 Valid, 2403 Invalid, 2502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [521 Valid, 1981 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 14:48:37,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47847 states. [2025-01-09 14:48:38,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47847 to 42311. [2025-01-09 14:48:38,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42311 states, 37457 states have (on average 1.5320233868168833) internal successors, (57385), 37637 states have internal predecessors, (57385), 4051 states have call successors, (4051), 802 states have call predecessors, (4051), 802 states have return successors, (4051), 3871 states have call predecessors, (4051), 4051 states have call successors, (4051) [2025-01-09 14:48:38,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42311 states to 42311 states and 65487 transitions. [2025-01-09 14:48:39,004 INFO L78 Accepts]: Start accepts. Automaton has 42311 states and 65487 transitions. Word has length 458 [2025-01-09 14:48:39,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:39,004 INFO L471 AbstractCegarLoop]: Abstraction has 42311 states and 65487 transitions. [2025-01-09 14:48:39,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 18.933333333333334) internal successors, (284), 15 states have internal predecessors, (284), 4 states have call successors, (167), 2 states have call predecessors, (167), 4 states have return successors, (169), 4 states have call predecessors, (169), 4 states have call successors, (169) [2025-01-09 14:48:39,005 INFO L276 IsEmpty]: Start isEmpty. Operand 42311 states and 65487 transitions. [2025-01-09 14:48:39,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-01-09 14:48:39,026 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:39,026 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:39,034 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:48:39,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:48:39,227 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:39,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:39,228 INFO L85 PathProgramCache]: Analyzing trace with hash 305233798, now seen corresponding path program 1 times [2025-01-09 14:48:39,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:39,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380567621] [2025-01-09 14:48:39,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:39,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:39,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-01-09 14:48:39,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-01-09 14:48:39,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:39,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:39,346 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:48:39,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:39,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380567621] [2025-01-09 14:48:39,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380567621] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:39,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:39,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:48:39,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101869222] [2025-01-09 14:48:39,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:39,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:48:39,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:39,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:48:39,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:48:39,350 INFO L87 Difference]: Start difference. First operand 42311 states and 65487 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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:48:41,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:41,148 INFO L93 Difference]: Finished difference Result 71103 states and 109577 transitions. [2025-01-09 14:48:41,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:48:41,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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 459 [2025-01-09 14:48:41,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:41,230 INFO L225 Difference]: With dead ends: 71103 [2025-01-09 14:48:41,230 INFO L226 Difference]: Without dead ends: 33633 [2025-01-09 14:48:41,277 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:48:41,278 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 214 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:41,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 847 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:48:41,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33633 states. [2025-01-09 14:48:42,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33633 to 25783. [2025-01-09 14:48:42,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25783 states, 22705 states have (on average 1.5077295749834838) internal successors, (34233), 22789 states have internal predecessors, (34233), 2611 states have call successors, (2611), 466 states have call predecessors, (2611), 466 states have return successors, (2611), 2527 states have call predecessors, (2611), 2611 states have call successors, (2611) [2025-01-09 14:48:42,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25783 states to 25783 states and 39455 transitions. [2025-01-09 14:48:42,506 INFO L78 Accepts]: Start accepts. Automaton has 25783 states and 39455 transitions. Word has length 459 [2025-01-09 14:48:42,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:42,506 INFO L471 AbstractCegarLoop]: Abstraction has 25783 states and 39455 transitions. [2025-01-09 14:48:42,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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:48:42,507 INFO L276 IsEmpty]: Start isEmpty. Operand 25783 states and 39455 transitions. [2025-01-09 14:48:42,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-01-09 14:48:42,517 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:42,517 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:42,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 14:48:42,518 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:42,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:42,518 INFO L85 PathProgramCache]: Analyzing trace with hash -2144366332, now seen corresponding path program 1 times [2025-01-09 14:48:42,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:42,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509346008] [2025-01-09 14:48:42,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:42,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:42,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-01-09 14:48:43,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-01-09 14:48:43,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:43,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:44,645 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 18 proven. 180 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-01-09 14:48:44,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:44,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509346008] [2025-01-09 14:48:44,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509346008] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:48:44,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123646847] [2025-01-09 14:48:44,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:44,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:48:44,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:48:44,649 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:48:44,651 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:48:44,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-01-09 14:48:44,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-01-09 14:48:44,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:44,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:44,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 1136 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:48:44,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:48:45,216 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 4416 proven. 111 refuted. 0 times theorem prover too weak. 4317 trivial. 0 not checked. [2025-01-09 14:48:45,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:48:45,497 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 87 proven. 111 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-01-09 14:48:45,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123646847] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:48:45,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:48:45,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2025-01-09 14:48:45,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921374879] [2025-01-09 14:48:45,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:48:45,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:48:45,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:45,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:48:45,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:48:45,500 INFO L87 Difference]: Start difference. First operand 25783 states and 39455 transitions. Second operand has 10 states, 10 states have (on average 23.4) internal successors, (234), 10 states have internal predecessors, (234), 3 states have call successors, (164), 2 states have call predecessors, (164), 4 states have return successors, (166), 3 states have call predecessors, (166), 3 states have call successors, (166) [2025-01-09 14:48:47,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:47,204 INFO L93 Difference]: Finished difference Result 49929 states and 76220 transitions. [2025-01-09 14:48:47,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 14:48:47,205 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 23.4) internal successors, (234), 10 states have internal predecessors, (234), 3 states have call successors, (164), 2 states have call predecessors, (164), 4 states have return successors, (166), 3 states have call predecessors, (166), 3 states have call successors, (166) Word has length 459 [2025-01-09 14:48:47,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:47,261 INFO L225 Difference]: With dead ends: 49929 [2025-01-09 14:48:47,261 INFO L226 Difference]: Without dead ends: 24309 [2025-01-09 14:48:47,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 937 GetRequests, 915 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2025-01-09 14:48:47,283 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 890 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:47,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 1214 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:48:47,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24309 states. [2025-01-09 14:48:48,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24309 to 23915. [2025-01-09 14:48:48,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23915 states, 20787 states have (on average 1.487323808149324) internal successors, (30917), 20871 states have internal predecessors, (30917), 2611 states have call successors, (2611), 516 states have call predecessors, (2611), 516 states have return successors, (2611), 2527 states have call predecessors, (2611), 2611 states have call successors, (2611) [2025-01-09 14:48:48,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23915 states to 23915 states and 36139 transitions. [2025-01-09 14:48:48,373 INFO L78 Accepts]: Start accepts. Automaton has 23915 states and 36139 transitions. Word has length 459 [2025-01-09 14:48:48,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:48,374 INFO L471 AbstractCegarLoop]: Abstraction has 23915 states and 36139 transitions. [2025-01-09 14:48:48,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.4) internal successors, (234), 10 states have internal predecessors, (234), 3 states have call successors, (164), 2 states have call predecessors, (164), 4 states have return successors, (166), 3 states have call predecessors, (166), 3 states have call successors, (166) [2025-01-09 14:48:48,374 INFO L276 IsEmpty]: Start isEmpty. Operand 23915 states and 36139 transitions. [2025-01-09 14:48:48,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-01-09 14:48:48,386 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:48,386 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:48,397 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:48:48,586 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,SelfDestructingSolverStorable17 [2025-01-09 14:48:48,587 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:48,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:48,588 INFO L85 PathProgramCache]: Analyzing trace with hash 239558406, now seen corresponding path program 1 times [2025-01-09 14:48:48,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:48,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732130072] [2025-01-09 14:48:48,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:48,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:48,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-01-09 14:48:50,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-01-09 14:48:50,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:50,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:51,047 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 81 proven. 117 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-01-09 14:48:51,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:51,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732130072] [2025-01-09 14:48:51,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732130072] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:48:51,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77574103] [2025-01-09 14:48:51,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:51,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:48:51,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:48:51,052 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:48:51,056 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:48:51,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-01-09 14:48:51,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-01-09 14:48:51,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:51,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:51,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 1135 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:48:51,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:48:51,436 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 456 proven. 3 refuted. 0 times theorem prover too weak. 8385 trivial. 0 not checked. [2025-01-09 14:48:51,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:48:51,664 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 195 proven. 3 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-01-09 14:48:51,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77574103] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:48:51,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:48:51,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 14:48:51,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891106247] [2025-01-09 14:48:51,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:48:51,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:48:51,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:51,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:48:51,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:48:51,666 INFO L87 Difference]: Start difference. First operand 23915 states and 36139 transitions. Second operand has 8 states, 8 states have (on average 24.375) internal successors, (195), 8 states have internal predecessors, (195), 3 states have call successors, (107), 2 states have call predecessors, (107), 4 states have return successors, (109), 3 states have call predecessors, (109), 3 states have call successors, (109) [2025-01-09 14:48:52,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:52,482 INFO L93 Difference]: Finished difference Result 30505 states and 45878 transitions. [2025-01-09 14:48:52,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 14:48:52,484 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 24.375) internal successors, (195), 8 states have internal predecessors, (195), 3 states have call successors, (107), 2 states have call predecessors, (107), 4 states have return successors, (109), 3 states have call predecessors, (109), 3 states have call successors, (109) Word has length 459 [2025-01-09 14:48:52,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:52,527 INFO L225 Difference]: With dead ends: 30505 [2025-01-09 14:48:52,527 INFO L226 Difference]: Without dead ends: 6961 [2025-01-09 14:48:52,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 931 GetRequests, 915 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:48:52,552 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 610 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:52,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 741 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:48:52,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6961 states. [2025-01-09 14:48:52,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6961 to 6831. [2025-01-09 14:48:52,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6831 states, 5717 states have (on average 1.446737799545216) internal successors, (8271), 5729 states have internal predecessors, (8271), 919 states have call successors, (919), 194 states have call predecessors, (919), 194 states have return successors, (919), 907 states have call predecessors, (919), 919 states have call successors, (919) [2025-01-09 14:48:52,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6831 states to 6831 states and 10109 transitions. [2025-01-09 14:48:52,948 INFO L78 Accepts]: Start accepts. Automaton has 6831 states and 10109 transitions. Word has length 459 [2025-01-09 14:48:52,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:52,949 INFO L471 AbstractCegarLoop]: Abstraction has 6831 states and 10109 transitions. [2025-01-09 14:48:52,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.375) internal successors, (195), 8 states have internal predecessors, (195), 3 states have call successors, (107), 2 states have call predecessors, (107), 4 states have return successors, (109), 3 states have call predecessors, (109), 3 states have call successors, (109) [2025-01-09 14:48:52,949 INFO L276 IsEmpty]: Start isEmpty. Operand 6831 states and 10109 transitions. [2025-01-09 14:48:52,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-01-09 14:48:52,953 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:52,953 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:52,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 14:48:53,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:48:53,158 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:53,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:53,159 INFO L85 PathProgramCache]: Analyzing trace with hash -616003668, now seen corresponding path program 1 times [2025-01-09 14:48:53,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:53,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868787523] [2025-01-09 14:48:53,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:53,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:53,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-01-09 14:48:55,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-01-09 14:48:55,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:55,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:56,554 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 42 proven. 156 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-01-09 14:48:56,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:56,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868787523] [2025-01-09 14:48:56,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868787523] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:48:56,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847802661] [2025-01-09 14:48:56,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:56,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:48:56,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:48:56,557 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:48:56,558 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:48:56,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-01-09 14:48:56,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-01-09 14:48:56,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:56,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:56,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 1142 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 14:48:56,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:48:57,002 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 1408 proven. 15 refuted. 0 times theorem prover too weak. 7421 trivial. 0 not checked. [2025-01-09 14:48:57,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:48:57,419 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 183 proven. 15 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-01-09 14:48:57,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847802661] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:48:57,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:48:57,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-01-09 14:48:57,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104799342] [2025-01-09 14:48:57,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:48:57,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 14:48:57,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:57,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 14:48:57,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:48:57,424 INFO L87 Difference]: Start difference. First operand 6831 states and 10109 transitions. Second operand has 15 states, 15 states have (on average 18.6) internal successors, (279), 15 states have internal predecessors, (279), 4 states have call successors, (124), 2 states have call predecessors, (124), 4 states have return successors, (126), 4 states have call predecessors, (126), 4 states have call successors, (126) [2025-01-09 14:48:59,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:59,040 INFO L93 Difference]: Finished difference Result 21069 states and 31582 transitions. [2025-01-09 14:48:59,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 14:48:59,041 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 18.6) internal successors, (279), 15 states have internal predecessors, (279), 4 states have call successors, (124), 2 states have call predecessors, (124), 4 states have return successors, (126), 4 states have call predecessors, (126), 4 states have call successors, (126) Word has length 460 [2025-01-09 14:48:59,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:59,072 INFO L225 Difference]: With dead ends: 21069 [2025-01-09 14:48:59,073 INFO L226 Difference]: Without dead ends: 14493 [2025-01-09 14:48:59,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 948 GetRequests, 917 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=289, Invalid=767, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 14:48:59,085 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 920 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 1482 SdHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:59,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 1482 Invalid, 1270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:48:59,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14493 states. [2025-01-09 14:48:59,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14493 to 11685. [2025-01-09 14:48:59,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11685 states, 10232 states have (on average 1.4532838154808445) internal successors, (14870), 10268 states have internal predecessors, (14870), 1135 states have call successors, (1135), 317 states have call predecessors, (1135), 317 states have return successors, (1135), 1099 states have call predecessors, (1135), 1135 states have call successors, (1135) [2025-01-09 14:48:59,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11685 states to 11685 states and 17140 transitions. [2025-01-09 14:48:59,766 INFO L78 Accepts]: Start accepts. Automaton has 11685 states and 17140 transitions. Word has length 460 [2025-01-09 14:48:59,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:59,766 INFO L471 AbstractCegarLoop]: Abstraction has 11685 states and 17140 transitions. [2025-01-09 14:48:59,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 18.6) internal successors, (279), 15 states have internal predecessors, (279), 4 states have call successors, (124), 2 states have call predecessors, (124), 4 states have return successors, (126), 4 states have call predecessors, (126), 4 states have call successors, (126) [2025-01-09 14:48:59,767 INFO L276 IsEmpty]: Start isEmpty. Operand 11685 states and 17140 transitions. [2025-01-09 14:48:59,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-01-09 14:48:59,772 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:59,773 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:59,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 14:48:59,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:48:59,974 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:59,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:59,974 INFO L85 PathProgramCache]: Analyzing trace with hash -615421652, now seen corresponding path program 1 times [2025-01-09 14:48:59,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:59,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212694394] [2025-01-09 14:48:59,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:59,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:59,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-01-09 14:49:02,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-01-09 14:49:02,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:02,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:02,438 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 63 proven. 135 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-01-09 14:49:02,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:02,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212694394] [2025-01-09 14:49:02,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212694394] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:49:02,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441182833] [2025-01-09 14:49:02,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:02,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:49:02,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:49:02,441 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:49:02,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 14:49:02,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-01-09 14:49:02,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-01-09 14:49:02,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:02,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:02,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 1145 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 14:49:02,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:49:03,913 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 4152 proven. 288 refuted. 0 times theorem prover too weak. 4404 trivial. 0 not checked. [2025-01-09 14:49:03,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:49:04,999 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 102 proven. 291 refuted. 0 times theorem prover too weak. 8451 trivial. 0 not checked. [2025-01-09 14:49:05,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441182833] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:49:05,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:49:05,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 16 [2025-01-09 14:49:05,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520300209] [2025-01-09 14:49:05,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:49:05,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 14:49:05,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:05,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 14:49:05,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-01-09 14:49:05,003 INFO L87 Difference]: Start difference. First operand 11685 states and 17140 transitions. Second operand has 16 states, 16 states have (on average 16.375) internal successors, (262), 16 states have internal predecessors, (262), 6 states have call successors, (171), 3 states have call predecessors, (171), 7 states have return successors, (173), 6 states have call predecessors, (173), 6 states have call successors, (173) [2025-01-09 14:49:06,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:06,100 INFO L93 Difference]: Finished difference Result 18613 states and 27130 transitions. [2025-01-09 14:49:06,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 14:49:06,101 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 16.375) internal successors, (262), 16 states have internal predecessors, (262), 6 states have call successors, (171), 3 states have call predecessors, (171), 7 states have return successors, (173), 6 states have call predecessors, (173), 6 states have call successors, (173) Word has length 460 [2025-01-09 14:49:06,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:06,125 INFO L225 Difference]: With dead ends: 18613 [2025-01-09 14:49:06,126 INFO L226 Difference]: Without dead ends: 7195 [2025-01-09 14:49:06,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 931 GetRequests, 910 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2025-01-09 14:49:06,138 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 904 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:06,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 1306 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:49:06,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7195 states. [2025-01-09 14:49:06,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7195 to 7039. [2025-01-09 14:49:06,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7039 states, 5873 states have (on average 1.413076792099438) internal successors, (8299), 5885 states have internal predecessors, (8299), 919 states have call successors, (919), 246 states have call predecessors, (919), 246 states have return successors, (919), 907 states have call predecessors, (919), 919 states have call successors, (919) [2025-01-09 14:49:06,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7039 states to 7039 states and 10137 transitions. [2025-01-09 14:49:06,655 INFO L78 Accepts]: Start accepts. Automaton has 7039 states and 10137 transitions. Word has length 460 [2025-01-09 14:49:06,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:06,656 INFO L471 AbstractCegarLoop]: Abstraction has 7039 states and 10137 transitions. [2025-01-09 14:49:06,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 16.375) internal successors, (262), 16 states have internal predecessors, (262), 6 states have call successors, (171), 3 states have call predecessors, (171), 7 states have return successors, (173), 6 states have call predecessors, (173), 6 states have call successors, (173) [2025-01-09 14:49:06,656 INFO L276 IsEmpty]: Start isEmpty. Operand 7039 states and 10137 transitions. [2025-01-09 14:49:06,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-01-09 14:49:06,659 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:06,660 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:06,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 14:49:06,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:49:06,864 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:06,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:06,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1595277424, now seen corresponding path program 1 times [2025-01-09 14:49:06,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:06,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331932275] [2025-01-09 14:49:06,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:06,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:06,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-01-09 14:49:07,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-01-09 14:49:07,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:07,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:08,574 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 318 proven. 72 refuted. 0 times theorem prover too weak. 8454 trivial. 0 not checked. [2025-01-09 14:49:08,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:08,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331932275] [2025-01-09 14:49:08,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331932275] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:49:08,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465051324] [2025-01-09 14:49:08,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:08,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:49:08,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:49:08,576 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:49:08,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 14:49:08,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-01-09 14:49:09,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-01-09 14:49:09,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:09,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:09,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 1144 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 14:49:09,051 INFO L279 TraceCheckSpWp]: Computing forward predicates...