./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e8d55036 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 ae696ef581cbe995636ab4900ea04e2b993d78100fba8db2a87ca7d99c3a6d1e --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 19:21:01,858 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 19:21:01,859 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 19:21:01,886 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 19:21:01,886 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 19:21:01,888 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 19:21:01,889 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 19:21:01,892 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 19:21:01,893 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 19:21:01,896 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 19:21:01,897 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 19:21:01,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 19:21:01,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 19:21:01,902 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 19:21:01,903 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 19:21:01,904 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 19:21:01,905 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 19:21:01,906 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 19:21:01,906 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 19:21:01,910 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 19:21:01,911 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 19:21:01,911 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 19:21:01,912 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 19:21:01,913 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 19:21:01,919 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 19:21:01,919 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 19:21:01,919 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 19:21:01,920 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 19:21:01,920 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 19:21:01,921 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 19:21:01,921 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 19:21:01,922 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 19:21:01,923 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 19:21:01,924 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 19:21:01,925 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 19:21:01,925 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 19:21:01,925 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 19:21:01,926 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 19:21:01,926 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 19:21:01,926 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 19:21:01,927 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 19:21:01,928 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 19:21:01,954 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 19:21:01,955 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 19:21:01,955 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 19:21:01,955 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 19:21:01,956 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 19:21:01,956 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 19:21:01,957 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 19:21:01,957 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 19:21:01,957 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 19:21:01,957 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 19:21:01,958 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 19:21:01,958 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 19:21:01,958 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 19:21:01,958 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 19:21:01,958 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 19:21:01,958 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 19:21:01,958 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 19:21:01,959 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 19:21:01,959 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 19:21:01,959 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 19:21:01,959 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 19:21:01,959 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 19:21:01,959 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 19:21:01,959 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 19:21:01,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:21:01,960 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 19:21:01,960 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 19:21:01,960 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 19:21:01,960 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 19:21:01,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 19:21:01,961 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 19:21:01,961 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 19:21:01,961 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 19:21:01,961 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 19:21:01,961 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 19:21:01,961 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> ae696ef581cbe995636ab4900ea04e2b993d78100fba8db2a87ca7d99c3a6d1e [2023-02-15 19:21:02,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 19:21:02,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 19:21:02,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 19:21:02,166 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 19:21:02,166 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 19:21:02,167 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c [2023-02-15 19:21:03,097 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 19:21:03,262 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 19:21:03,262 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c [2023-02-15 19:21:03,268 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/807ae7213/800cda4f5589405aa25ec33ff018077b/FLAGa1034c57f [2023-02-15 19:21:03,277 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/807ae7213/800cda4f5589405aa25ec33ff018077b [2023-02-15 19:21:03,279 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 19:21:03,279 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 19:21:03,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 19:21:03,280 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 19:21:03,282 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 19:21:03,283 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:21:03" (1/1) ... [2023-02-15 19:21:03,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58013c0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:21:03, skipping insertion in model container [2023-02-15 19:21:03,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:21:03" (1/1) ... [2023-02-15 19:21:03,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 19:21:03,317 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 19:21:03,433 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c[37883,37896] [2023-02-15 19:21:03,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:21:03,444 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 19:21:03,471 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c[37883,37896] [2023-02-15 19:21:03,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:21:03,481 INFO L208 MainTranslator]: Completed translation [2023-02-15 19:21:03,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:21:03 WrapperNode [2023-02-15 19:21:03,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 19:21:03,482 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 19:21:03,482 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 19:21:03,482 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 19:21:03,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:21:03" (1/1) ... [2023-02-15 19:21:03,493 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:21:03" (1/1) ... [2023-02-15 19:21:03,513 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 497 [2023-02-15 19:21:03,514 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 19:21:03,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 19:21:03,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 19:21:03,515 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 19:21:03,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:21:03" (1/1) ... [2023-02-15 19:21:03,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:21:03" (1/1) ... [2023-02-15 19:21:03,523 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:21:03" (1/1) ... [2023-02-15 19:21:03,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:21:03" (1/1) ... [2023-02-15 19:21:03,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:21:03" (1/1) ... [2023-02-15 19:21:03,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:21:03" (1/1) ... [2023-02-15 19:21:03,538 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:21:03" (1/1) ... [2023-02-15 19:21:03,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:21:03" (1/1) ... [2023-02-15 19:21:03,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 19:21:03,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 19:21:03,547 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 19:21:03,547 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 19:21:03,549 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:21:03" (1/1) ... [2023-02-15 19:21:03,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:21:03,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:21:03,568 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 19:21:03,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 19:21:03,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 19:21:03,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 19:21:03,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 19:21:03,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 19:21:03,666 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 19:21:03,668 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 19:21:03,678 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-02-15 19:21:04,085 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2023-02-15 19:21:04,086 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2023-02-15 19:21:04,086 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 19:21:04,090 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 19:21:04,091 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-15 19:21:04,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:21:04 BoogieIcfgContainer [2023-02-15 19:21:04,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 19:21:04,094 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 19:21:04,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 19:21:04,096 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 19:21:04,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 07:21:03" (1/3) ... [2023-02-15 19:21:04,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c633 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:21:04, skipping insertion in model container [2023-02-15 19:21:04,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:21:03" (2/3) ... [2023-02-15 19:21:04,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c633 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:21:04, skipping insertion in model container [2023-02-15 19:21:04,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:21:04" (3/3) ... [2023-02-15 19:21:04,098 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil-1a.c [2023-02-15 19:21:04,110 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 19:21:04,110 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 19:21:04,141 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 19:21:04,146 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@5fd8c700, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 19:21:04,146 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 19:21:04,149 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 130 states have (on average 1.7307692307692308) internal successors, (225), 131 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:04,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 19:21:04,154 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:04,155 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:21:04,155 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:04,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:04,158 INFO L85 PathProgramCache]: Analyzing trace with hash 260022937, now seen corresponding path program 1 times [2023-02-15 19:21:04,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:04,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497554461] [2023-02-15 19:21:04,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:04,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:04,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:21:04,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:04,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497554461] [2023-02-15 19:21:04,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497554461] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:04,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:21:04,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:21:04,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867549835] [2023-02-15 19:21:04,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:04,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:04,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:04,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:04,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:04,416 INFO L87 Difference]: Start difference. First operand has 132 states, 130 states have (on average 1.7307692307692308) internal successors, (225), 131 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:04,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:04,556 INFO L93 Difference]: Finished difference Result 259 states and 443 transitions. [2023-02-15 19:21:04,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:04,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-02-15 19:21:04,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:04,564 INFO L225 Difference]: With dead ends: 259 [2023-02-15 19:21:04,564 INFO L226 Difference]: Without dead ends: 119 [2023-02-15 19:21:04,567 INFO L412 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 [2023-02-15 19:21:04,570 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 8 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:04,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 332 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:21:04,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-15 19:21:04,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-02-15 19:21:04,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.5338983050847457) internal successors, (181), 118 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:04,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 181 transitions. [2023-02-15 19:21:04,595 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 181 transitions. Word has length 25 [2023-02-15 19:21:04,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:04,595 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 181 transitions. [2023-02-15 19:21:04,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:04,595 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 181 transitions. [2023-02-15 19:21:04,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 19:21:04,596 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:04,596 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:21:04,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 19:21:04,596 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:04,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:04,597 INFO L85 PathProgramCache]: Analyzing trace with hash 693672153, now seen corresponding path program 1 times [2023-02-15 19:21:04,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:04,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117830941] [2023-02-15 19:21:04,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:04,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:04,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:04,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:21:04,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:04,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117830941] [2023-02-15 19:21:04,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117830941] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:04,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:21:04,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:21:04,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011459602] [2023-02-15 19:21:04,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:04,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:04,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:04,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:04,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:04,652 INFO L87 Difference]: Start difference. First operand 119 states and 181 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:04,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:04,753 INFO L93 Difference]: Finished difference Result 245 states and 376 transitions. [2023-02-15 19:21:04,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:04,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-02-15 19:21:04,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:04,758 INFO L225 Difference]: With dead ends: 245 [2023-02-15 19:21:04,758 INFO L226 Difference]: Without dead ends: 137 [2023-02-15 19:21:04,760 INFO L412 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 [2023-02-15 19:21:04,761 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 13 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:04,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 253 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:21:04,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-02-15 19:21:04,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2023-02-15 19:21:04,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.5112781954887218) internal successors, (201), 133 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:04,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 201 transitions. [2023-02-15 19:21:04,772 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 201 transitions. Word has length 37 [2023-02-15 19:21:04,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:04,773 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 201 transitions. [2023-02-15 19:21:04,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:04,774 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 201 transitions. [2023-02-15 19:21:04,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 19:21:04,776 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:04,776 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:21:04,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 19:21:04,776 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:04,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:04,779 INFO L85 PathProgramCache]: Analyzing trace with hash -2014075552, now seen corresponding path program 1 times [2023-02-15 19:21:04,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:04,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973570757] [2023-02-15 19:21:04,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:04,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:04,864 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:21:04,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:04,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973570757] [2023-02-15 19:21:04,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973570757] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:04,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:21:04,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:21:04,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961899927] [2023-02-15 19:21:04,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:04,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:04,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:04,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:04,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:04,866 INFO L87 Difference]: Start difference. First operand 134 states and 201 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:04,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:04,878 INFO L93 Difference]: Finished difference Result 283 states and 420 transitions. [2023-02-15 19:21:04,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:04,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2023-02-15 19:21:04,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:04,880 INFO L225 Difference]: With dead ends: 283 [2023-02-15 19:21:04,880 INFO L226 Difference]: Without dead ends: 160 [2023-02-15 19:21:04,880 INFO L412 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 [2023-02-15 19:21:04,881 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 21 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:04,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 331 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:21:04,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-02-15 19:21:04,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2023-02-15 19:21:04,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 1.471698113207547) internal successors, (234), 159 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:04,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 234 transitions. [2023-02-15 19:21:04,890 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 234 transitions. Word has length 51 [2023-02-15 19:21:04,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:04,891 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 234 transitions. [2023-02-15 19:21:04,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:04,891 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 234 transitions. [2023-02-15 19:21:04,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 19:21:04,892 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:04,892 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:21:04,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 19:21:04,892 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:04,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:04,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1880062046, now seen corresponding path program 1 times [2023-02-15 19:21:04,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:04,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434084206] [2023-02-15 19:21:04,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:04,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:04,951 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:21:04,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:04,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434084206] [2023-02-15 19:21:04,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434084206] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:04,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:21:04,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:21:04,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117231872] [2023-02-15 19:21:04,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:04,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:04,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:04,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:04,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:04,954 INFO L87 Difference]: Start difference. First operand 160 states and 234 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:05,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:05,043 INFO L93 Difference]: Finished difference Result 304 states and 455 transitions. [2023-02-15 19:21:05,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:05,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2023-02-15 19:21:05,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:05,045 INFO L225 Difference]: With dead ends: 304 [2023-02-15 19:21:05,045 INFO L226 Difference]: Without dead ends: 181 [2023-02-15 19:21:05,047 INFO L412 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 [2023-02-15 19:21:05,051 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 16 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:05,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 266 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:21:05,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-02-15 19:21:05,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2023-02-15 19:21:05,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 1.4545454545454546) internal successors, (256), 176 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:05,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 256 transitions. [2023-02-15 19:21:05,069 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 256 transitions. Word has length 51 [2023-02-15 19:21:05,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:05,071 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 256 transitions. [2023-02-15 19:21:05,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:05,071 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 256 transitions. [2023-02-15 19:21:05,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-15 19:21:05,075 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:05,076 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:21:05,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 19:21:05,076 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:05,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:05,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1552359252, now seen corresponding path program 1 times [2023-02-15 19:21:05,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:05,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641907632] [2023-02-15 19:21:05,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:05,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:05,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:05,153 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-15 19:21:05,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:05,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641907632] [2023-02-15 19:21:05,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641907632] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:05,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:21:05,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:21:05,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514680107] [2023-02-15 19:21:05,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:05,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:05,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:05,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:05,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:05,155 INFO L87 Difference]: Start difference. First operand 177 states and 256 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:05,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:05,177 INFO L93 Difference]: Finished difference Result 454 states and 668 transitions. [2023-02-15 19:21:05,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:05,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2023-02-15 19:21:05,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:05,179 INFO L225 Difference]: With dead ends: 454 [2023-02-15 19:21:05,179 INFO L226 Difference]: Without dead ends: 314 [2023-02-15 19:21:05,180 INFO L412 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 [2023-02-15 19:21:05,180 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 132 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:05,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 379 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:21:05,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2023-02-15 19:21:05,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2023-02-15 19:21:05,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 313 states have (on average 1.4536741214057507) internal successors, (455), 313 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:05,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 455 transitions. [2023-02-15 19:21:05,197 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 455 transitions. Word has length 70 [2023-02-15 19:21:05,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:05,198 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 455 transitions. [2023-02-15 19:21:05,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:05,199 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 455 transitions. [2023-02-15 19:21:05,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-15 19:21:05,201 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:05,201 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:21:05,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 19:21:05,204 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:05,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:05,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1693805076, now seen corresponding path program 1 times [2023-02-15 19:21:05,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:05,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012792786] [2023-02-15 19:21:05,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:05,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:05,264 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:21:05,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:05,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012792786] [2023-02-15 19:21:05,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012792786] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:05,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:21:05,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:21:05,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857066253] [2023-02-15 19:21:05,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:05,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:05,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:05,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:05,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:05,265 INFO L87 Difference]: Start difference. First operand 314 states and 455 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:05,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:05,281 INFO L93 Difference]: Finished difference Result 612 states and 889 transitions. [2023-02-15 19:21:05,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:05,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2023-02-15 19:21:05,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:05,283 INFO L225 Difference]: With dead ends: 612 [2023-02-15 19:21:05,283 INFO L226 Difference]: Without dead ends: 335 [2023-02-15 19:21:05,283 INFO L412 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 [2023-02-15 19:21:05,285 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 11 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:05,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 361 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:21:05,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2023-02-15 19:21:05,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2023-02-15 19:21:05,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.4431137724550898) internal successors, (482), 334 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:05,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 482 transitions. [2023-02-15 19:21:05,292 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 482 transitions. Word has length 71 [2023-02-15 19:21:05,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:05,293 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 482 transitions. [2023-02-15 19:21:05,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:05,293 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 482 transitions. [2023-02-15 19:21:05,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-02-15 19:21:05,297 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:05,298 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:21:05,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 19:21:05,298 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:05,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:05,299 INFO L85 PathProgramCache]: Analyzing trace with hash -294414028, now seen corresponding path program 1 times [2023-02-15 19:21:05,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:05,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944268787] [2023-02-15 19:21:05,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:05,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:05,362 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-02-15 19:21:05,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:05,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944268787] [2023-02-15 19:21:05,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944268787] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:05,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:21:05,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:21:05,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421452377] [2023-02-15 19:21:05,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:05,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:05,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:05,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:05,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:05,363 INFO L87 Difference]: Start difference. First operand 335 states and 482 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:05,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:05,443 INFO L93 Difference]: Finished difference Result 681 states and 998 transitions. [2023-02-15 19:21:05,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:05,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2023-02-15 19:21:05,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:05,445 INFO L225 Difference]: With dead ends: 681 [2023-02-15 19:21:05,445 INFO L226 Difference]: Without dead ends: 383 [2023-02-15 19:21:05,446 INFO L412 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 [2023-02-15 19:21:05,446 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 12 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:05,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 271 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:21:05,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2023-02-15 19:21:05,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 377. [2023-02-15 19:21:05,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 1.4202127659574468) internal successors, (534), 376 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:05,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 534 transitions. [2023-02-15 19:21:05,455 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 534 transitions. Word has length 88 [2023-02-15 19:21:05,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:05,456 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 534 transitions. [2023-02-15 19:21:05,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:05,456 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 534 transitions. [2023-02-15 19:21:05,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-02-15 19:21:05,460 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:05,460 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:21:05,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 19:21:05,460 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:05,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:05,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1264349868, now seen corresponding path program 1 times [2023-02-15 19:21:05,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:05,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60193364] [2023-02-15 19:21:05,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:05,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:05,507 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-02-15 19:21:05,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:05,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60193364] [2023-02-15 19:21:05,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60193364] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:05,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:21:05,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:21:05,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057169023] [2023-02-15 19:21:05,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:05,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:05,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:05,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:05,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:05,509 INFO L87 Difference]: Start difference. First operand 377 states and 534 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:05,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:05,529 INFO L93 Difference]: Finished difference Result 538 states and 767 transitions. [2023-02-15 19:21:05,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:05,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2023-02-15 19:21:05,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:05,531 INFO L225 Difference]: With dead ends: 538 [2023-02-15 19:21:05,531 INFO L226 Difference]: Without dead ends: 536 [2023-02-15 19:21:05,531 INFO L412 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 [2023-02-15 19:21:05,532 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 148 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:05,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 321 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:21:05,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2023-02-15 19:21:05,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2023-02-15 19:21:05,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 535 states have (on average 1.4299065420560748) internal successors, (765), 535 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:05,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 765 transitions. [2023-02-15 19:21:05,541 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 765 transitions. Word has length 108 [2023-02-15 19:21:05,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:05,541 INFO L495 AbstractCegarLoop]: Abstraction has 536 states and 765 transitions. [2023-02-15 19:21:05,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:05,542 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 765 transitions. [2023-02-15 19:21:05,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-02-15 19:21:05,543 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:05,543 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:21:05,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 19:21:05,544 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:05,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:05,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1514969078, now seen corresponding path program 1 times [2023-02-15 19:21:05,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:05,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141262290] [2023-02-15 19:21:05,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:05,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:05,605 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-02-15 19:21:05,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:05,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141262290] [2023-02-15 19:21:05,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141262290] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:05,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:21:05,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:21:05,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163199621] [2023-02-15 19:21:05,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:05,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:05,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:05,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:05,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:05,607 INFO L87 Difference]: Start difference. First operand 536 states and 765 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:05,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:05,731 INFO L93 Difference]: Finished difference Result 1185 states and 1745 transitions. [2023-02-15 19:21:05,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:05,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2023-02-15 19:21:05,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:05,733 INFO L225 Difference]: With dead ends: 1185 [2023-02-15 19:21:05,733 INFO L226 Difference]: Without dead ends: 683 [2023-02-15 19:21:05,733 INFO L412 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 [2023-02-15 19:21:05,734 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 75 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:05,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 246 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:21:05,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2023-02-15 19:21:05,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 659. [2023-02-15 19:21:05,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 658 states have (on average 1.4635258358662615) internal successors, (963), 658 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:05,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 963 transitions. [2023-02-15 19:21:05,744 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 963 transitions. Word has length 128 [2023-02-15 19:21:05,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:05,744 INFO L495 AbstractCegarLoop]: Abstraction has 659 states and 963 transitions. [2023-02-15 19:21:05,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:05,744 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 963 transitions. [2023-02-15 19:21:05,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-02-15 19:21:05,745 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:05,745 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 7, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:21:05,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 19:21:05,745 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:05,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:05,746 INFO L85 PathProgramCache]: Analyzing trace with hash -219869315, now seen corresponding path program 1 times [2023-02-15 19:21:05,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:05,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069389923] [2023-02-15 19:21:05,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:05,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:05,785 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-02-15 19:21:05,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:05,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069389923] [2023-02-15 19:21:05,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069389923] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:05,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:21:05,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:21:05,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507970173] [2023-02-15 19:21:05,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:05,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:05,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:05,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:05,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:05,786 INFO L87 Difference]: Start difference. First operand 659 states and 963 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:05,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:05,901 INFO L93 Difference]: Finished difference Result 1559 states and 2344 transitions. [2023-02-15 19:21:05,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:05,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2023-02-15 19:21:05,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:05,904 INFO L225 Difference]: With dead ends: 1559 [2023-02-15 19:21:05,904 INFO L226 Difference]: Without dead ends: 886 [2023-02-15 19:21:05,905 INFO L412 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 [2023-02-15 19:21:05,905 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 81 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:05,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 225 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:21:05,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2023-02-15 19:21:05,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 848. [2023-02-15 19:21:05,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 847 states have (on average 1.4344746162927982) internal successors, (1215), 847 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:05,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1215 transitions. [2023-02-15 19:21:05,919 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1215 transitions. Word has length 154 [2023-02-15 19:21:05,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:05,919 INFO L495 AbstractCegarLoop]: Abstraction has 848 states and 1215 transitions. [2023-02-15 19:21:05,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:05,920 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1215 transitions. [2023-02-15 19:21:05,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-02-15 19:21:05,921 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:05,921 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 8, 8, 8, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:21:05,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 19:21:05,921 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:05,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:05,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1855970287, now seen corresponding path program 1 times [2023-02-15 19:21:05,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:05,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231347116] [2023-02-15 19:21:05,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:05,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:05,963 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2023-02-15 19:21:05,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:05,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231347116] [2023-02-15 19:21:05,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231347116] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:05,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:21:05,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:21:05,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467972776] [2023-02-15 19:21:05,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:05,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:05,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:05,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:05,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:05,964 INFO L87 Difference]: Start difference. First operand 848 states and 1215 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:06,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:06,085 INFO L93 Difference]: Finished difference Result 1815 states and 2621 transitions. [2023-02-15 19:21:06,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:06,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 175 [2023-02-15 19:21:06,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:06,088 INFO L225 Difference]: With dead ends: 1815 [2023-02-15 19:21:06,088 INFO L226 Difference]: Without dead ends: 959 [2023-02-15 19:21:06,089 INFO L412 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 [2023-02-15 19:21:06,089 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 84 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:06,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 221 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:21:06,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2023-02-15 19:21:06,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 923. [2023-02-15 19:21:06,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 922 states have (on average 1.4219088937093276) internal successors, (1311), 922 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:06,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1311 transitions. [2023-02-15 19:21:06,105 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1311 transitions. Word has length 175 [2023-02-15 19:21:06,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:06,105 INFO L495 AbstractCegarLoop]: Abstraction has 923 states and 1311 transitions. [2023-02-15 19:21:06,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:06,106 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1311 transitions. [2023-02-15 19:21:06,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-02-15 19:21:06,107 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:06,107 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:21:06,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 19:21:06,107 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:06,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:06,108 INFO L85 PathProgramCache]: Analyzing trace with hash -150572132, now seen corresponding path program 1 times [2023-02-15 19:21:06,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:06,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104233253] [2023-02-15 19:21:06,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:06,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:06,154 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2023-02-15 19:21:06,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:06,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104233253] [2023-02-15 19:21:06,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104233253] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:06,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:21:06,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:21:06,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115452556] [2023-02-15 19:21:06,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:06,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:06,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:06,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:06,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:06,156 INFO L87 Difference]: Start difference. First operand 923 states and 1311 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:06,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:06,271 INFO L93 Difference]: Finished difference Result 1965 states and 2810 transitions. [2023-02-15 19:21:06,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:06,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2023-02-15 19:21:06,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:06,274 INFO L225 Difference]: With dead ends: 1965 [2023-02-15 19:21:06,274 INFO L226 Difference]: Without dead ends: 1040 [2023-02-15 19:21:06,275 INFO L412 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 [2023-02-15 19:21:06,275 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 85 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:06,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 219 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:21:06,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2023-02-15 19:21:06,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1007. [2023-02-15 19:21:06,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 1006 states have (on average 1.4135188866799204) internal successors, (1422), 1006 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:06,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1422 transitions. [2023-02-15 19:21:06,292 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1422 transitions. Word has length 199 [2023-02-15 19:21:06,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:06,292 INFO L495 AbstractCegarLoop]: Abstraction has 1007 states and 1422 transitions. [2023-02-15 19:21:06,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:06,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1422 transitions. [2023-02-15 19:21:06,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-02-15 19:21:06,294 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:06,294 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:21:06,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 19:21:06,294 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:06,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:06,295 INFO L85 PathProgramCache]: Analyzing trace with hash -643198306, now seen corresponding path program 1 times [2023-02-15 19:21:06,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:06,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923170536] [2023-02-15 19:21:06,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:06,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:06,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:06,355 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2023-02-15 19:21:06,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:06,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923170536] [2023-02-15 19:21:06,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923170536] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:06,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:21:06,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:21:06,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473132463] [2023-02-15 19:21:06,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:06,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:06,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:06,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:06,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:06,358 INFO L87 Difference]: Start difference. First operand 1007 states and 1422 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:06,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:06,459 INFO L93 Difference]: Finished difference Result 2133 states and 3035 transitions. [2023-02-15 19:21:06,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:06,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2023-02-15 19:21:06,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:06,462 INFO L225 Difference]: With dead ends: 2133 [2023-02-15 19:21:06,462 INFO L226 Difference]: Without dead ends: 1136 [2023-02-15 19:21:06,465 INFO L412 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 [2023-02-15 19:21:06,465 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 87 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:06,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 217 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:21:06,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2023-02-15 19:21:06,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1100. [2023-02-15 19:21:06,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 1099 states have (on average 1.414012738853503) internal successors, (1554), 1099 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:06,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1554 transitions. [2023-02-15 19:21:06,486 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1554 transitions. Word has length 199 [2023-02-15 19:21:06,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:06,486 INFO L495 AbstractCegarLoop]: Abstraction has 1100 states and 1554 transitions. [2023-02-15 19:21:06,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:06,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1554 transitions. [2023-02-15 19:21:06,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-02-15 19:21:06,488 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:06,488 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:21:06,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 19:21:06,489 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:06,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:06,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1155189252, now seen corresponding path program 1 times [2023-02-15 19:21:06,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:06,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879432959] [2023-02-15 19:21:06,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:06,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:06,550 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2023-02-15 19:21:06,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:06,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879432959] [2023-02-15 19:21:06,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879432959] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:06,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:21:06,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:21:06,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358306151] [2023-02-15 19:21:06,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:06,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:06,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:06,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:06,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:06,553 INFO L87 Difference]: Start difference. First operand 1100 states and 1554 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:06,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:06,602 INFO L93 Difference]: Finished difference Result 3223 states and 4561 transitions. [2023-02-15 19:21:06,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:06,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 229 [2023-02-15 19:21:06,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:06,608 INFO L225 Difference]: With dead ends: 3223 [2023-02-15 19:21:06,609 INFO L226 Difference]: Without dead ends: 2160 [2023-02-15 19:21:06,610 INFO L412 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 [2023-02-15 19:21:06,611 INFO L413 NwaCegarLoop]: 335 mSDtfsCounter, 134 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:06,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 508 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:21:06,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2160 states. [2023-02-15 19:21:06,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2160 to 2158. [2023-02-15 19:21:06,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2158 states, 2157 states have (on average 1.4149281409364858) internal successors, (3052), 2157 states have internal predecessors, (3052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:06,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2158 states to 2158 states and 3052 transitions. [2023-02-15 19:21:06,657 INFO L78 Accepts]: Start accepts. Automaton has 2158 states and 3052 transitions. Word has length 229 [2023-02-15 19:21:06,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:06,658 INFO L495 AbstractCegarLoop]: Abstraction has 2158 states and 3052 transitions. [2023-02-15 19:21:06,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:06,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2158 states and 3052 transitions. [2023-02-15 19:21:06,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-02-15 19:21:06,660 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:06,661 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:21:06,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 19:21:06,661 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:06,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:06,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1647815426, now seen corresponding path program 1 times [2023-02-15 19:21:06,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:06,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539443260] [2023-02-15 19:21:06,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:06,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:06,713 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2023-02-15 19:21:06,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:06,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539443260] [2023-02-15 19:21:06,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539443260] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:06,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:21:06,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:21:06,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275506751] [2023-02-15 19:21:06,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:06,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:06,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:06,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:06,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:06,715 INFO L87 Difference]: Start difference. First operand 2158 states and 3052 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:06,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:06,847 INFO L93 Difference]: Finished difference Result 4585 states and 6523 transitions. [2023-02-15 19:21:06,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:06,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 229 [2023-02-15 19:21:06,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:06,854 INFO L225 Difference]: With dead ends: 4585 [2023-02-15 19:21:06,854 INFO L226 Difference]: Without dead ends: 2434 [2023-02-15 19:21:06,857 INFO L412 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 [2023-02-15 19:21:06,857 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 90 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:06,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 211 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:21:06,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2023-02-15 19:21:06,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2368. [2023-02-15 19:21:06,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2368 states, 2367 states have (on average 1.42120828052387) internal successors, (3364), 2367 states have internal predecessors, (3364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:06,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 3364 transitions. [2023-02-15 19:21:06,925 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 3364 transitions. Word has length 229 [2023-02-15 19:21:06,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:06,926 INFO L495 AbstractCegarLoop]: Abstraction has 2368 states and 3364 transitions. [2023-02-15 19:21:06,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:06,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 3364 transitions. [2023-02-15 19:21:06,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2023-02-15 19:21:06,929 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:06,929 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:21:06,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 19:21:06,929 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:06,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:06,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1130835859, now seen corresponding path program 1 times [2023-02-15 19:21:06,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:06,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503963597] [2023-02-15 19:21:06,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:06,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:06,988 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2023-02-15 19:21:06,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:06,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503963597] [2023-02-15 19:21:06,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503963597] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:06,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:21:06,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:21:06,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808186060] [2023-02-15 19:21:06,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:06,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:06,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:06,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:06,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:06,991 INFO L87 Difference]: Start difference. First operand 2368 states and 3364 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:07,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:07,114 INFO L93 Difference]: Finished difference Result 4765 states and 6757 transitions. [2023-02-15 19:21:07,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:07,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 264 [2023-02-15 19:21:07,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:07,120 INFO L225 Difference]: With dead ends: 4765 [2023-02-15 19:21:07,120 INFO L226 Difference]: Without dead ends: 2416 [2023-02-15 19:21:07,122 INFO L412 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 [2023-02-15 19:21:07,124 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 93 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:07,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 206 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:21:07,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2023-02-15 19:21:07,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 2350. [2023-02-15 19:21:07,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2350 states, 2349 states have (on average 1.4091102596849723) internal successors, (3310), 2349 states have internal predecessors, (3310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:07,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 3310 transitions. [2023-02-15 19:21:07,190 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 3310 transitions. Word has length 264 [2023-02-15 19:21:07,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:07,190 INFO L495 AbstractCegarLoop]: Abstraction has 2350 states and 3310 transitions. [2023-02-15 19:21:07,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:07,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 3310 transitions. [2023-02-15 19:21:07,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2023-02-15 19:21:07,194 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:07,194 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:21:07,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 19:21:07,194 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:07,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:07,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1187214557, now seen corresponding path program 1 times [2023-02-15 19:21:07,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:07,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832228818] [2023-02-15 19:21:07,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:07,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:07,282 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2023-02-15 19:21:07,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:07,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832228818] [2023-02-15 19:21:07,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832228818] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:07,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:21:07,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:21:07,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456649574] [2023-02-15 19:21:07,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:07,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:07,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:07,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:07,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:07,284 INFO L87 Difference]: Start difference. First operand 2350 states and 3310 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:07,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:07,354 INFO L93 Difference]: Finished difference Result 6951 states and 9784 transitions. [2023-02-15 19:21:07,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:07,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 274 [2023-02-15 19:21:07,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:07,366 INFO L225 Difference]: With dead ends: 6951 [2023-02-15 19:21:07,366 INFO L226 Difference]: Without dead ends: 4638 [2023-02-15 19:21:07,370 INFO L412 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 [2023-02-15 19:21:07,370 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 72 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:07,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 340 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:21:07,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4638 states. [2023-02-15 19:21:07,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4638 to 4636. [2023-02-15 19:21:07,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4636 states, 4635 states have (on average 1.4032362459546925) internal successors, (6504), 4635 states have internal predecessors, (6504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:07,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4636 states to 4636 states and 6504 transitions. [2023-02-15 19:21:07,481 INFO L78 Accepts]: Start accepts. Automaton has 4636 states and 6504 transitions. Word has length 274 [2023-02-15 19:21:07,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:07,481 INFO L495 AbstractCegarLoop]: Abstraction has 4636 states and 6504 transitions. [2023-02-15 19:21:07,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:07,481 INFO L276 IsEmpty]: Start isEmpty. Operand 4636 states and 6504 transitions. [2023-02-15 19:21:07,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2023-02-15 19:21:07,488 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:07,488 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:21:07,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-15 19:21:07,488 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:07,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:07,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1412043949, now seen corresponding path program 1 times [2023-02-15 19:21:07,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:07,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917274669] [2023-02-15 19:21:07,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:07,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:07,590 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 315 proven. 25 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2023-02-15 19:21:07,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:07,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917274669] [2023-02-15 19:21:07,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917274669] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:21:07,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929621499] [2023-02-15 19:21:07,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:07,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:21:07,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:21:07,593 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:21:07,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 19:21:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:07,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 19:21:07,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:21:07,803 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2023-02-15 19:21:07,816 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 19:21:07,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929621499] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:07,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 19:21:07,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-02-15 19:21:07,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927510986] [2023-02-15 19:21:07,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:07,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:07,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:07,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:07,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:21:07,819 INFO L87 Difference]: Start difference. First operand 4636 states and 6504 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:08,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:08,006 INFO L93 Difference]: Finished difference Result 9314 states and 13055 transitions. [2023-02-15 19:21:08,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:08,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 274 [2023-02-15 19:21:08,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:08,020 INFO L225 Difference]: With dead ends: 9314 [2023-02-15 19:21:08,020 INFO L226 Difference]: Without dead ends: 4744 [2023-02-15 19:21:08,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:21:08,026 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 48 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:08,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 265 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:21:08,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4744 states. [2023-02-15 19:21:08,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4744 to 4636. [2023-02-15 19:21:08,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4636 states, 4635 states have (on average 1.3799352750809062) internal successors, (6396), 4635 states have internal predecessors, (6396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:08,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4636 states to 4636 states and 6396 transitions. [2023-02-15 19:21:08,158 INFO L78 Accepts]: Start accepts. Automaton has 4636 states and 6396 transitions. Word has length 274 [2023-02-15 19:21:08,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:08,159 INFO L495 AbstractCegarLoop]: Abstraction has 4636 states and 6396 transitions. [2023-02-15 19:21:08,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:08,159 INFO L276 IsEmpty]: Start isEmpty. Operand 4636 states and 6396 transitions. [2023-02-15 19:21:08,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2023-02-15 19:21:08,165 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:08,165 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:21:08,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 19:21:08,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-15 19:21:08,370 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:08,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:08,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1677895817, now seen corresponding path program 1 times [2023-02-15 19:21:08,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:08,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921286818] [2023-02-15 19:21:08,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:08,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:08,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:08,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 382 proven. 25 refuted. 0 times theorem prover too weak. 645 trivial. 0 not checked. [2023-02-15 19:21:08,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:08,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921286818] [2023-02-15 19:21:08,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921286818] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:21:08,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213530590] [2023-02-15 19:21:08,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:08,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:21:08,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:21:08,465 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:21:08,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 19:21:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:08,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 19:21:08,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:21:08,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2023-02-15 19:21:08,604 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 19:21:08,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213530590] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:08,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 19:21:08,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-02-15 19:21:08,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727088600] [2023-02-15 19:21:08,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:08,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:08,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:08,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:08,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:21:08,605 INFO L87 Difference]: Start difference. First operand 4636 states and 6396 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:08,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:08,775 INFO L93 Difference]: Finished difference Result 9800 states and 13409 transitions. [2023-02-15 19:21:08,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:08,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 301 [2023-02-15 19:21:08,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:08,796 INFO L225 Difference]: With dead ends: 9800 [2023-02-15 19:21:08,796 INFO L226 Difference]: Without dead ends: 5230 [2023-02-15 19:21:08,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:21:08,800 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 106 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:08,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 201 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:21:08,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5230 states. [2023-02-15 19:21:08,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5230 to 4810. [2023-02-15 19:21:08,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4810 states, 4809 states have (on average 1.3786650031191516) internal successors, (6630), 4809 states have internal predecessors, (6630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:08,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 6630 transitions. [2023-02-15 19:21:08,901 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 6630 transitions. Word has length 301 [2023-02-15 19:21:08,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:08,902 INFO L495 AbstractCegarLoop]: Abstraction has 4810 states and 6630 transitions. [2023-02-15 19:21:08,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:08,903 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 6630 transitions. [2023-02-15 19:21:08,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2023-02-15 19:21:08,908 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:08,909 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:21:08,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 19:21:09,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:21:09,117 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:09,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:09,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1606168447, now seen corresponding path program 1 times [2023-02-15 19:21:09,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:09,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118149245] [2023-02-15 19:21:09,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:09,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:09,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:09,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 453 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2023-02-15 19:21:09,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:09,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118149245] [2023-02-15 19:21:09,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118149245] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:09,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:21:09,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:21:09,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234538968] [2023-02-15 19:21:09,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:09,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:09,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:09,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:09,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:21:09,187 INFO L87 Difference]: Start difference. First operand 4810 states and 6630 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:09,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:09,331 INFO L93 Difference]: Finished difference Result 9878 states and 13499 transitions. [2023-02-15 19:21:09,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:09,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 302 [2023-02-15 19:21:09,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:09,338 INFO L225 Difference]: With dead ends: 9878 [2023-02-15 19:21:09,338 INFO L226 Difference]: Without dead ends: 4630 [2023-02-15 19:21:09,343 INFO L412 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 [2023-02-15 19:21:09,344 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 39 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:09,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 273 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:21:09,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4630 states. [2023-02-15 19:21:09,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4630 to 4612. [2023-02-15 19:21:09,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4612 states, 4611 states have (on average 1.3741054001301236) internal successors, (6336), 4611 states have internal predecessors, (6336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:09,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4612 states to 4612 states and 6336 transitions. [2023-02-15 19:21:09,417 INFO L78 Accepts]: Start accepts. Automaton has 4612 states and 6336 transitions. Word has length 302 [2023-02-15 19:21:09,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:09,417 INFO L495 AbstractCegarLoop]: Abstraction has 4612 states and 6336 transitions. [2023-02-15 19:21:09,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:09,417 INFO L276 IsEmpty]: Start isEmpty. Operand 4612 states and 6336 transitions. [2023-02-15 19:21:09,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2023-02-15 19:21:09,423 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:09,423 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:21:09,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-15 19:21:09,423 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:09,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:09,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1919616935, now seen corresponding path program 1 times [2023-02-15 19:21:09,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:09,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470831417] [2023-02-15 19:21:09,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:09,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:09,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 354 proven. 25 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2023-02-15 19:21:09,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:09,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470831417] [2023-02-15 19:21:09,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470831417] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:21:09,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132555379] [2023-02-15 19:21:09,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:09,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:21:09,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:21:09,536 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:21:09,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 19:21:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:09,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 19:21:09,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:21:09,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 875 trivial. 0 not checked. [2023-02-15 19:21:09,871 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 19:21:09,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132555379] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:21:09,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 19:21:09,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-02-15 19:21:09,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525065871] [2023-02-15 19:21:09,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:21:09,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:21:09,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:09,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:21:09,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:21:09,874 INFO L87 Difference]: Start difference. First operand 4612 states and 6336 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:09,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:09,937 INFO L93 Difference]: Finished difference Result 6921 states and 9490 transitions. [2023-02-15 19:21:09,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:21:09,937 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 312 [2023-02-15 19:21:09,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:09,944 INFO L225 Difference]: With dead ends: 6921 [2023-02-15 19:21:09,944 INFO L226 Difference]: Without dead ends: 4614 [2023-02-15 19:21:09,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:21:09,947 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 57 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:09,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 478 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:21:09,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4614 states. [2023-02-15 19:21:10,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4614 to 4600. [2023-02-15 19:21:10,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4600 states, 4599 states have (on average 1.36986301369863) internal successors, (6300), 4599 states have internal predecessors, (6300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:10,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4600 states to 4600 states and 6300 transitions. [2023-02-15 19:21:10,021 INFO L78 Accepts]: Start accepts. Automaton has 4600 states and 6300 transitions. Word has length 312 [2023-02-15 19:21:10,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:10,022 INFO L495 AbstractCegarLoop]: Abstraction has 4600 states and 6300 transitions. [2023-02-15 19:21:10,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:10,022 INFO L276 IsEmpty]: Start isEmpty. Operand 4600 states and 6300 transitions. [2023-02-15 19:21:10,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2023-02-15 19:21:10,028 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:10,028 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:21:10,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 19:21:10,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:21:10,233 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:10,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:10,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1627037657, now seen corresponding path program 1 times [2023-02-15 19:21:10,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:10,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385350409] [2023-02-15 19:21:10,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:10,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:10,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 356 proven. 25 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2023-02-15 19:21:10,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:10,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385350409] [2023-02-15 19:21:10,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385350409] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:21:10,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338631627] [2023-02-15 19:21:10,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:10,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:21:10,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:21:10,337 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:21:10,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 19:21:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:10,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 19:21:10,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:21:10,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 356 proven. 25 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2023-02-15 19:21:10,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:21:10,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 356 proven. 25 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2023-02-15 19:21:10,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338631627] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:21:10,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:21:10,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-02-15 19:21:10,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314512987] [2023-02-15 19:21:10,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:21:10,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 19:21:10,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:10,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 19:21:10,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-02-15 19:21:10,574 INFO L87 Difference]: Start difference. First operand 4600 states and 6300 transitions. Second operand has 11 states, 11 states have (on average 20.818181818181817) internal successors, (229), 11 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:10,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:10,919 INFO L93 Difference]: Finished difference Result 7227 states and 9988 transitions. [2023-02-15 19:21:10,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 19:21:10,921 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 20.818181818181817) internal successors, (229), 11 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 312 [2023-02-15 19:21:10,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:10,927 INFO L225 Difference]: With dead ends: 7227 [2023-02-15 19:21:10,927 INFO L226 Difference]: Without dead ends: 4722 [2023-02-15 19:21:10,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 630 GetRequests, 618 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2023-02-15 19:21:10,930 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 439 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:10,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 1254 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 19:21:10,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4722 states. [2023-02-15 19:21:11,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4722 to 4600. [2023-02-15 19:21:11,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4600 states, 4599 states have (on average 1.3672537508153946) internal successors, (6288), 4599 states have internal predecessors, (6288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:11,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4600 states to 4600 states and 6288 transitions. [2023-02-15 19:21:11,034 INFO L78 Accepts]: Start accepts. Automaton has 4600 states and 6288 transitions. Word has length 312 [2023-02-15 19:21:11,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:11,034 INFO L495 AbstractCegarLoop]: Abstraction has 4600 states and 6288 transitions. [2023-02-15 19:21:11,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.818181818181817) internal successors, (229), 11 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:11,035 INFO L276 IsEmpty]: Start isEmpty. Operand 4600 states and 6288 transitions. [2023-02-15 19:21:11,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2023-02-15 19:21:11,041 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:11,041 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:21:11,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-15 19:21:11,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:21:11,246 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:11,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:11,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1184629009, now seen corresponding path program 1 times [2023-02-15 19:21:11,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:11,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324674599] [2023-02-15 19:21:11,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:11,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:11,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 474 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2023-02-15 19:21:11,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:11,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324674599] [2023-02-15 19:21:11,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324674599] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:21:11,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512944703] [2023-02-15 19:21:11,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:11,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:21:11,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:21:11,324 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:21:11,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 19:21:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:11,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 19:21:11,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:21:11,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 356 proven. 25 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2023-02-15 19:21:11,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:21:11,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 356 proven. 25 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2023-02-15 19:21:11,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512944703] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:21:11,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:21:11,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2023-02-15 19:21:11,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964710292] [2023-02-15 19:21:11,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:21:11,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 19:21:11,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:11,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 19:21:11,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-02-15 19:21:11,551 INFO L87 Difference]: Start difference. First operand 4600 states and 6288 transitions. Second operand has 10 states, 10 states have (on average 32.2) internal successors, (322), 10 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:11,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:11,913 INFO L93 Difference]: Finished difference Result 6005 states and 8260 transitions. [2023-02-15 19:21:11,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 19:21:11,913 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 32.2) internal successors, (322), 10 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 313 [2023-02-15 19:21:11,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:11,916 INFO L225 Difference]: With dead ends: 6005 [2023-02-15 19:21:11,916 INFO L226 Difference]: Without dead ends: 2350 [2023-02-15 19:21:11,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 624 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-02-15 19:21:11,920 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 494 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:11,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 978 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 19:21:11,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2350 states. [2023-02-15 19:21:11,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2350 to 2284. [2023-02-15 19:21:11,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2284 states, 2283 states have (on average 1.3653088042049935) internal successors, (3117), 2283 states have internal predecessors, (3117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:11,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 3117 transitions. [2023-02-15 19:21:11,966 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 3117 transitions. Word has length 313 [2023-02-15 19:21:11,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:11,966 INFO L495 AbstractCegarLoop]: Abstraction has 2284 states and 3117 transitions. [2023-02-15 19:21:11,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 32.2) internal successors, (322), 10 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:11,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 3117 transitions. [2023-02-15 19:21:11,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2023-02-15 19:21:11,970 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:11,971 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:21:11,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 19:21:12,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-02-15 19:21:12,178 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:12,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:12,178 INFO L85 PathProgramCache]: Analyzing trace with hash -2094731103, now seen corresponding path program 1 times [2023-02-15 19:21:12,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:12,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088195071] [2023-02-15 19:21:12,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:12,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:12,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:12,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 475 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2023-02-15 19:21:12,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:12,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088195071] [2023-02-15 19:21:12,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088195071] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:21:12,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032564830] [2023-02-15 19:21:12,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:12,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:21:12,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:21:12,255 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:21:12,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 19:21:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:12,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 19:21:12,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:21:12,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 475 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2023-02-15 19:21:12,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:21:12,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 475 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2023-02-15 19:21:12,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032564830] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:21:12,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:21:12,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-02-15 19:21:12,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131359867] [2023-02-15 19:21:12,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:21:12,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 19:21:12,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:12,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 19:21:12,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:21:12,448 INFO L87 Difference]: Start difference. First operand 2284 states and 3117 transitions. Second operand has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:12,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:12,726 INFO L93 Difference]: Finished difference Result 5795 states and 8022 transitions. [2023-02-15 19:21:12,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 19:21:12,727 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 314 [2023-02-15 19:21:12,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:12,732 INFO L225 Difference]: With dead ends: 5795 [2023-02-15 19:21:12,732 INFO L226 Difference]: Without dead ends: 3380 [2023-02-15 19:21:12,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 634 GetRequests, 628 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-02-15 19:21:12,735 INFO L413 NwaCegarLoop]: 346 mSDtfsCounter, 249 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:12,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 846 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 19:21:12,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3380 states. [2023-02-15 19:21:12,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3380 to 2481. [2023-02-15 19:21:12,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2481 states, 2480 states have (on average 1.375) internal successors, (3410), 2480 states have internal predecessors, (3410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:12,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3410 transitions. [2023-02-15 19:21:12,795 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3410 transitions. Word has length 314 [2023-02-15 19:21:12,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:12,795 INFO L495 AbstractCegarLoop]: Abstraction has 2481 states and 3410 transitions. [2023-02-15 19:21:12,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:12,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3410 transitions. [2023-02-15 19:21:12,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2023-02-15 19:21:12,798 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:21:12,799 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:21:12,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 19:21:13,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:21:13,005 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:21:13,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:21:13,006 INFO L85 PathProgramCache]: Analyzing trace with hash 90171258, now seen corresponding path program 1 times [2023-02-15 19:21:13,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:21:13,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264179551] [2023-02-15 19:21:13,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:13,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:21:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:13,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1258 backedges. 652 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2023-02-15 19:21:13,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:21:13,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264179551] [2023-02-15 19:21:13,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264179551] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:21:13,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014057331] [2023-02-15 19:21:13,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:21:13,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:21:13,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:21:13,094 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:21:13,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 19:21:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:21:13,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 19:21:13,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:21:13,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1258 backedges. 652 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2023-02-15 19:21:13,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:21:13,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1258 backedges. 652 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2023-02-15 19:21:13,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014057331] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:21:13,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:21:13,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-02-15 19:21:13,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249739810] [2023-02-15 19:21:13,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:21:13,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 19:21:13,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:21:13,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 19:21:13,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:21:13,291 INFO L87 Difference]: Start difference. First operand 2481 states and 3410 transitions. Second operand has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:13,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:21:13,434 INFO L93 Difference]: Finished difference Result 3536 states and 4811 transitions. [2023-02-15 19:21:13,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 19:21:13,435 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 340 [2023-02-15 19:21:13,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:21:13,436 INFO L225 Difference]: With dead ends: 3536 [2023-02-15 19:21:13,436 INFO L226 Difference]: Without dead ends: 0 [2023-02-15 19:21:13,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 679 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 19:21:13,438 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 115 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:21:13,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 366 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:21:13,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-15 19:21:13,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-15 19:21:13,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:13,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-15 19:21:13,440 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 340 [2023-02-15 19:21:13,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:21:13,440 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-15 19:21:13,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:21:13,440 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-15 19:21:13,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-15 19:21:13,442 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-15 19:21:13,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-15 19:21:13,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:21:13,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-15 19:21:16,589 INFO L899 garLoopResultBuilder]: For program point L367(lines 367 371) no Hoare annotation was computed. [2023-02-15 19:21:16,590 INFO L899 garLoopResultBuilder]: For program point L235(lines 235 252) no Hoare annotation was computed. [2023-02-15 19:21:16,590 INFO L899 garLoopResultBuilder]: For program point L202(lines 202 551) no Hoare annotation was computed. [2023-02-15 19:21:16,590 INFO L899 garLoopResultBuilder]: For program point L169(lines 169 562) no Hoare annotation was computed. [2023-02-15 19:21:16,590 INFO L899 garLoopResultBuilder]: For program point L235-2(lines 213 545) no Hoare annotation was computed. [2023-02-15 19:21:16,590 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 573) no Hoare annotation was computed. [2023-02-15 19:21:16,590 INFO L899 garLoopResultBuilder]: For program point L501-1(lines 501 513) no Hoare annotation was computed. [2023-02-15 19:21:16,590 INFO L899 garLoopResultBuilder]: For program point L435(lines 435 439) no Hoare annotation was computed. [2023-02-15 19:21:16,591 INFO L899 garLoopResultBuilder]: For program point L237(lines 237 242) no Hoare annotation was computed. [2023-02-15 19:21:16,591 INFO L899 garLoopResultBuilder]: For program point L205(lines 205 550) no Hoare annotation was computed. [2023-02-15 19:21:16,591 INFO L899 garLoopResultBuilder]: For program point L172(lines 172 561) no Hoare annotation was computed. [2023-02-15 19:21:16,591 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 572) no Hoare annotation was computed. [2023-02-15 19:21:16,591 INFO L899 garLoopResultBuilder]: For program point L536(lines 536 540) no Hoare annotation was computed. [2023-02-15 19:21:16,591 INFO L899 garLoopResultBuilder]: For program point L504(lines 504 509) no Hoare annotation was computed. [2023-02-15 19:21:16,591 INFO L899 garLoopResultBuilder]: For program point L471(lines 471 482) no Hoare annotation was computed. [2023-02-15 19:21:16,591 INFO L899 garLoopResultBuilder]: For program point L471-1(lines 471 482) no Hoare annotation was computed. [2023-02-15 19:21:16,591 INFO L899 garLoopResultBuilder]: For program point L273(lines 273 277) no Hoare annotation was computed. [2023-02-15 19:21:16,592 INFO L899 garLoopResultBuilder]: For program point L273-2(lines 213 545) no Hoare annotation was computed. [2023-02-15 19:21:16,593 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_switch_1_4433#1(lines 151 568) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4448)) (.cse2 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and (= 0 |ULTIMATE.start_ssl3_connect_~s__hit~0#1|) .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_connect_~ag_Z~0#1| 48)) (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208) (not (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))))) [2023-02-15 19:21:16,593 INFO L899 garLoopResultBuilder]: For program point L406(lines 406 410) no Hoare annotation was computed. [2023-02-15 19:21:16,593 INFO L899 garLoopResultBuilder]: For program point L340(lines 340 344) no Hoare annotation was computed. [2023-02-15 19:21:16,593 INFO L899 garLoopResultBuilder]: For program point L340-2(lines 213 545) no Hoare annotation was computed. [2023-02-15 19:21:16,593 INFO L899 garLoopResultBuilder]: For program point L208(lines 208 549) no Hoare annotation was computed. [2023-02-15 19:21:16,593 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 560) no Hoare annotation was computed. [2023-02-15 19:21:16,593 INFO L899 garLoopResultBuilder]: For program point L142(lines 142 571) no Hoare annotation was computed. [2023-02-15 19:21:16,595 INFO L895 garLoopResultBuilder]: At program point L109-1(lines 109 612) the Hoare annotation is: (let ((.cse14 (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4368)) (.cse1 (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 12292)) (.cse2 (= 0 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse15 (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4384)) (.cse16 (= 1 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse11 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 2)) (.cse7 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4528)) (.cse8 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse17 (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4416)) (.cse9 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208)) (.cse10 (not (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (.cse0 (= 0 |ULTIMATE.start_ssl3_connect_~s__hit~0#1|)) (.cse4 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560)) (.cse5 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse12 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse6 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|)) (.cse13 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse3 (= |ULTIMATE.start_ssl3_connect_~ag_Z~0#1| 48))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse5 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse6 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560) .cse3) (and .cse7 .cse5 .cse8 .cse9 .cse10) (and .cse9 .cse10 .cse11) (and (= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 3) .cse5 .cse12 .cse9 .cse13 .cse10) (and .cse14 .cse2 .cse9 .cse10) (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 3) (and .cse15 .cse16 .cse9 .cse10) (and .cse0 .cse14 .cse2 .cse3) (and .cse0 (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 48) .cse3) (and .cse1 .cse2 .cse9 .cse10) (and .cse0 .cse15 .cse16 .cse3) (and .cse0 .cse11 .cse3) (and .cse0 .cse7 .cse5 .cse8 .cse3) (and .cse0 .cse5 .cse17 .cse3) (and .cse5 .cse17 .cse9 .cse10) (and .cse0 .cse4 .cse5 .cse12 .cse6 .cse13 .cse3))) [2023-02-15 19:21:16,595 INFO L899 garLoopResultBuilder]: For program point L473(lines 473 479) no Hoare annotation was computed. [2023-02-15 19:21:16,595 INFO L899 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2023-02-15 19:21:16,595 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_switch_1_4417#1(lines 145 570) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4432))) (or (and .cse0 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208) .cse1 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (not (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (and (= 0 |ULTIMATE.start_ssl3_connect_~s__hit~0#1|) .cse0 .cse1 (< 4384 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~ag_Z~0#1| 48)))) [2023-02-15 19:21:16,595 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 632 642) the Hoare annotation is: true [2023-02-15 19:21:16,595 INFO L902 garLoopResultBuilder]: At program point ssl3_connect_returnLabel#1(lines 18 631) the Hoare annotation is: true [2023-02-15 19:21:16,595 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 248) no Hoare annotation was computed. [2023-02-15 19:21:16,595 INFO L899 garLoopResultBuilder]: For program point L310(lines 310 314) no Hoare annotation was computed. [2023-02-15 19:21:16,595 INFO L899 garLoopResultBuilder]: For program point L310-2(lines 310 314) no Hoare annotation was computed. [2023-02-15 19:21:16,595 INFO L899 garLoopResultBuilder]: For program point L178(lines 178 559) no Hoare annotation was computed. [2023-02-15 19:21:16,596 INFO L899 garLoopResultBuilder]: For program point L145(lines 145 570) no Hoare annotation was computed. [2023-02-15 19:21:16,596 INFO L899 garLoopResultBuilder]: For program point L112(lines 112 581) no Hoare annotation was computed. [2023-02-15 19:21:16,596 INFO L899 garLoopResultBuilder]: For program point L443(lines 443 447) no Hoare annotation was computed. [2023-02-15 19:21:16,596 INFO L899 garLoopResultBuilder]: For program point L443-2(lines 213 545) no Hoare annotation was computed. [2023-02-15 19:21:16,596 INFO L899 garLoopResultBuilder]: For program point L311(line 311) no Hoare annotation was computed. [2023-02-15 19:21:16,596 INFO L899 garLoopResultBuilder]: For program point L311-2(line 311) no Hoare annotation was computed. [2023-02-15 19:21:16,596 INFO L899 garLoopResultBuilder]: For program point L311-4(line 311) no Hoare annotation was computed. [2023-02-15 19:21:16,596 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_switch_1_4481#1(lines 175 560) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4512)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse2 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and (= 0 |ULTIMATE.start_ssl3_connect_~s__hit~0#1|) .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_connect_~ag_Z~0#1| 48)) (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208) (not (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))))) [2023-02-15 19:21:16,596 INFO L899 garLoopResultBuilder]: For program point L378(lines 378 382) no Hoare annotation was computed. [2023-02-15 19:21:16,596 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_switch_1_4513#1(lines 187 556) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4528)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse2 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208) (not (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (and (= 0 |ULTIMATE.start_ssl3_connect_~s__hit~0#1|) .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_connect_~ag_Z~0#1| 48)))) [2023-02-15 19:21:16,596 INFO L899 garLoopResultBuilder]: For program point L412(lines 412 417) no Hoare annotation was computed. [2023-02-15 19:21:16,596 INFO L899 garLoopResultBuilder]: For program point L412-2(lines 412 417) no Hoare annotation was computed. [2023-02-15 19:21:16,596 INFO L899 garLoopResultBuilder]: For program point L313(line 313) no Hoare annotation was computed. [2023-02-15 19:21:16,596 INFO L902 garLoopResultBuilder]: At program point ssl3_connect_switch_1_default#1(lines 211 548) the Hoare annotation is: true [2023-02-15 19:21:16,596 INFO L899 garLoopResultBuilder]: For program point L313-2(line 313) no Hoare annotation was computed. [2023-02-15 19:21:16,596 INFO L899 garLoopResultBuilder]: For program point L181(lines 181 558) no Hoare annotation was computed. [2023-02-15 19:21:16,596 INFO L899 garLoopResultBuilder]: For program point L313-4(line 313) no Hoare annotation was computed. [2023-02-15 19:21:16,596 INFO L899 garLoopResultBuilder]: For program point L148(lines 148 569) no Hoare annotation was computed. [2023-02-15 19:21:16,596 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 580) no Hoare annotation was computed. [2023-02-15 19:21:16,597 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_ERROR#1(lines 76 630) the Hoare annotation is: false [2023-02-15 19:21:16,597 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 92) no Hoare annotation was computed. [2023-02-15 19:21:16,597 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_switch_1_4449#1(lines 157 566) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4464)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse2 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and (= 0 |ULTIMATE.start_ssl3_connect_~s__hit~0#1|) .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_connect_~ag_Z~0#1| 48)) (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208) (not (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))))) [2023-02-15 19:21:16,597 INFO L902 garLoopResultBuilder]: At program point L613(lines 76 630) the Hoare annotation is: true [2023-02-15 19:21:16,597 INFO L899 garLoopResultBuilder]: For program point L184(lines 184 557) no Hoare annotation was computed. [2023-02-15 19:21:16,597 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_switch_1_12292#1(lines 112 581) the Hoare annotation is: (let ((.cse2 (= 0 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse4 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208)) (.cse5 (not (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (.cse0 (= 0 |ULTIMATE.start_ssl3_connect_~s__hit~0#1|)) (.cse1 (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 12292)) (.cse6 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 2)) (.cse3 (= |ULTIMATE.start_ssl3_connect_~ag_Z~0#1| 48))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse4 .cse5) (and .cse1 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse6 .cse3))) [2023-02-15 19:21:16,597 INFO L899 garLoopResultBuilder]: For program point L151(lines 151 568) no Hoare annotation was computed. [2023-02-15 19:21:16,597 INFO L899 garLoopResultBuilder]: For program point L118(lines 118 579) no Hoare annotation was computed. [2023-02-15 19:21:16,597 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_switch_1_4497#1(lines 181 558) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4512)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse2 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and (= 0 |ULTIMATE.start_ssl3_connect_~s__hit~0#1|) .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_connect_~ag_Z~0#1| 48)) (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208) (not (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))))) [2023-02-15 19:21:16,597 INFO L899 garLoopResultBuilder]: For program point L383(lines 383 387) no Hoare annotation was computed. [2023-02-15 19:21:16,597 INFO L899 garLoopResultBuilder]: For program point L383-2(lines 383 387) no Hoare annotation was computed. [2023-02-15 19:21:16,597 INFO L895 garLoopResultBuilder]: At program point L218(lines 115 580) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 2)) (.cse0 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208)) (.cse1 (not (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (.cse3 (= 0 |ULTIMATE.start_ssl3_connect_~s__hit~0#1|)) (.cse5 (= 0 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse6 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse4 (= |ULTIMATE.start_ssl3_connect_~ag_Z~0#1| 48))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2 .cse4) (and .cse5 .cse6 .cse0 .cse1) (and .cse3 .cse5 .cse6 .cse4))) [2023-02-15 19:21:16,598 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_switch_1_4561#1(lines 199 552) the Hoare annotation is: (let ((.cse0 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 2)) (and (= 0 |ULTIMATE.start_ssl3_connect_~s__hit~0#1|) .cse0))) [2023-02-15 19:21:16,598 INFO L899 garLoopResultBuilder]: For program point L582(lines 582 610) no Hoare annotation was computed. [2023-02-15 19:21:16,598 INFO L899 garLoopResultBuilder]: For program point L87(lines 87 91) no Hoare annotation was computed. [2023-02-15 19:21:16,598 INFO L899 garLoopResultBuilder]: For program point L87-2(lines 84 92) no Hoare annotation was computed. [2023-02-15 19:21:16,598 INFO L899 garLoopResultBuilder]: For program point L583(lines 583 607) no Hoare annotation was computed. [2023-02-15 19:21:16,598 INFO L899 garLoopResultBuilder]: For program point L517-1(lines 213 545) no Hoare annotation was computed. [2023-02-15 19:21:16,598 INFO L899 garLoopResultBuilder]: For program point L352(lines 352 357) no Hoare annotation was computed. [2023-02-15 19:21:16,598 INFO L899 garLoopResultBuilder]: For program point L286(lines 286 290) no Hoare annotation was computed. [2023-02-15 19:21:16,598 INFO L899 garLoopResultBuilder]: For program point L319-1(lines 319 333) no Hoare annotation was computed. [2023-02-15 19:21:16,598 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 556) no Hoare annotation was computed. [2023-02-15 19:21:16,598 INFO L899 garLoopResultBuilder]: For program point L154(lines 154 567) no Hoare annotation was computed. [2023-02-15 19:21:16,598 INFO L899 garLoopResultBuilder]: For program point L121(lines 121 578) no Hoare annotation was computed. [2023-02-15 19:21:16,598 INFO L899 garLoopResultBuilder]: For program point L617(lines 617 621) no Hoare annotation was computed. [2023-02-15 19:21:16,598 INFO L899 garLoopResultBuilder]: For program point L584(lines 584 593) no Hoare annotation was computed. [2023-02-15 19:21:16,598 INFO L899 garLoopResultBuilder]: For program point L617-2(lines 617 621) no Hoare annotation was computed. [2023-02-15 19:21:16,599 INFO L899 garLoopResultBuilder]: For program point L584-2(lines 583 605) no Hoare annotation was computed. [2023-02-15 19:21:16,599 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_switch_1_4529#1(lines 193 554) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse1 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208) (not (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (and (= 0 |ULTIMATE.start_ssl3_connect_~s__hit~0#1|) .cse0 .cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560) (= |ULTIMATE.start_ssl3_connect_~ag_Z~0#1| 48)))) [2023-02-15 19:21:16,600 INFO L899 garLoopResultBuilder]: For program point L586(lines 586 590) no Hoare annotation was computed. [2023-02-15 19:21:16,600 INFO L899 garLoopResultBuilder]: For program point L454(lines 454 459) no Hoare annotation was computed. [2023-02-15 19:21:16,600 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-15 19:21:16,600 INFO L899 garLoopResultBuilder]: For program point L223(lines 223 227) no Hoare annotation was computed. [2023-02-15 19:21:16,600 INFO L899 garLoopResultBuilder]: For program point L190(lines 190 555) no Hoare annotation was computed. [2023-02-15 19:21:16,600 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 566) no Hoare annotation was computed. [2023-02-15 19:21:16,600 INFO L899 garLoopResultBuilder]: For program point L223-2(lines 213 545) no Hoare annotation was computed. [2023-02-15 19:21:16,600 INFO L899 garLoopResultBuilder]: For program point L124(lines 124 577) no Hoare annotation was computed. [2023-02-15 19:21:16,600 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_switch_1_4385#1(lines 133 574) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_ssl3_connect_~s__hit~0#1|)) (.cse4 (= |ULTIMATE.start_ssl3_connect_~ag_Z~0#1| 48)) (.cse2 (= 1 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse1 (< |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4400)) (.cse6 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208)) (.cse3 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse7 (not (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (.cse5 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse5 .cse4) (and .cse1 .cse2 .cse6 .cse3 .cse7) (and .cse1 .cse6 .cse3 .cse7 .cse5))) [2023-02-15 19:21:16,601 INFO L895 garLoopResultBuilder]: At program point $Ultimate##192(lines 501 513) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 2)) (.cse5 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208)) (.cse6 (not (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (.cse0 (= 0 |ULTIMATE.start_ssl3_connect_~s__hit~0#1|)) (.cse7 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse2 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse4 (= |ULTIMATE.start_ssl3_connect_~ag_Z~0#1| 48))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse5 .cse2 .cse6 .cse3) (and (= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 3) .cse7 .cse1 .cse5 .cse2 .cse6) (and .cse0 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560) .cse7 .cse1 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|) .cse2 .cse4))) [2023-02-15 19:21:16,601 INFO L899 garLoopResultBuilder]: For program point L488(lines 488 492) no Hoare annotation was computed. [2023-02-15 19:21:16,601 INFO L902 garLoopResultBuilder]: At program point $Ultimate##197(lines 517 521) the Hoare annotation is: true [2023-02-15 19:21:16,601 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2023-02-15 19:21:16,601 INFO L899 garLoopResultBuilder]: For program point L323-2(lines 321 333) no Hoare annotation was computed. [2023-02-15 19:21:16,601 INFO L899 garLoopResultBuilder]: For program point L522-1(lines 522 526) no Hoare annotation was computed. [2023-02-15 19:21:16,601 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2023-02-15 19:21:16,601 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_switch_1_4369#1(lines 127 576) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_ssl3_connect_~s__hit~0#1|)) (.cse4 (= |ULTIMATE.start_ssl3_connect_~ag_Z~0#1| 48)) (.cse2 (= 0 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse1 (< |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4400)) (.cse6 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208)) (.cse3 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse7 (not (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (.cse5 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse5 .cse4) (and .cse1 .cse2 .cse6 .cse3 .cse7) (and .cse1 .cse6 .cse3 .cse7 .cse5))) [2023-02-15 19:21:16,601 INFO L895 garLoopResultBuilder]: At program point $Ultimate##137(lines 319 333) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4432)) (.cse1 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 2))) (or (and (= 0 |ULTIMATE.start_ssl3_connect_~s__hit~0#1|) .cse0 .cse1 (< 4384 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~ag_Z~0#1| 48)) (and (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208) .cse0 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (not (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) .cse1))) [2023-02-15 19:21:16,602 INFO L899 garLoopResultBuilder]: For program point L259(lines 259 264) no Hoare annotation was computed. [2023-02-15 19:21:16,602 INFO L899 garLoopResultBuilder]: For program point L193(lines 193 554) no Hoare annotation was computed. [2023-02-15 19:21:16,602 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 565) no Hoare annotation was computed. [2023-02-15 19:21:16,602 INFO L899 garLoopResultBuilder]: For program point L127(lines 127 576) no Hoare annotation was computed. [2023-02-15 19:21:16,602 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 102) no Hoare annotation was computed. [2023-02-15 19:21:16,603 INFO L899 garLoopResultBuilder]: For program point L94-1(lines 76 630) no Hoare annotation was computed. [2023-02-15 19:21:16,603 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-15 19:21:16,603 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_switch_1_4467#1(lines 163 564) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4480)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse2 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208) (not (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (and (= 0 |ULTIMATE.start_ssl3_connect_~s__hit~0#1|) .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_connect_~ag_Z~0#1| 48)))) [2023-02-15 19:21:16,603 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 99) no Hoare annotation was computed. [2023-02-15 19:21:16,603 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-15 19:21:16,603 INFO L899 garLoopResultBuilder]: For program point L493(lines 493 497) no Hoare annotation was computed. [2023-02-15 19:21:16,603 INFO L899 garLoopResultBuilder]: For program point L493-2(lines 493 497) no Hoare annotation was computed. [2023-02-15 19:21:16,603 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 303) no Hoare annotation was computed. [2023-02-15 19:21:16,604 INFO L899 garLoopResultBuilder]: For program point L196(lines 196 553) no Hoare annotation was computed. [2023-02-15 19:21:16,604 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 564) no Hoare annotation was computed. [2023-02-15 19:21:16,604 INFO L899 garLoopResultBuilder]: For program point L130(lines 130 575) no Hoare annotation was computed. [2023-02-15 19:21:16,604 INFO L895 garLoopResultBuilder]: At program point $Ultimate##209(lines 582 610) the Hoare annotation is: (let ((.cse12 (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4368)) (.cse13 (= 0 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse14 (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4384)) (.cse15 (= 1 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse9 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 2)) (.cse5 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4528)) (.cse6 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse16 (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4416)) (.cse7 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208)) (.cse8 (not (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (.cse0 (= 0 |ULTIMATE.start_ssl3_connect_~s__hit~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse10 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse3 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|)) (.cse11 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse4 (= |ULTIMATE.start_ssl3_connect_~ag_Z~0#1| 48))) (or (and .cse0 .cse1 .cse2 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse3 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560) .cse4) (and .cse5 .cse2 .cse6 .cse7 .cse8) (and .cse7 .cse8 .cse9) (and (= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 3) .cse2 .cse10 .cse7 .cse11 .cse8) (and .cse12 .cse13 .cse7 .cse8) (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 3) (and .cse14 .cse15 .cse7 .cse8) (and .cse0 .cse12 .cse13 .cse4) (and .cse0 (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 48) .cse4) (and .cse0 .cse14 .cse15 .cse4) (and .cse0 .cse9 .cse4) (and .cse0 .cse5 .cse2 .cse6 .cse4) (and .cse0 .cse2 .cse16 .cse4) (and .cse2 .cse16 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse11 .cse4))) [2023-02-15 19:21:16,604 INFO L899 garLoopResultBuilder]: For program point L395(lines 395 399) no Hoare annotation was computed. [2023-02-15 19:21:16,604 INFO L899 garLoopResultBuilder]: For program point L362(lines 362 366) no Hoare annotation was computed. [2023-02-15 19:21:16,604 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-15 19:21:16,605 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 624) no Hoare annotation was computed. [2023-02-15 19:21:16,605 INFO L902 garLoopResultBuilder]: At program point L628(lines 76 630) the Hoare annotation is: true [2023-02-15 19:21:16,605 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 601) no Hoare annotation was computed. [2023-02-15 19:21:16,605 INFO L899 garLoopResultBuilder]: For program point L529(lines 529 533) no Hoare annotation was computed. [2023-02-15 19:21:16,605 INFO L899 garLoopResultBuilder]: For program point L529-2(lines 529 533) no Hoare annotation was computed. [2023-02-15 19:21:16,605 INFO L899 garLoopResultBuilder]: For program point L298(lines 298 302) no Hoare annotation was computed. [2023-02-15 19:21:16,605 INFO L899 garLoopResultBuilder]: For program point L298-2(lines 213 545) no Hoare annotation was computed. [2023-02-15 19:21:16,605 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 552) no Hoare annotation was computed. [2023-02-15 19:21:16,606 INFO L899 garLoopResultBuilder]: For program point L166(lines 166 563) no Hoare annotation was computed. [2023-02-15 19:21:16,606 INFO L899 garLoopResultBuilder]: For program point L133(lines 133 574) no Hoare annotation was computed. [2023-02-15 19:21:16,606 INFO L899 garLoopResultBuilder]: For program point L464(lines 464 468) no Hoare annotation was computed. [2023-02-15 19:21:16,608 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:21:16,610 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 19:21:16,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 07:21:16 BoogieIcfgContainer [2023-02-15 19:21:16,640 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 19:21:16,641 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 19:21:16,641 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 19:21:16,641 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 19:21:16,642 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:21:04" (3/4) ... [2023-02-15 19:21:16,643 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-15 19:21:16,659 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2023-02-15 19:21:16,660 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-15 19:21:16,660 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-15 19:21:16,660 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-15 19:21:16,722 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 19:21:16,722 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 19:21:16,722 INFO L158 Benchmark]: Toolchain (without parser) took 13443.10ms. Allocated memory was 136.3MB in the beginning and 591.4MB in the end (delta: 455.1MB). Free memory was 100.2MB in the beginning and 526.6MB in the end (delta: -426.4MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2023-02-15 19:21:16,723 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 136.3MB. Free memory is still 109.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 19:21:16,723 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.57ms. Allocated memory is still 136.3MB. Free memory was 100.0MB in the beginning and 84.6MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-15 19:21:16,723 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.59ms. Allocated memory is still 136.3MB. Free memory was 84.6MB in the beginning and 81.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 19:21:16,723 INFO L158 Benchmark]: Boogie Preprocessor took 31.71ms. Allocated memory is still 136.3MB. Free memory was 81.7MB in the beginning and 79.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 19:21:16,723 INFO L158 Benchmark]: RCFGBuilder took 545.89ms. Allocated memory was 136.3MB in the beginning and 165.7MB in the end (delta: 29.4MB). Free memory was 79.6MB in the beginning and 122.1MB in the end (delta: -42.5MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2023-02-15 19:21:16,725 INFO L158 Benchmark]: TraceAbstraction took 12546.42ms. Allocated memory was 165.7MB in the beginning and 591.4MB in the end (delta: 425.7MB). Free memory was 122.1MB in the beginning and 533.9MB in the end (delta: -411.8MB). Peak memory consumption was 357.4MB. Max. memory is 16.1GB. [2023-02-15 19:21:16,725 INFO L158 Benchmark]: Witness Printer took 81.15ms. Allocated memory is still 591.4MB. Free memory was 533.9MB in the beginning and 526.6MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-15 19:21:16,731 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 136.3MB. Free memory is still 109.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.57ms. Allocated memory is still 136.3MB. Free memory was 100.0MB in the beginning and 84.6MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.59ms. Allocated memory is still 136.3MB. Free memory was 84.6MB in the beginning and 81.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.71ms. Allocated memory is still 136.3MB. Free memory was 81.7MB in the beginning and 79.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 545.89ms. Allocated memory was 136.3MB in the beginning and 165.7MB in the end (delta: 29.4MB). Free memory was 79.6MB in the beginning and 122.1MB in the end (delta: -42.5MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12546.42ms. Allocated memory was 165.7MB in the beginning and 591.4MB in the end (delta: 425.7MB). Free memory was 122.1MB in the beginning and 533.9MB in the end (delta: -411.8MB). Peak memory consumption was 357.4MB. Max. memory is 16.1GB. * Witness Printer took 81.15ms. Allocated memory is still 591.4MB. Free memory was 533.9MB in the beginning and 526.6MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 624]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 132 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.5s, OverallIterations: 25, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2709 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2709 mSDsluCounter, 9568 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4499 mSDsCounter, 639 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3694 IncrementalHoareTripleChecker+Invalid, 4333 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 639 mSolverCounterUnsat, 5069 mSDtfsCounter, 3694 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3538 GetRequests, 3472 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4810occurred in iteration=19, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 25 MinimizatonAttempts, 1963 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 24 PreInvPairs, 315 NumberOfFragments, 1095 HoareAnnotationTreeSize, 24 FomulaSimplifications, 118129 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 24 FomulaSimplificationsInter, 6844 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 6986 NumberOfCodeBlocks, 6986 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 8229 ConstructedInterpolants, 0 QuantifiedInterpolants, 11596 SizeOfPredicates, 4 NumberOfNonLiveVariables, 4011 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 36 InterpolantComputations, 21 PerfectInterpolantSequences, 25321/25584 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((((0 == s__hit && s__state < 4400) && 0 == blastFlag) && 4352 <= s__state) && ag_Z == 48) || ((((0 == s__hit && s__state < 4400) && 4352 <= s__state) && blastFlag == 2) && ag_Z == 48)) || ((((s__state < 4400 && 0 == blastFlag) && ag_Y <= 208) && 4352 <= s__state) && !(s__hit == 0))) || ((((s__state < 4400 && ag_Y <= 208) && 4352 <= s__state) && !(s__hit == 0)) && blastFlag == 2) - InvariantResult [Line: 151]: Loop Invariant Derived loop invariant: ((((0 == s__hit && blastFlag <= 4) && s__state <= 4448) && 4432 <= s__state) && ag_Z == 48) || ((((blastFlag <= 4 && s__state <= 4448) && 4432 <= s__state) && ag_Y <= 208) && !(s__hit == 0)) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: ((((((0 == s__hit && s__state < 4400) && 1 == blastFlag) && 4352 <= s__state) && ag_Z == 48) || ((((0 == s__hit && s__state < 4400) && 4352 <= s__state) && blastFlag == 2) && ag_Z == 48)) || ((((s__state < 4400 && 1 == blastFlag) && ag_Y <= 208) && 4352 <= s__state) && !(s__hit == 0))) || ((((s__state < 4400 && ag_Y <= 208) && 4352 <= s__state) && !(s__hit == 0)) && blastFlag == 2) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: (((((0 == s__hit && s__state == 12292) && 0 == blastFlag) && ag_Z == 48) || (((s__state == 12292 && 0 == blastFlag) && ag_Y <= 208) && !(s__hit == 0))) || (((s__state == 12292 && ag_Y <= 208) && !(s__hit == 0)) && blastFlag == 2)) || (((0 == s__hit && s__state == 12292) && blastFlag == 2) && ag_Z == 48) - InvariantResult [Line: 501]: Loop Invariant Derived loop invariant: ((((((0 == s__hit && s__state <= 4352) && 4352 <= s__state) && blastFlag == 2) && ag_Z == 48) || ((((s__state <= 4352 && ag_Y <= 208) && 4352 <= s__state) && !(s__hit == 0)) && blastFlag == 2)) || (((((s__s3__tmp__next_state___0 == 3 && blastFlag <= 4) && s__state <= 4352) && ag_Y <= 208) && 4352 <= s__state) && !(s__hit == 0))) || ((((((0 == s__hit && s__s3__tmp__next_state___0 <= 4560) && blastFlag <= 4) && s__state <= 4352) && 4560 <= s__s3__tmp__next_state___0) && 4352 <= s__state) && ag_Z == 48) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((((((((((((((((0 == s__hit && s__state == 12292) && 0 == blastFlag) && ag_Z == 48) || ((((((0 == s__hit && s__s3__tmp__next_state___0 <= 4560) && blastFlag <= 4) && 4560 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && s__state <= 4560) && ag_Z == 48)) || ((((s__state <= 4528 && blastFlag <= 4) && 4432 <= s__state) && ag_Y <= 208) && !(s__hit == 0))) || ((ag_Y <= 208 && !(s__hit == 0)) && blastFlag == 2)) || (((((s__s3__tmp__next_state___0 == 3 && blastFlag <= 4) && s__state <= 4352) && ag_Y <= 208) && 4352 <= s__state) && !(s__hit == 0))) || (((s__state == 4368 && 0 == blastFlag) && ag_Y <= 208) && !(s__hit == 0))) || s__state == 3) || (((s__state == 4384 && 1 == blastFlag) && ag_Y <= 208) && !(s__hit == 0))) || (((0 == s__hit && s__state == 4368) && 0 == blastFlag) && ag_Z == 48)) || ((0 == s__hit && s__state == 48) && ag_Z == 48)) || (((s__state == 12292 && 0 == blastFlag) && ag_Y <= 208) && !(s__hit == 0))) || (((0 == s__hit && s__state == 4384) && 1 == blastFlag) && ag_Z == 48)) || ((0 == s__hit && blastFlag == 2) && ag_Z == 48)) || ((((0 == s__hit && s__state <= 4528) && blastFlag <= 4) && 4432 <= s__state) && ag_Z == 48)) || (((0 == s__hit && blastFlag <= 4) && s__state == 4416) && ag_Z == 48)) || (((blastFlag <= 4 && s__state == 4416) && ag_Y <= 208) && !(s__hit == 0))) || ((((((0 == s__hit && s__s3__tmp__next_state___0 <= 4560) && blastFlag <= 4) && s__state <= 4352) && 4560 <= s__s3__tmp__next_state___0) && 4352 <= s__state) && ag_Z == 48) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((0 == s__hit && s__state <= 4464) && blastFlag <= 4) && 4432 <= s__state) && ag_Z == 48) || ((((s__state <= 4464 && blastFlag <= 4) && 4432 <= s__state) && ag_Y <= 208) && !(s__hit == 0)) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: ((((s__state <= 4480 && blastFlag <= 4) && 4432 <= s__state) && ag_Y <= 208) && !(s__hit == 0)) || ((((0 == s__hit && s__state <= 4480) && blastFlag <= 4) && 4432 <= s__state) && ag_Z == 48) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((((ag_Y <= 208 && !(s__hit == 0)) && blastFlag == 2) || ((0 == s__hit && blastFlag == 2) && ag_Z == 48)) || (((0 == blastFlag && s__state <= 4352) && ag_Y <= 208) && !(s__hit == 0))) || (((0 == s__hit && 0 == blastFlag) && s__state <= 4352) && ag_Z == 48) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((blastFlag <= 4 && 4432 <= s__state) && ag_Y <= 208) && !(s__hit == 0)) || ((((0 == s__hit && blastFlag <= 4) && 4432 <= s__state) && s__state <= 4560) && ag_Z == 48) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((((blastFlag <= 4 && ag_Y <= 208) && s__state <= 4432) && 4352 <= s__state) && !(s__hit == 0)) || ((((0 == s__hit && blastFlag <= 4) && s__state <= 4432) && 4384 < s__state) && ag_Z == 48) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: ((((s__state <= 4528 && blastFlag <= 4) && 4432 <= s__state) && ag_Y <= 208) && !(s__hit == 0)) || ((((0 == s__hit && s__state <= 4528) && blastFlag <= 4) && 4432 <= s__state) && ag_Z == 48) - InvariantResult [Line: 582]: Loop Invariant Derived loop invariant: (((((((((((((((((((0 == s__hit && s__s3__tmp__next_state___0 <= 4560) && blastFlag <= 4) && 4560 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && s__state <= 4560) && ag_Z == 48) || ((((s__state <= 4528 && blastFlag <= 4) && 4432 <= s__state) && ag_Y <= 208) && !(s__hit == 0))) || ((ag_Y <= 208 && !(s__hit == 0)) && blastFlag == 2)) || (((((s__s3__tmp__next_state___0 == 3 && blastFlag <= 4) && s__state <= 4352) && ag_Y <= 208) && 4352 <= s__state) && !(s__hit == 0))) || (((s__state == 4368 && 0 == blastFlag) && ag_Y <= 208) && !(s__hit == 0))) || s__state == 3) || (((s__state == 4384 && 1 == blastFlag) && ag_Y <= 208) && !(s__hit == 0))) || (((0 == s__hit && s__state == 4368) && 0 == blastFlag) && ag_Z == 48)) || ((0 == s__hit && s__state == 48) && ag_Z == 48)) || (((0 == s__hit && s__state == 4384) && 1 == blastFlag) && ag_Z == 48)) || ((0 == s__hit && blastFlag == 2) && ag_Z == 48)) || ((((0 == s__hit && s__state <= 4528) && blastFlag <= 4) && 4432 <= s__state) && ag_Z == 48)) || (((0 == s__hit && blastFlag <= 4) && s__state == 4416) && ag_Z == 48)) || (((blastFlag <= 4 && s__state == 4416) && ag_Y <= 208) && !(s__hit == 0))) || ((((((0 == s__hit && s__s3__tmp__next_state___0 <= 4560) && blastFlag <= 4) && s__state <= 4352) && 4560 <= s__s3__tmp__next_state___0) && 4352 <= s__state) && ag_Z == 48) - InvariantResult [Line: 632]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: ((((0 == s__hit && s__state <= 4512) && blastFlag <= 4) && 4432 <= s__state) && ag_Z == 48) || ((((s__state <= 4512 && blastFlag <= 4) && 4432 <= s__state) && ag_Y <= 208) && !(s__hit == 0)) - InvariantResult [Line: 517]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 319]: Loop Invariant Derived loop invariant: ((((0 == s__hit && s__state <= 4432) && blastFlag == 2) && 4384 < s__state) && ag_Z == 48) || ((((ag_Y <= 208 && s__state <= 4432) && 4352 <= s__state) && !(s__hit == 0)) && blastFlag == 2) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: ((4432 <= s__state && ag_Y <= 208) && blastFlag == 2) || (0 == s__hit && 4432 <= s__state) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: ((((0 == s__hit && s__state <= 4512) && blastFlag <= 4) && 4432 <= s__state) && ag_Z == 48) || ((((s__state <= 4512 && blastFlag <= 4) && 4432 <= s__state) && ag_Y <= 208) && !(s__hit == 0)) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-02-15 19:21:16,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE