./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl-simplified/s3_srvr_8.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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/openssl-simplified/s3_srvr_8.cil.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 5054b3667a60af3f61474096f335d8baa07a6095dce3dfeeb01aec4cc568aead --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:46:25,930 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:46:25,932 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:46:25,968 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:46:25,969 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:46:25,970 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:46:25,971 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:46:25,973 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:46:25,974 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:46:25,977 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:46:25,978 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:46:25,979 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:46:25,979 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:46:25,981 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:46:25,982 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:46:25,984 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:46:25,985 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:46:25,986 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:46:25,987 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:46:25,991 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:46:25,992 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:46:25,993 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:46:25,994 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:46:25,994 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:46:25,995 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:46:26,000 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:46:26,001 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:46:26,001 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:46:26,002 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:46:26,002 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:46:26,003 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:46:26,003 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:46:26,004 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:46:26,005 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:46:26,005 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:46:26,006 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:46:26,006 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:46:26,006 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:46:26,007 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:46:26,007 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:46:26,008 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:46:26,009 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:46:26,010 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:46:26,031 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:46:26,032 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:46:26,032 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:46:26,032 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:46:26,033 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:46:26,033 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:46:26,033 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:46:26,034 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:46:26,034 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:46:26,034 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:46:26,035 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:46:26,035 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:46:26,035 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:46:26,035 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:46:26,035 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:46:26,035 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:46:26,036 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:46:26,036 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:46:26,036 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:46:26,036 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:46:26,036 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:46:26,036 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:46:26,036 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:46:26,037 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:46:26,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:46:26,037 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:46:26,037 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:46:26,037 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:46:26,037 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:46:26,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:46:26,038 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:46:26,038 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:46:26,038 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:46:26,038 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 5054b3667a60af3f61474096f335d8baa07a6095dce3dfeeb01aec4cc568aead [2022-07-11 23:46:26,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:46:26,251 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:46:26,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:46:26,254 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:46:26,254 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:46:26,256 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_8.cil.c [2022-07-11 23:46:26,313 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fea57af6/436f242202444f2fa149f50b66aabec7/FLAG7071b92ed [2022-07-11 23:46:26,660 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:46:26,660 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_8.cil.c [2022-07-11 23:46:26,667 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fea57af6/436f242202444f2fa149f50b66aabec7/FLAG7071b92ed [2022-07-11 23:46:26,675 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fea57af6/436f242202444f2fa149f50b66aabec7 [2022-07-11 23:46:26,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:46:26,678 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:46:26,679 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:46:26,679 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:46:26,681 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:46:26,682 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:46:26" (1/1) ... [2022-07-11 23:46:26,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47123d8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:26, skipping insertion in model container [2022-07-11 23:46:26,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:46:26" (1/1) ... [2022-07-11 23:46:26,687 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:46:26,717 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:46:26,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_8.cil.c[44970,44983] [2022-07-11 23:46:26,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:46:26,899 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:46:26,932 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_8.cil.c[44970,44983] [2022-07-11 23:46:26,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:46:26,942 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:46:26,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:26 WrapperNode [2022-07-11 23:46:26,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:46:26,943 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:46:26,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:46:26,944 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:46:26,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:26" (1/1) ... [2022-07-11 23:46:26,971 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:26" (1/1) ... [2022-07-11 23:46:26,991 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 558 [2022-07-11 23:46:26,991 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:46:26,992 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:46:26,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:46:26,992 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:46:26,997 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:26" (1/1) ... [2022-07-11 23:46:26,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:26" (1/1) ... [2022-07-11 23:46:27,000 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:26" (1/1) ... [2022-07-11 23:46:27,000 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:26" (1/1) ... [2022-07-11 23:46:27,004 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:26" (1/1) ... [2022-07-11 23:46:27,012 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:26" (1/1) ... [2022-07-11 23:46:27,013 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:26" (1/1) ... [2022-07-11 23:46:27,016 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:46:27,016 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:46:27,016 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:46:27,016 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:46:27,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:26" (1/1) ... [2022-07-11 23:46:27,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:46:27,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:46:27,052 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) [2022-07-11 23:46:27,054 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 [2022-07-11 23:46:27,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:46:27,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:46:27,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:46:27,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:46:27,131 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:46:27,132 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:46:27,143 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:46:27,574 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-11 23:46:27,574 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-11 23:46:27,575 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:46:27,580 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:46:27,580 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-11 23:46:27,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:46:27 BoogieIcfgContainer [2022-07-11 23:46:27,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:46:27,583 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:46:27,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:46:27,586 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:46:27,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:46:26" (1/3) ... [2022-07-11 23:46:27,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485e33b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:46:27, skipping insertion in model container [2022-07-11 23:46:27,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:26" (2/3) ... [2022-07-11 23:46:27,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485e33b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:46:27, skipping insertion in model container [2022-07-11 23:46:27,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:46:27" (3/3) ... [2022-07-11 23:46:27,588 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_8.cil.c [2022-07-11 23:46:27,597 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:46:27,597 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:46:27,629 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:46:27,634 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7024680d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4721e87a [2022-07-11 23:46:27,634 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:46:27,643 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 145 states have (on average 1.7379310344827585) internal successors, (252), 146 states have internal predecessors, (252), 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) [2022-07-11 23:46:27,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-11 23:46:27,650 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:27,651 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:27,651 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:27,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:27,654 INFO L85 PathProgramCache]: Analyzing trace with hash -737748433, now seen corresponding path program 1 times [2022-07-11 23:46:27,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:27,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101255448] [2022-07-11 23:46:27,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:27,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:27,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:46:27,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:27,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101255448] [2022-07-11 23:46:27,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101255448] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:27,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:27,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:27,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079910404] [2022-07-11 23:46:27,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:27,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:27,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:27,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:27,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:27,888 INFO L87 Difference]: Start difference. First operand has 147 states, 145 states have (on average 1.7379310344827585) internal successors, (252), 146 states have internal predecessors, (252), 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 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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) [2022-07-11 23:46:28,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:28,091 INFO L93 Difference]: Finished difference Result 339 states and 586 transitions. [2022-07-11 23:46:28,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:28,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 42 [2022-07-11 23:46:28,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:28,104 INFO L225 Difference]: With dead ends: 339 [2022-07-11 23:46:28,104 INFO L226 Difference]: Without dead ends: 180 [2022-07-11 23:46:28,107 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 [2022-07-11 23:46:28,110 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 188 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:28,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 205 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:28,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-07-11 23:46:28,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 172. [2022-07-11 23:46:28,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.631578947368421) internal successors, (279), 171 states have internal predecessors, (279), 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) [2022-07-11 23:46:28,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 279 transitions. [2022-07-11 23:46:28,151 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 279 transitions. Word has length 42 [2022-07-11 23:46:28,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:28,152 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 279 transitions. [2022-07-11 23:46:28,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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) [2022-07-11 23:46:28,152 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 279 transitions. [2022-07-11 23:46:28,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-11 23:46:28,153 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:28,153 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:28,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:46:28,154 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:28,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:28,154 INFO L85 PathProgramCache]: Analyzing trace with hash 948641361, now seen corresponding path program 1 times [2022-07-11 23:46:28,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:28,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963721559] [2022-07-11 23:46:28,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:28,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:28,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:46:28,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:28,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963721559] [2022-07-11 23:46:28,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963721559] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:28,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:28,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:28,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636105846] [2022-07-11 23:46:28,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:28,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:28,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:28,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:28,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:28,241 INFO L87 Difference]: Start difference. First operand 172 states and 279 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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) [2022-07-11 23:46:28,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:28,353 INFO L93 Difference]: Finished difference Result 383 states and 631 transitions. [2022-07-11 23:46:28,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:28,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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 43 [2022-07-11 23:46:28,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:28,355 INFO L225 Difference]: With dead ends: 383 [2022-07-11 23:46:28,355 INFO L226 Difference]: Without dead ends: 219 [2022-07-11 23:46:28,356 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 [2022-07-11 23:46:28,357 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 145 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:28,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 159 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:28,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-07-11 23:46:28,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 211. [2022-07-11 23:46:28,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.6761904761904762) internal successors, (352), 210 states have internal predecessors, (352), 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) [2022-07-11 23:46:28,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 352 transitions. [2022-07-11 23:46:28,379 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 352 transitions. Word has length 43 [2022-07-11 23:46:28,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:28,379 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 352 transitions. [2022-07-11 23:46:28,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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) [2022-07-11 23:46:28,380 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 352 transitions. [2022-07-11 23:46:28,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-11 23:46:28,382 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:28,382 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-11 23:46:28,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:46:28,383 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:28,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:28,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1292311850, now seen corresponding path program 1 times [2022-07-11 23:46:28,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:28,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267805970] [2022-07-11 23:46:28,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:28,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:28,431 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:46:28,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:28,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267805970] [2022-07-11 23:46:28,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267805970] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:28,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:28,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:28,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227596599] [2022-07-11 23:46:28,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:28,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:28,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:28,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:28,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:28,434 INFO L87 Difference]: Start difference. First operand 211 states and 352 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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) [2022-07-11 23:46:28,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:28,530 INFO L93 Difference]: Finished difference Result 445 states and 750 transitions. [2022-07-11 23:46:28,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:28,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 [2022-07-11 23:46:28,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:28,531 INFO L225 Difference]: With dead ends: 445 [2022-07-11 23:46:28,532 INFO L226 Difference]: Without dead ends: 242 [2022-07-11 23:46:28,532 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 [2022-07-11 23:46:28,533 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 148 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:28,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 167 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:28,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-07-11 23:46:28,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2022-07-11 23:46:28,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 1.6929460580912863) internal successors, (408), 241 states have internal predecessors, (408), 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) [2022-07-11 23:46:28,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 408 transitions. [2022-07-11 23:46:28,543 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 408 transitions. Word has length 70 [2022-07-11 23:46:28,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:28,543 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 408 transitions. [2022-07-11 23:46:28,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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) [2022-07-11 23:46:28,544 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 408 transitions. [2022-07-11 23:46:28,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-11 23:46:28,546 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:28,546 INFO L195 NwaCegarLoop]: trace histogram [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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:28,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-11 23:46:28,546 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:28,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:28,547 INFO L85 PathProgramCache]: Analyzing trace with hash 536323774, now seen corresponding path program 1 times [2022-07-11 23:46:28,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:28,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872225528] [2022-07-11 23:46:28,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:28,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:28,586 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:46:28,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:28,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872225528] [2022-07-11 23:46:28,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872225528] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:28,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:28,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:28,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612960892] [2022-07-11 23:46:28,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:28,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:28,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:28,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:28,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:28,589 INFO L87 Difference]: Start difference. First operand 242 states and 408 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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) [2022-07-11 23:46:28,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:28,693 INFO L93 Difference]: Finished difference Result 514 states and 873 transitions. [2022-07-11 23:46:28,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:28,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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 75 [2022-07-11 23:46:28,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:28,695 INFO L225 Difference]: With dead ends: 514 [2022-07-11 23:46:28,695 INFO L226 Difference]: Without dead ends: 280 [2022-07-11 23:46:28,696 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 [2022-07-11 23:46:28,697 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 149 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:28,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 150 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:28,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-07-11 23:46:28,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 278. [2022-07-11 23:46:28,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 1.7075812274368232) internal successors, (473), 277 states have internal predecessors, (473), 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) [2022-07-11 23:46:28,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 473 transitions. [2022-07-11 23:46:28,705 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 473 transitions. Word has length 75 [2022-07-11 23:46:28,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:28,706 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 473 transitions. [2022-07-11 23:46:28,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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) [2022-07-11 23:46:28,706 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 473 transitions. [2022-07-11 23:46:28,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-11 23:46:28,708 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:28,708 INFO L195 NwaCegarLoop]: trace histogram [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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:28,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-11 23:46:28,708 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:28,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:28,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1235838524, now seen corresponding path program 1 times [2022-07-11 23:46:28,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:28,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441286619] [2022-07-11 23:46:28,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:28,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:28,745 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:46:28,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:28,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441286619] [2022-07-11 23:46:28,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441286619] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:28,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:28,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:28,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650212558] [2022-07-11 23:46:28,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:28,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:28,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:28,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:28,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:28,748 INFO L87 Difference]: Start difference. First operand 278 states and 473 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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) [2022-07-11 23:46:28,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:28,854 INFO L93 Difference]: Finished difference Result 550 states and 936 transitions. [2022-07-11 23:46:28,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:28,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 76 [2022-07-11 23:46:28,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:28,857 INFO L225 Difference]: With dead ends: 550 [2022-07-11 23:46:28,857 INFO L226 Difference]: Without dead ends: 280 [2022-07-11 23:46:28,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 [2022-07-11 23:46:28,865 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 148 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:28,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 150 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:28,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-07-11 23:46:28,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 278. [2022-07-11 23:46:28,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 1.7003610108303249) internal successors, (471), 277 states have internal predecessors, (471), 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) [2022-07-11 23:46:28,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 471 transitions. [2022-07-11 23:46:28,875 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 471 transitions. Word has length 76 [2022-07-11 23:46:28,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:28,876 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 471 transitions. [2022-07-11 23:46:28,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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) [2022-07-11 23:46:28,877 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 471 transitions. [2022-07-11 23:46:28,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-11 23:46:28,878 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:28,878 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-07-11 23:46:28,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-11 23:46:28,879 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:28,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:28,883 INFO L85 PathProgramCache]: Analyzing trace with hash -319662848, now seen corresponding path program 1 times [2022-07-11 23:46:28,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:28,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847366866] [2022-07-11 23:46:28,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:28,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:28,953 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-11 23:46:28,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:28,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847366866] [2022-07-11 23:46:28,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847366866] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:28,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:28,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:28,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958459322] [2022-07-11 23:46:28,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:28,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:28,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:28,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:28,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:28,957 INFO L87 Difference]: Start difference. First operand 278 states and 471 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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) [2022-07-11 23:46:29,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:29,030 INFO L93 Difference]: Finished difference Result 565 states and 958 transitions. [2022-07-11 23:46:29,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:29,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 82 [2022-07-11 23:46:29,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:29,031 INFO L225 Difference]: With dead ends: 565 [2022-07-11 23:46:29,031 INFO L226 Difference]: Without dead ends: 295 [2022-07-11 23:46:29,032 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 [2022-07-11 23:46:29,034 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 170 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:29,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 162 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:29,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-07-11 23:46:29,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 293. [2022-07-11 23:46:29,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 1.6883561643835616) internal successors, (493), 292 states have internal predecessors, (493), 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) [2022-07-11 23:46:29,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 493 transitions. [2022-07-11 23:46:29,042 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 493 transitions. Word has length 82 [2022-07-11 23:46:29,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:29,042 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 493 transitions. [2022-07-11 23:46:29,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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) [2022-07-11 23:46:29,042 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 493 transitions. [2022-07-11 23:46:29,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-11 23:46:29,043 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:29,043 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-11 23:46:29,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-11 23:46:29,044 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:29,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:29,044 INFO L85 PathProgramCache]: Analyzing trace with hash 36611111, now seen corresponding path program 1 times [2022-07-11 23:46:29,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:29,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242574066] [2022-07-11 23:46:29,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:29,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:29,067 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-11 23:46:29,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:29,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242574066] [2022-07-11 23:46:29,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242574066] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:29,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:29,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:29,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465062635] [2022-07-11 23:46:29,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:29,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:29,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:29,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:29,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:29,069 INFO L87 Difference]: Start difference. First operand 293 states and 493 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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) [2022-07-11 23:46:29,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:29,141 INFO L93 Difference]: Finished difference Result 580 states and 976 transitions. [2022-07-11 23:46:29,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:29,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 83 [2022-07-11 23:46:29,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:29,143 INFO L225 Difference]: With dead ends: 580 [2022-07-11 23:46:29,143 INFO L226 Difference]: Without dead ends: 295 [2022-07-11 23:46:29,144 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 [2022-07-11 23:46:29,144 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 169 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:29,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 150 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:29,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-07-11 23:46:29,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 293. [2022-07-11 23:46:29,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 1.6746575342465753) internal successors, (489), 292 states have internal predecessors, (489), 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) [2022-07-11 23:46:29,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 489 transitions. [2022-07-11 23:46:29,151 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 489 transitions. Word has length 83 [2022-07-11 23:46:29,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:29,151 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 489 transitions. [2022-07-11 23:46:29,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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) [2022-07-11 23:46:29,152 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 489 transitions. [2022-07-11 23:46:29,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-11 23:46:29,152 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:29,152 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-11 23:46:29,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-11 23:46:29,153 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:29,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:29,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1085911816, now seen corresponding path program 1 times [2022-07-11 23:46:29,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:29,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241179887] [2022-07-11 23:46:29,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:29,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:29,176 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-11 23:46:29,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:29,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241179887] [2022-07-11 23:46:29,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241179887] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:29,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:29,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:29,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134768887] [2022-07-11 23:46:29,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:29,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:29,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:29,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:29,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:29,178 INFO L87 Difference]: Start difference. First operand 293 states and 489 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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) [2022-07-11 23:46:29,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:29,245 INFO L93 Difference]: Finished difference Result 587 states and 978 transitions. [2022-07-11 23:46:29,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:29,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 95 [2022-07-11 23:46:29,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:29,247 INFO L225 Difference]: With dead ends: 587 [2022-07-11 23:46:29,247 INFO L226 Difference]: Without dead ends: 302 [2022-07-11 23:46:29,247 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 [2022-07-11 23:46:29,248 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 174 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:29,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 161 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:29,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-07-11 23:46:29,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2022-07-11 23:46:29,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 1.6445182724252492) internal successors, (495), 301 states have internal predecessors, (495), 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) [2022-07-11 23:46:29,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 495 transitions. [2022-07-11 23:46:29,254 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 495 transitions. Word has length 95 [2022-07-11 23:46:29,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:29,255 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 495 transitions. [2022-07-11 23:46:29,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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) [2022-07-11 23:46:29,255 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 495 transitions. [2022-07-11 23:46:29,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-11 23:46:29,256 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:29,256 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-11 23:46:29,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-11 23:46:29,256 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:29,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:29,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1253123203, now seen corresponding path program 1 times [2022-07-11 23:46:29,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:29,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988244226] [2022-07-11 23:46:29,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:29,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:29,281 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-11 23:46:29,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:29,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988244226] [2022-07-11 23:46:29,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988244226] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:29,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:29,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:29,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182165819] [2022-07-11 23:46:29,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:29,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:29,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:29,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:29,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:29,283 INFO L87 Difference]: Start difference. First operand 302 states and 495 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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) [2022-07-11 23:46:29,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:29,376 INFO L93 Difference]: Finished difference Result 627 states and 1031 transitions. [2022-07-11 23:46:29,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:29,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 96 [2022-07-11 23:46:29,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:29,378 INFO L225 Difference]: With dead ends: 627 [2022-07-11 23:46:29,378 INFO L226 Difference]: Without dead ends: 333 [2022-07-11 23:46:29,378 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 [2022-07-11 23:46:29,379 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 153 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:29,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 153 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:29,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-07-11 23:46:29,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 331. [2022-07-11 23:46:29,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 330 states have (on average 1.6424242424242423) internal successors, (542), 330 states have internal predecessors, (542), 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) [2022-07-11 23:46:29,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 542 transitions. [2022-07-11 23:46:29,386 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 542 transitions. Word has length 96 [2022-07-11 23:46:29,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:29,386 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 542 transitions. [2022-07-11 23:46:29,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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) [2022-07-11 23:46:29,386 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 542 transitions. [2022-07-11 23:46:29,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-11 23:46:29,387 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:29,387 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-11 23:46:29,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-11 23:46:29,387 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:29,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:29,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1238667318, now seen corresponding path program 1 times [2022-07-11 23:46:29,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:29,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863575766] [2022-07-11 23:46:29,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:29,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:29,408 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-11 23:46:29,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:29,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863575766] [2022-07-11 23:46:29,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863575766] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:29,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:29,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:29,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760009402] [2022-07-11 23:46:29,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:29,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:29,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:29,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:29,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:29,410 INFO L87 Difference]: Start difference. First operand 331 states and 542 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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) [2022-07-11 23:46:29,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:29,513 INFO L93 Difference]: Finished difference Result 656 states and 1074 transitions. [2022-07-11 23:46:29,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:29,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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 97 [2022-07-11 23:46:29,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:29,515 INFO L225 Difference]: With dead ends: 656 [2022-07-11 23:46:29,515 INFO L226 Difference]: Without dead ends: 333 [2022-07-11 23:46:29,515 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 [2022-07-11 23:46:29,516 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 152 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:29,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 153 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:29,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-07-11 23:46:29,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 331. [2022-07-11 23:46:29,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 330 states have (on average 1.6303030303030304) internal successors, (538), 330 states have internal predecessors, (538), 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) [2022-07-11 23:46:29,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 538 transitions. [2022-07-11 23:46:29,523 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 538 transitions. Word has length 97 [2022-07-11 23:46:29,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:29,524 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 538 transitions. [2022-07-11 23:46:29,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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) [2022-07-11 23:46:29,524 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 538 transitions. [2022-07-11 23:46:29,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-11 23:46:29,525 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:29,525 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-11 23:46:29,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-11 23:46:29,525 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:29,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:29,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1620850381, now seen corresponding path program 1 times [2022-07-11 23:46:29,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:29,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401716726] [2022-07-11 23:46:29,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:29,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:29,565 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-11 23:46:29,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:29,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401716726] [2022-07-11 23:46:29,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401716726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:29,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:29,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:29,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14780919] [2022-07-11 23:46:29,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:29,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:29,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:29,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:29,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:29,567 INFO L87 Difference]: Start difference. First operand 331 states and 538 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) [2022-07-11 23:46:29,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:29,660 INFO L93 Difference]: Finished difference Result 689 states and 1124 transitions. [2022-07-11 23:46:29,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:29,661 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 98 [2022-07-11 23:46:29,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:29,662 INFO L225 Difference]: With dead ends: 689 [2022-07-11 23:46:29,662 INFO L226 Difference]: Without dead ends: 366 [2022-07-11 23:46:29,663 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 [2022-07-11 23:46:29,663 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 155 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:29,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 161 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:29,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-07-11 23:46:29,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 358. [2022-07-11 23:46:29,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 1.6246498599439776) internal successors, (580), 357 states have internal predecessors, (580), 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) [2022-07-11 23:46:29,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 580 transitions. [2022-07-11 23:46:29,672 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 580 transitions. Word has length 98 [2022-07-11 23:46:29,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:29,672 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 580 transitions. [2022-07-11 23:46:29,672 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) [2022-07-11 23:46:29,673 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 580 transitions. [2022-07-11 23:46:29,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-11 23:46:29,675 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:29,675 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-11 23:46:29,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-11 23:46:29,676 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:29,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:29,676 INFO L85 PathProgramCache]: Analyzing trace with hash 438851098, now seen corresponding path program 1 times [2022-07-11 23:46:29,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:29,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889676543] [2022-07-11 23:46:29,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:29,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:29,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:29,703 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-11 23:46:29,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:29,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889676543] [2022-07-11 23:46:29,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889676543] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:29,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:29,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:29,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68166763] [2022-07-11 23:46:29,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:29,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:29,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:29,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:29,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:29,706 INFO L87 Difference]: Start difference. First operand 358 states and 580 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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) [2022-07-11 23:46:29,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:29,796 INFO L93 Difference]: Finished difference Result 716 states and 1161 transitions. [2022-07-11 23:46:29,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:29,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 99 [2022-07-11 23:46:29,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:29,797 INFO L225 Difference]: With dead ends: 716 [2022-07-11 23:46:29,798 INFO L226 Difference]: Without dead ends: 366 [2022-07-11 23:46:29,798 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 [2022-07-11 23:46:29,800 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 154 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:29,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 161 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:29,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-07-11 23:46:29,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 358. [2022-07-11 23:46:29,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 1.6106442577030813) internal successors, (575), 357 states have internal predecessors, (575), 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) [2022-07-11 23:46:29,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 575 transitions. [2022-07-11 23:46:29,808 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 575 transitions. Word has length 99 [2022-07-11 23:46:29,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:29,809 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 575 transitions. [2022-07-11 23:46:29,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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) [2022-07-11 23:46:29,809 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 575 transitions. [2022-07-11 23:46:29,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-11 23:46:29,810 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:29,810 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:29,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-11 23:46:29,810 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:29,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:29,811 INFO L85 PathProgramCache]: Analyzing trace with hash -454878444, now seen corresponding path program 1 times [2022-07-11 23:46:29,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:29,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127999568] [2022-07-11 23:46:29,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:29,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:29,849 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-11 23:46:29,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:29,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127999568] [2022-07-11 23:46:29,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127999568] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:29,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:29,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:29,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136436226] [2022-07-11 23:46:29,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:29,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:29,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:29,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:29,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:29,851 INFO L87 Difference]: Start difference. First operand 358 states and 575 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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) [2022-07-11 23:46:29,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:29,947 INFO L93 Difference]: Finished difference Result 744 states and 1196 transitions. [2022-07-11 23:46:29,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:29,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 106 [2022-07-11 23:46:29,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:29,949 INFO L225 Difference]: With dead ends: 744 [2022-07-11 23:46:29,949 INFO L226 Difference]: Without dead ends: 394 [2022-07-11 23:46:29,949 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 [2022-07-11 23:46:29,950 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 146 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:29,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 155 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:29,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-07-11 23:46:29,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 392. [2022-07-11 23:46:29,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 1.60613810741688) internal successors, (628), 391 states have internal predecessors, (628), 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) [2022-07-11 23:46:29,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 628 transitions. [2022-07-11 23:46:29,958 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 628 transitions. Word has length 106 [2022-07-11 23:46:29,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:29,959 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 628 transitions. [2022-07-11 23:46:29,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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) [2022-07-11 23:46:29,959 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 628 transitions. [2022-07-11 23:46:29,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-11 23:46:29,960 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:29,960 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:29,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-11 23:46:29,960 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:29,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:29,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1573380214, now seen corresponding path program 1 times [2022-07-11 23:46:29,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:29,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601806730] [2022-07-11 23:46:29,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:29,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:29,993 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-11 23:46:29,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:29,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601806730] [2022-07-11 23:46:29,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601806730] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:29,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:29,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:29,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11901596] [2022-07-11 23:46:29,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:29,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:29,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:29,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:29,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:29,996 INFO L87 Difference]: Start difference. First operand 392 states and 628 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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) [2022-07-11 23:46:30,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:30,099 INFO L93 Difference]: Finished difference Result 778 states and 1246 transitions. [2022-07-11 23:46:30,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:30,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 107 [2022-07-11 23:46:30,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:30,101 INFO L225 Difference]: With dead ends: 778 [2022-07-11 23:46:30,101 INFO L226 Difference]: Without dead ends: 394 [2022-07-11 23:46:30,101 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 [2022-07-11 23:46:30,102 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 145 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:30,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 155 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:30,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-07-11 23:46:30,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 392. [2022-07-11 23:46:30,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 1.5984654731457801) internal successors, (625), 391 states have internal predecessors, (625), 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) [2022-07-11 23:46:30,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 625 transitions. [2022-07-11 23:46:30,110 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 625 transitions. Word has length 107 [2022-07-11 23:46:30,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:30,110 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 625 transitions. [2022-07-11 23:46:30,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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) [2022-07-11 23:46:30,111 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 625 transitions. [2022-07-11 23:46:30,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-11 23:46:30,111 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:30,112 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-11 23:46:30,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-11 23:46:30,112 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:30,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:30,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1323147388, now seen corresponding path program 1 times [2022-07-11 23:46:30,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:30,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622274322] [2022-07-11 23:46:30,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:30,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:30,134 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-11 23:46:30,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:30,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622274322] [2022-07-11 23:46:30,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622274322] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:30,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:30,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:30,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227126491] [2022-07-11 23:46:30,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:30,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:30,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:30,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:30,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:30,136 INFO L87 Difference]: Start difference. First operand 392 states and 625 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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) [2022-07-11 23:46:30,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:30,248 INFO L93 Difference]: Finished difference Result 823 states and 1312 transitions. [2022-07-11 23:46:30,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:30,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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 112 [2022-07-11 23:46:30,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:30,249 INFO L225 Difference]: With dead ends: 823 [2022-07-11 23:46:30,250 INFO L226 Difference]: Without dead ends: 439 [2022-07-11 23:46:30,251 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 [2022-07-11 23:46:30,251 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 133 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:30,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 166 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:30,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2022-07-11 23:46:30,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 434. [2022-07-11 23:46:30,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 1.5935334872979214) internal successors, (690), 433 states have internal predecessors, (690), 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) [2022-07-11 23:46:30,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 690 transitions. [2022-07-11 23:46:30,260 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 690 transitions. Word has length 112 [2022-07-11 23:46:30,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:30,260 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 690 transitions. [2022-07-11 23:46:30,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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) [2022-07-11 23:46:30,261 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 690 transitions. [2022-07-11 23:46:30,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-11 23:46:30,261 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:30,262 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-11 23:46:30,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-11 23:46:30,262 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:30,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:30,262 INFO L85 PathProgramCache]: Analyzing trace with hash -585535010, now seen corresponding path program 1 times [2022-07-11 23:46:30,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:30,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092769285] [2022-07-11 23:46:30,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:30,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:30,281 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-11 23:46:30,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:30,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092769285] [2022-07-11 23:46:30,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092769285] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:30,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:30,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:30,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619791774] [2022-07-11 23:46:30,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:30,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:30,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:30,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:30,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:30,283 INFO L87 Difference]: Start difference. First operand 434 states and 690 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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) [2022-07-11 23:46:30,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:30,389 INFO L93 Difference]: Finished difference Result 869 states and 1383 transitions. [2022-07-11 23:46:30,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:30,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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 113 [2022-07-11 23:46:30,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:30,391 INFO L225 Difference]: With dead ends: 869 [2022-07-11 23:46:30,391 INFO L226 Difference]: Without dead ends: 441 [2022-07-11 23:46:30,392 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 [2022-07-11 23:46:30,392 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 133 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:30,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 165 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:30,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2022-07-11 23:46:30,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 436. [2022-07-11 23:46:30,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 435 states have (on average 1.5931034482758621) internal successors, (693), 435 states have internal predecessors, (693), 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) [2022-07-11 23:46:30,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 693 transitions. [2022-07-11 23:46:30,401 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 693 transitions. Word has length 113 [2022-07-11 23:46:30,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:30,401 INFO L495 AbstractCegarLoop]: Abstraction has 436 states and 693 transitions. [2022-07-11 23:46:30,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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) [2022-07-11 23:46:30,401 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 693 transitions. [2022-07-11 23:46:30,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-11 23:46:30,402 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:30,402 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2022-07-11 23:46:30,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-11 23:46:30,402 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:30,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:30,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1128262344, now seen corresponding path program 1 times [2022-07-11 23:46:30,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:30,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309225895] [2022-07-11 23:46:30,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:30,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:30,421 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-07-11 23:46:30,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:30,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309225895] [2022-07-11 23:46:30,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309225895] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:30,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:30,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:30,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540126977] [2022-07-11 23:46:30,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:30,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:30,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:30,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:30,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:30,423 INFO L87 Difference]: Start difference. First operand 436 states and 693 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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) [2022-07-11 23:46:30,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:30,508 INFO L93 Difference]: Finished difference Result 902 states and 1438 transitions. [2022-07-11 23:46:30,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:30,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 124 [2022-07-11 23:46:30,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:30,510 INFO L225 Difference]: With dead ends: 902 [2022-07-11 23:46:30,510 INFO L226 Difference]: Without dead ends: 474 [2022-07-11 23:46:30,511 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 [2022-07-11 23:46:30,511 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 157 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:30,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 172 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:30,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-07-11 23:46:30,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 461. [2022-07-11 23:46:30,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 1.5826086956521739) internal successors, (728), 460 states have internal predecessors, (728), 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) [2022-07-11 23:46:30,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 728 transitions. [2022-07-11 23:46:30,521 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 728 transitions. Word has length 124 [2022-07-11 23:46:30,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:30,521 INFO L495 AbstractCegarLoop]: Abstraction has 461 states and 728 transitions. [2022-07-11 23:46:30,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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) [2022-07-11 23:46:30,521 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 728 transitions. [2022-07-11 23:46:30,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-11 23:46:30,522 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:30,522 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2022-07-11 23:46:30,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-11 23:46:30,523 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:30,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:30,523 INFO L85 PathProgramCache]: Analyzing trace with hash -370099121, now seen corresponding path program 1 times [2022-07-11 23:46:30,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:30,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122228437] [2022-07-11 23:46:30,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:30,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:30,541 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-07-11 23:46:30,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:30,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122228437] [2022-07-11 23:46:30,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122228437] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:30,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:30,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:30,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174468352] [2022-07-11 23:46:30,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:30,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:30,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:30,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:30,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:30,543 INFO L87 Difference]: Start difference. First operand 461 states and 728 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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) [2022-07-11 23:46:30,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:30,629 INFO L93 Difference]: Finished difference Result 927 states and 1465 transitions. [2022-07-11 23:46:30,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:30,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 125 [2022-07-11 23:46:30,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:30,631 INFO L225 Difference]: With dead ends: 927 [2022-07-11 23:46:30,631 INFO L226 Difference]: Without dead ends: 474 [2022-07-11 23:46:30,632 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 [2022-07-11 23:46:30,632 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 156 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:30,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 172 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:30,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-07-11 23:46:30,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 461. [2022-07-11 23:46:30,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 1.565217391304348) internal successors, (720), 460 states have internal predecessors, (720), 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) [2022-07-11 23:46:30,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 720 transitions. [2022-07-11 23:46:30,642 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 720 transitions. Word has length 125 [2022-07-11 23:46:30,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:30,643 INFO L495 AbstractCegarLoop]: Abstraction has 461 states and 720 transitions. [2022-07-11 23:46:30,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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) [2022-07-11 23:46:30,643 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 720 transitions. [2022-07-11 23:46:30,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-11 23:46:30,644 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:30,644 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-11 23:46:30,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-11 23:46:30,644 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:30,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:30,645 INFO L85 PathProgramCache]: Analyzing trace with hash -947882498, now seen corresponding path program 1 times [2022-07-11 23:46:30,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:30,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869951394] [2022-07-11 23:46:30,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:30,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:30,669 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-07-11 23:46:30,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:30,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869951394] [2022-07-11 23:46:30,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869951394] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:30,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:30,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:30,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111779229] [2022-07-11 23:46:30,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:30,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:30,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:30,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:30,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:30,672 INFO L87 Difference]: Start difference. First operand 461 states and 720 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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) [2022-07-11 23:46:30,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:30,765 INFO L93 Difference]: Finished difference Result 918 states and 1433 transitions. [2022-07-11 23:46:30,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:30,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 137 [2022-07-11 23:46:30,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:30,767 INFO L225 Difference]: With dead ends: 918 [2022-07-11 23:46:30,767 INFO L226 Difference]: Without dead ends: 465 [2022-07-11 23:46:30,768 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 [2022-07-11 23:46:30,768 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 147 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:30,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 158 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:30,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2022-07-11 23:46:30,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 461. [2022-07-11 23:46:30,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 1.5543478260869565) internal successors, (715), 460 states have internal predecessors, (715), 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) [2022-07-11 23:46:30,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 715 transitions. [2022-07-11 23:46:30,777 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 715 transitions. Word has length 137 [2022-07-11 23:46:30,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:30,778 INFO L495 AbstractCegarLoop]: Abstraction has 461 states and 715 transitions. [2022-07-11 23:46:30,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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) [2022-07-11 23:46:30,778 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 715 transitions. [2022-07-11 23:46:30,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-11 23:46:30,779 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:30,779 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-11 23:46:30,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-11 23:46:30,779 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:30,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:30,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1089840060, now seen corresponding path program 1 times [2022-07-11 23:46:30,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:30,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579705939] [2022-07-11 23:46:30,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:30,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:30,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:30,826 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-07-11 23:46:30,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:30,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579705939] [2022-07-11 23:46:30,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579705939] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:30,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:30,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:30,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843592866] [2022-07-11 23:46:30,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:30,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:30,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:30,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:30,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:30,828 INFO L87 Difference]: Start difference. First operand 461 states and 715 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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) [2022-07-11 23:46:30,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:30,921 INFO L93 Difference]: Finished difference Result 918 states and 1423 transitions. [2022-07-11 23:46:30,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:30,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 138 [2022-07-11 23:46:30,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:30,923 INFO L225 Difference]: With dead ends: 918 [2022-07-11 23:46:30,923 INFO L226 Difference]: Without dead ends: 465 [2022-07-11 23:46:30,924 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 [2022-07-11 23:46:30,925 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 145 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:30,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 159 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:30,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2022-07-11 23:46:30,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 461. [2022-07-11 23:46:30,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 1.5434782608695652) internal successors, (710), 460 states have internal predecessors, (710), 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) [2022-07-11 23:46:30,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 710 transitions. [2022-07-11 23:46:30,937 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 710 transitions. Word has length 138 [2022-07-11 23:46:30,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:30,938 INFO L495 AbstractCegarLoop]: Abstraction has 461 states and 710 transitions. [2022-07-11 23:46:30,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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) [2022-07-11 23:46:30,938 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 710 transitions. [2022-07-11 23:46:30,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-11 23:46:30,939 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:30,939 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 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] [2022-07-11 23:46:30,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-11 23:46:30,939 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:30,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:30,940 INFO L85 PathProgramCache]: Analyzing trace with hash 215230978, now seen corresponding path program 1 times [2022-07-11 23:46:30,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:30,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143552388] [2022-07-11 23:46:30,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:30,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:30,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:30,958 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-07-11 23:46:30,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:30,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143552388] [2022-07-11 23:46:30,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143552388] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:30,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:30,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:30,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981590201] [2022-07-11 23:46:30,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:30,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:30,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:30,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:30,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:30,961 INFO L87 Difference]: Start difference. First operand 461 states and 710 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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) [2022-07-11 23:46:31,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:31,044 INFO L93 Difference]: Finished difference Result 942 states and 1453 transitions. [2022-07-11 23:46:31,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:31,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 145 [2022-07-11 23:46:31,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:31,046 INFO L225 Difference]: With dead ends: 942 [2022-07-11 23:46:31,046 INFO L226 Difference]: Without dead ends: 489 [2022-07-11 23:46:31,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 [2022-07-11 23:46:31,048 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 159 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:31,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 157 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:31,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2022-07-11 23:46:31,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 485. [2022-07-11 23:46:31,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 484 states have (on average 1.53099173553719) internal successors, (741), 484 states have internal predecessors, (741), 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) [2022-07-11 23:46:31,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 741 transitions. [2022-07-11 23:46:31,064 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 741 transitions. Word has length 145 [2022-07-11 23:46:31,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:31,064 INFO L495 AbstractCegarLoop]: Abstraction has 485 states and 741 transitions. [2022-07-11 23:46:31,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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) [2022-07-11 23:46:31,064 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 741 transitions. [2022-07-11 23:46:31,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-11 23:46:31,066 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:31,066 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2022-07-11 23:46:31,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-11 23:46:31,066 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:31,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:31,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1021186181, now seen corresponding path program 1 times [2022-07-11 23:46:31,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:31,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231978041] [2022-07-11 23:46:31,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:31,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:31,089 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-07-11 23:46:31,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:31,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231978041] [2022-07-11 23:46:31,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231978041] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:31,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:31,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:31,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067299801] [2022-07-11 23:46:31,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:31,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:31,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:31,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:31,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:31,092 INFO L87 Difference]: Start difference. First operand 485 states and 741 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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) [2022-07-11 23:46:31,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:31,175 INFO L93 Difference]: Finished difference Result 966 states and 1475 transitions. [2022-07-11 23:46:31,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:31,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 146 [2022-07-11 23:46:31,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:31,177 INFO L225 Difference]: With dead ends: 966 [2022-07-11 23:46:31,177 INFO L226 Difference]: Without dead ends: 489 [2022-07-11 23:46:31,178 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 [2022-07-11 23:46:31,179 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 158 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:31,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 156 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:31,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2022-07-11 23:46:31,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 485. [2022-07-11 23:46:31,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 484 states have (on average 1.512396694214876) internal successors, (732), 484 states have internal predecessors, (732), 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) [2022-07-11 23:46:31,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 732 transitions. [2022-07-11 23:46:31,189 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 732 transitions. Word has length 146 [2022-07-11 23:46:31,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:31,190 INFO L495 AbstractCegarLoop]: Abstraction has 485 states and 732 transitions. [2022-07-11 23:46:31,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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) [2022-07-11 23:46:31,190 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 732 transitions. [2022-07-11 23:46:31,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-11 23:46:31,191 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:31,191 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2022-07-11 23:46:31,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-11 23:46:31,191 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:31,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:31,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1311037116, now seen corresponding path program 1 times [2022-07-11 23:46:31,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:31,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970339268] [2022-07-11 23:46:31,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:31,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:31,213 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-07-11 23:46:31,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:31,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970339268] [2022-07-11 23:46:31,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970339268] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:31,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:31,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:31,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209276775] [2022-07-11 23:46:31,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:31,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:31,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:31,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:31,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:31,215 INFO L87 Difference]: Start difference. First operand 485 states and 732 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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) [2022-07-11 23:46:31,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:31,316 INFO L93 Difference]: Finished difference Result 1009 states and 1518 transitions. [2022-07-11 23:46:31,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:31,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 152 [2022-07-11 23:46:31,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:31,318 INFO L225 Difference]: With dead ends: 1009 [2022-07-11 23:46:31,318 INFO L226 Difference]: Without dead ends: 532 [2022-07-11 23:46:31,319 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 [2022-07-11 23:46:31,319 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 130 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:31,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 176 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:31,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-07-11 23:46:31,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 526. [2022-07-11 23:46:31,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.499047619047619) internal successors, (787), 525 states have internal predecessors, (787), 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) [2022-07-11 23:46:31,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 787 transitions. [2022-07-11 23:46:31,330 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 787 transitions. Word has length 152 [2022-07-11 23:46:31,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:31,330 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 787 transitions. [2022-07-11 23:46:31,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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) [2022-07-11 23:46:31,330 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 787 transitions. [2022-07-11 23:46:31,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-11 23:46:31,331 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:31,331 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-11 23:46:31,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-11 23:46:31,332 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:31,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:31,332 INFO L85 PathProgramCache]: Analyzing trace with hash -102218426, now seen corresponding path program 1 times [2022-07-11 23:46:31,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:31,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600493161] [2022-07-11 23:46:31,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:31,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:31,362 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-07-11 23:46:31,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:31,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600493161] [2022-07-11 23:46:31,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600493161] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:31,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:31,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:31,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559697387] [2022-07-11 23:46:31,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:31,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:31,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:31,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:31,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:31,364 INFO L87 Difference]: Start difference. First operand 526 states and 787 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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) [2022-07-11 23:46:31,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:31,466 INFO L93 Difference]: Finished difference Result 1050 states and 1571 transitions. [2022-07-11 23:46:31,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:31,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 153 [2022-07-11 23:46:31,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:31,469 INFO L225 Difference]: With dead ends: 1050 [2022-07-11 23:46:31,469 INFO L226 Difference]: Without dead ends: 513 [2022-07-11 23:46:31,469 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 [2022-07-11 23:46:31,470 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 129 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:31,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 172 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:31,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2022-07-11 23:46:31,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 507. [2022-07-11 23:46:31,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 506 states have (on average 1.4960474308300395) internal successors, (757), 506 states have internal predecessors, (757), 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) [2022-07-11 23:46:31,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 757 transitions. [2022-07-11 23:46:31,483 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 757 transitions. Word has length 153 [2022-07-11 23:46:31,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:31,483 INFO L495 AbstractCegarLoop]: Abstraction has 507 states and 757 transitions. [2022-07-11 23:46:31,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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) [2022-07-11 23:46:31,483 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 757 transitions. [2022-07-11 23:46:31,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-11 23:46:31,484 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:31,485 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2022-07-11 23:46:31,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-11 23:46:31,485 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:31,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:31,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1626698986, now seen corresponding path program 1 times [2022-07-11 23:46:31,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:31,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079211427] [2022-07-11 23:46:31,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:31,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:31,508 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2022-07-11 23:46:31,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:31,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079211427] [2022-07-11 23:46:31,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079211427] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:31,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:31,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:31,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053349180] [2022-07-11 23:46:31,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:31,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:31,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:31,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:31,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:31,510 INFO L87 Difference]: Start difference. First operand 507 states and 757 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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) [2022-07-11 23:46:31,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:31,584 INFO L93 Difference]: Finished difference Result 1031 states and 1543 transitions. [2022-07-11 23:46:31,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:31,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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 166 [2022-07-11 23:46:31,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:31,586 INFO L225 Difference]: With dead ends: 1031 [2022-07-11 23:46:31,586 INFO L226 Difference]: Without dead ends: 532 [2022-07-11 23:46:31,587 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 [2022-07-11 23:46:31,587 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 161 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:31,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 156 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:31,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-07-11 23:46:31,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 528. [2022-07-11 23:46:31,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.4819734345351043) internal successors, (781), 527 states have internal predecessors, (781), 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) [2022-07-11 23:46:31,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 781 transitions. [2022-07-11 23:46:31,602 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 781 transitions. Word has length 166 [2022-07-11 23:46:31,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:31,602 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 781 transitions. [2022-07-11 23:46:31,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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) [2022-07-11 23:46:31,603 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 781 transitions. [2022-07-11 23:46:31,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-07-11 23:46:31,604 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:31,604 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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] [2022-07-11 23:46:31,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-11 23:46:31,604 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:31,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:31,605 INFO L85 PathProgramCache]: Analyzing trace with hash -215065955, now seen corresponding path program 1 times [2022-07-11 23:46:31,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:31,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330066021] [2022-07-11 23:46:31,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:31,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:31,630 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2022-07-11 23:46:31,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:31,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330066021] [2022-07-11 23:46:31,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330066021] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:31,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:31,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:31,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461517749] [2022-07-11 23:46:31,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:31,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:31,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:31,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:31,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:31,633 INFO L87 Difference]: Start difference. First operand 528 states and 781 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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) [2022-07-11 23:46:31,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:31,706 INFO L93 Difference]: Finished difference Result 1052 states and 1556 transitions. [2022-07-11 23:46:31,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:31,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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 167 [2022-07-11 23:46:31,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:31,708 INFO L225 Difference]: With dead ends: 1052 [2022-07-11 23:46:31,708 INFO L226 Difference]: Without dead ends: 530 [2022-07-11 23:46:31,709 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 [2022-07-11 23:46:31,710 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 160 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:31,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 156 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:31,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2022-07-11 23:46:31,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 526. [2022-07-11 23:46:31,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.460952380952381) internal successors, (767), 525 states have internal predecessors, (767), 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) [2022-07-11 23:46:31,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 767 transitions. [2022-07-11 23:46:31,721 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 767 transitions. Word has length 167 [2022-07-11 23:46:31,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:31,721 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 767 transitions. [2022-07-11 23:46:31,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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) [2022-07-11 23:46:31,722 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 767 transitions. [2022-07-11 23:46:31,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-07-11 23:46:31,723 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:31,723 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 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] [2022-07-11 23:46:31,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-11 23:46:31,723 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:31,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:31,724 INFO L85 PathProgramCache]: Analyzing trace with hash -36033930, now seen corresponding path program 1 times [2022-07-11 23:46:31,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:31,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793137492] [2022-07-11 23:46:31,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:31,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:31,757 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-11 23:46:31,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:31,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793137492] [2022-07-11 23:46:31,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793137492] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:46:31,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757929921] [2022-07-11 23:46:31,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:31,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:46:31,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:46:31,760 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) [2022-07-11 23:46:31,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-11 23:46:31,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:31,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:46:31,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:46:32,122 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2022-07-11 23:46:32,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:46:32,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757929921] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:32,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:46:32,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-11 23:46:32,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515014189] [2022-07-11 23:46:32,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:32,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:32,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:32,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:32,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:46:32,125 INFO L87 Difference]: Start difference. First operand 526 states and 767 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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) [2022-07-11 23:46:32,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:32,189 INFO L93 Difference]: Finished difference Result 1560 states and 2276 transitions. [2022-07-11 23:46:32,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:32,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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 182 [2022-07-11 23:46:32,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:32,193 INFO L225 Difference]: With dead ends: 1560 [2022-07-11 23:46:32,193 INFO L226 Difference]: Without dead ends: 1042 [2022-07-11 23:46:32,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:46:32,194 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 134 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:32,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 382 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:32,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2022-07-11 23:46:32,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1042. [2022-07-11 23:46:32,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 1041 states have (on average 1.4534101825168109) internal successors, (1513), 1041 states have internal predecessors, (1513), 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) [2022-07-11 23:46:32,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1513 transitions. [2022-07-11 23:46:32,238 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1513 transitions. Word has length 182 [2022-07-11 23:46:32,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:32,238 INFO L495 AbstractCegarLoop]: Abstraction has 1042 states and 1513 transitions. [2022-07-11 23:46:32,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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) [2022-07-11 23:46:32,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1513 transitions. [2022-07-11 23:46:32,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-07-11 23:46:32,240 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:32,240 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1] [2022-07-11 23:46:32,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-11 23:46:32,457 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,SelfDestructingSolverStorable26 [2022-07-11 23:46:32,457 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:32,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:32,457 INFO L85 PathProgramCache]: Analyzing trace with hash -148641518, now seen corresponding path program 1 times [2022-07-11 23:46:32,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:32,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350256932] [2022-07-11 23:46:32,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:32,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:32,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:32,491 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-07-11 23:46:32,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:32,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350256932] [2022-07-11 23:46:32,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350256932] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:32,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:32,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:32,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478088488] [2022-07-11 23:46:32,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:32,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:32,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:32,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:32,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:32,493 INFO L87 Difference]: Start difference. First operand 1042 states and 1513 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) [2022-07-11 23:46:32,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:32,544 INFO L93 Difference]: Finished difference Result 2586 states and 3759 transitions. [2022-07-11 23:46:32,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:32,545 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 189 [2022-07-11 23:46:32,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:32,549 INFO L225 Difference]: With dead ends: 2586 [2022-07-11 23:46:32,549 INFO L226 Difference]: Without dead ends: 1552 [2022-07-11 23:46:32,550 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 [2022-07-11 23:46:32,551 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 137 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:32,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 557 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:32,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2022-07-11 23:46:32,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1552. [2022-07-11 23:46:32,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1552 states, 1551 states have (on average 1.4500322372662797) internal successors, (2249), 1551 states have internal predecessors, (2249), 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) [2022-07-11 23:46:32,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 2249 transitions. [2022-07-11 23:46:32,594 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 2249 transitions. Word has length 189 [2022-07-11 23:46:32,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:32,594 INFO L495 AbstractCegarLoop]: Abstraction has 1552 states and 2249 transitions. [2022-07-11 23:46:32,595 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) [2022-07-11 23:46:32,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 2249 transitions. [2022-07-11 23:46:32,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-11 23:46:32,597 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:32,597 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1] [2022-07-11 23:46:32,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-11 23:46:32,598 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:32,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:32,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1610414397, now seen corresponding path program 1 times [2022-07-11 23:46:32,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:32,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739406081] [2022-07-11 23:46:32,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:32,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:32,625 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-11 23:46:32,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:32,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739406081] [2022-07-11 23:46:32,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739406081] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:32,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:32,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:32,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602890124] [2022-07-11 23:46:32,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:32,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:32,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:32,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:32,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:32,627 INFO L87 Difference]: Start difference. First operand 1552 states and 2249 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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) [2022-07-11 23:46:32,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:32,685 INFO L93 Difference]: Finished difference Result 3607 states and 5232 transitions. [2022-07-11 23:46:32,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:32,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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 190 [2022-07-11 23:46:32,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:32,690 INFO L225 Difference]: With dead ends: 3607 [2022-07-11 23:46:32,690 INFO L226 Difference]: Without dead ends: 2063 [2022-07-11 23:46:32,692 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 [2022-07-11 23:46:32,693 INFO L413 NwaCegarLoop]: 370 mSDtfsCounter, 137 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:32,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 555 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:32,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2022-07-11 23:46:32,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 2063. [2022-07-11 23:46:32,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2063 states, 2062 states have (on average 1.4481086323957324) internal successors, (2986), 2062 states have internal predecessors, (2986), 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) [2022-07-11 23:46:32,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 2063 states and 2986 transitions. [2022-07-11 23:46:32,753 INFO L78 Accepts]: Start accepts. Automaton has 2063 states and 2986 transitions. Word has length 190 [2022-07-11 23:46:32,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:32,754 INFO L495 AbstractCegarLoop]: Abstraction has 2063 states and 2986 transitions. [2022-07-11 23:46:32,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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) [2022-07-11 23:46:32,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 2986 transitions. [2022-07-11 23:46:32,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2022-07-11 23:46:32,758 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:32,758 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2022-07-11 23:46:32,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-11 23:46:32,759 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:32,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:32,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1297591734, now seen corresponding path program 1 times [2022-07-11 23:46:32,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:32,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975925509] [2022-07-11 23:46:32,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:32,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:32,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 719 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2022-07-11 23:46:32,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:32,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975925509] [2022-07-11 23:46:32,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975925509] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:32,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:32,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:32,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481804679] [2022-07-11 23:46:32,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:32,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:32,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:32,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:32,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:32,798 INFO L87 Difference]: Start difference. First operand 2063 states and 2986 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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) [2022-07-11 23:46:32,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:32,860 INFO L93 Difference]: Finished difference Result 5693 states and 8230 transitions. [2022-07-11 23:46:32,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:32,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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 339 [2022-07-11 23:46:32,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:32,870 INFO L225 Difference]: With dead ends: 5693 [2022-07-11 23:46:32,870 INFO L226 Difference]: Without dead ends: 3638 [2022-07-11 23:46:32,873 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 [2022-07-11 23:46:32,873 INFO L413 NwaCegarLoop]: 350 mSDtfsCounter, 135 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:32,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 551 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:32,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3638 states. [2022-07-11 23:46:32,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3638 to 3636. [2022-07-11 23:46:32,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3636 states, 3635 states have (on average 1.443191196698762) internal successors, (5246), 3635 states have internal predecessors, (5246), 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) [2022-07-11 23:46:32,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3636 states to 3636 states and 5246 transitions. [2022-07-11 23:46:32,985 INFO L78 Accepts]: Start accepts. Automaton has 3636 states and 5246 transitions. Word has length 339 [2022-07-11 23:46:32,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:32,985 INFO L495 AbstractCegarLoop]: Abstraction has 3636 states and 5246 transitions. [2022-07-11 23:46:32,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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) [2022-07-11 23:46:32,986 INFO L276 IsEmpty]: Start isEmpty. Operand 3636 states and 5246 transitions. [2022-07-11 23:46:32,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2022-07-11 23:46:32,992 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:32,992 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 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, 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] [2022-07-11 23:46:32,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-11 23:46:32,993 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:32,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:32,993 INFO L85 PathProgramCache]: Analyzing trace with hash 749660294, now seen corresponding path program 1 times [2022-07-11 23:46:32,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:32,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468835941] [2022-07-11 23:46:32,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:32,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:33,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 840 proven. 66 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2022-07-11 23:46:33,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:33,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468835941] [2022-07-11 23:46:33,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468835941] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:46:33,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374149031] [2022-07-11 23:46:33,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:33,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:46:33,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:46:33,056 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) [2022-07-11 23:46:33,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-11 23:46:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:33,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:46:33,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:46:33,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 466 proven. 0 refuted. 0 times theorem prover too weak. 926 trivial. 0 not checked. [2022-07-11 23:46:33,315 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:46:33,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374149031] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:33,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:46:33,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-11 23:46:33,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309729587] [2022-07-11 23:46:33,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:33,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:33,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:33,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:33,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:46:33,316 INFO L87 Difference]: Start difference. First operand 3636 states and 5246 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) [2022-07-11 23:46:33,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:33,485 INFO L93 Difference]: Finished difference Result 8269 states and 11945 transitions. [2022-07-11 23:46:33,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:33,485 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 376 [2022-07-11 23:46:33,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:33,497 INFO L225 Difference]: With dead ends: 8269 [2022-07-11 23:46:33,497 INFO L226 Difference]: Without dead ends: 4641 [2022-07-11 23:46:33,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:46:33,502 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 152 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:33,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 364 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:33,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4641 states. [2022-07-11 23:46:33,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4641 to 4641. [2022-07-11 23:46:33,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4641 states, 4640 states have (on average 1.4450431034482758) internal successors, (6705), 4640 states have internal predecessors, (6705), 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) [2022-07-11 23:46:33,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4641 states to 4641 states and 6705 transitions. [2022-07-11 23:46:33,643 INFO L78 Accepts]: Start accepts. Automaton has 4641 states and 6705 transitions. Word has length 376 [2022-07-11 23:46:33,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:33,643 INFO L495 AbstractCegarLoop]: Abstraction has 4641 states and 6705 transitions. [2022-07-11 23:46:33,643 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) [2022-07-11 23:46:33,643 INFO L276 IsEmpty]: Start isEmpty. Operand 4641 states and 6705 transitions. [2022-07-11 23:46:33,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2022-07-11 23:46:33,654 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:33,654 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 15, 15, 15, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 9, 9, 9, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-11 23:46:33,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-11 23:46:33,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-07-11 23:46:33,869 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:33,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:33,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1557445148, now seen corresponding path program 1 times [2022-07-11 23:46:33,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:33,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575938568] [2022-07-11 23:46:33,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:33,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:33,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 1707 proven. 66 refuted. 0 times theorem prover too weak. 1517 trivial. 0 not checked. [2022-07-11 23:46:33,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:33,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575938568] [2022-07-11 23:46:33,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575938568] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:46:33,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052373927] [2022-07-11 23:46:33,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:33,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:46:33,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:46:33,948 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) [2022-07-11 23:46:33,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-11 23:46:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:34,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:46:34,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:46:34,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 1718 proven. 0 refuted. 0 times theorem prover too weak. 1572 trivial. 0 not checked. [2022-07-11 23:46:34,136 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:46:34,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052373927] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:34,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:46:34,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-11 23:46:34,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375237610] [2022-07-11 23:46:34,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:34,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:34,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:34,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:34,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:46:34,139 INFO L87 Difference]: Start difference. First operand 4641 states and 6705 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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) [2022-07-11 23:46:34,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:34,286 INFO L93 Difference]: Finished difference Result 9474 states and 13718 transitions. [2022-07-11 23:46:34,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:34,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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 566 [2022-07-11 23:46:34,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:34,305 INFO L225 Difference]: With dead ends: 9474 [2022-07-11 23:46:34,306 INFO L226 Difference]: Without dead ends: 3012 [2022-07-11 23:46:34,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 567 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:46:34,311 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 11 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:34,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 321 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:34,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3012 states. [2022-07-11 23:46:34,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3012 to 3012. [2022-07-11 23:46:34,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3012 states, 3011 states have (on average 1.4224510129525074) internal successors, (4283), 3011 states have internal predecessors, (4283), 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) [2022-07-11 23:46:34,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3012 states to 3012 states and 4283 transitions. [2022-07-11 23:46:34,373 INFO L78 Accepts]: Start accepts. Automaton has 3012 states and 4283 transitions. Word has length 566 [2022-07-11 23:46:34,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:34,373 INFO L495 AbstractCegarLoop]: Abstraction has 3012 states and 4283 transitions. [2022-07-11 23:46:34,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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) [2022-07-11 23:46:34,373 INFO L276 IsEmpty]: Start isEmpty. Operand 3012 states and 4283 transitions. [2022-07-11 23:46:34,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2022-07-11 23:46:34,382 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:34,383 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 9, 9, 9, 9, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:34,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-11 23:46:34,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:46:34,601 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:34,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:34,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1280802965, now seen corresponding path program 1 times [2022-07-11 23:46:34,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:34,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938706664] [2022-07-11 23:46:34,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:34,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:34,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:34,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2022-07-11 23:46:34,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:34,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938706664] [2022-07-11 23:46:34,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938706664] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:46:34,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912014166] [2022-07-11 23:46:34,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:34,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:46:34,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:46:34,665 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) [2022-07-11 23:46:34,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-11 23:46:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:34,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 909 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 23:46:34,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:46:35,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1193 proven. 0 refuted. 0 times theorem prover too weak. 2456 trivial. 0 not checked. [2022-07-11 23:46:35,362 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:46:35,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912014166] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:35,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:46:35,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-11 23:46:35,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578242642] [2022-07-11 23:46:35,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:35,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:35,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:35,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:35,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:46:35,364 INFO L87 Difference]: Start difference. First operand 3012 states and 4283 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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) [2022-07-11 23:46:35,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:35,415 INFO L93 Difference]: Finished difference Result 3072 states and 4369 transitions. [2022-07-11 23:46:35,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:35,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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 595 [2022-07-11 23:46:35,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:35,419 INFO L225 Difference]: With dead ends: 3072 [2022-07-11 23:46:35,419 INFO L226 Difference]: Without dead ends: 2583 [2022-07-11 23:46:35,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 595 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:46:35,421 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 104 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:35,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 318 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:35,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2022-07-11 23:46:35,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 2525. [2022-07-11 23:46:35,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2525 states, 2524 states have (on average 1.4235340729001584) internal successors, (3593), 2524 states have internal predecessors, (3593), 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) [2022-07-11 23:46:35,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2525 states to 2525 states and 3593 transitions. [2022-07-11 23:46:35,475 INFO L78 Accepts]: Start accepts. Automaton has 2525 states and 3593 transitions. Word has length 595 [2022-07-11 23:46:35,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:35,475 INFO L495 AbstractCegarLoop]: Abstraction has 2525 states and 3593 transitions. [2022-07-11 23:46:35,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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) [2022-07-11 23:46:35,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2525 states and 3593 transitions. [2022-07-11 23:46:35,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2022-07-11 23:46:35,481 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:35,481 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 9, 9, 9, 9, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-11 23:46:35,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-11 23:46:35,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:46:35,698 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:35,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:35,699 INFO L85 PathProgramCache]: Analyzing trace with hash -326862807, now seen corresponding path program 1 times [2022-07-11 23:46:35,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:35,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9758230] [2022-07-11 23:46:35,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:35,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:35,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2022-07-11 23:46:35,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:35,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9758230] [2022-07-11 23:46:35,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9758230] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:46:35,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252792035] [2022-07-11 23:46:35,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:35,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:46:35,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:46:35,762 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) [2022-07-11 23:46:35,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-11 23:46:35,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:35,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 23:46:35,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:46:36,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2022-07-11 23:46:36,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:46:36,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2022-07-11 23:46:36,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252792035] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:46:36,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:46:36,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-11 23:46:36,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738494065] [2022-07-11 23:46:36,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:46:36,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:46:36,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:36,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:46:36,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:46:36,184 INFO L87 Difference]: Start difference. First operand 2525 states and 3593 transitions. Second operand has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 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) [2022-07-11 23:46:36,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:36,416 INFO L93 Difference]: Finished difference Result 5094 states and 7246 transitions. [2022-07-11 23:46:36,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:46:36,416 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 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 595 [2022-07-11 23:46:36,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:36,420 INFO L225 Difference]: With dead ends: 5094 [2022-07-11 23:46:36,420 INFO L226 Difference]: Without dead ends: 2522 [2022-07-11 23:46:36,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1196 GetRequests, 1190 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:46:36,423 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 650 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:36,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 350 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:36,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2522 states. [2022-07-11 23:46:36,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2522 to 2292. [2022-07-11 23:46:36,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2292 states, 2291 states have (on average 1.358795285901353) internal successors, (3113), 2291 states have internal predecessors, (3113), 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) [2022-07-11 23:46:36,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2292 states to 2292 states and 3113 transitions. [2022-07-11 23:46:36,478 INFO L78 Accepts]: Start accepts. Automaton has 2292 states and 3113 transitions. Word has length 595 [2022-07-11 23:46:36,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:36,479 INFO L495 AbstractCegarLoop]: Abstraction has 2292 states and 3113 transitions. [2022-07-11 23:46:36,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 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) [2022-07-11 23:46:36,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2292 states and 3113 transitions. [2022-07-11 23:46:36,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1016 [2022-07-11 23:46:36,487 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:36,488 INFO L195 NwaCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 29, 29, 28, 28, 27, 27, 26, 26, 26, 26, 22, 18, 18, 14, 14, 10, 10, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-11 23:46:36,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-11 23:46:36,710 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,SelfDestructingSolverStorable33 [2022-07-11 23:46:36,710 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:36,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:36,711 INFO L85 PathProgramCache]: Analyzing trace with hash 2092146357, now seen corresponding path program 1 times [2022-07-11 23:46:36,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:36,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302050945] [2022-07-11 23:46:36,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:36,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:36,827 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2022-07-11 23:46:36,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:36,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302050945] [2022-07-11 23:46:36,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302050945] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:46:36,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235878111] [2022-07-11 23:46:36,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:36,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:46:36,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:46:36,844 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) [2022-07-11 23:46:36,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-11 23:46:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:37,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 1476 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 23:46:37,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:46:37,123 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2022-07-11 23:46:37,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:46:37,186 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2022-07-11 23:46:37,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235878111] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:46:37,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:46:37,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-11 23:46:37,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74876838] [2022-07-11 23:46:37,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:46:37,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-11 23:46:37,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:37,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-11 23:46:37,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:46:37,189 INFO L87 Difference]: Start difference. First operand 2292 states and 3113 transitions. Second operand has 8 states, 8 states have (on average 44.0) internal successors, (352), 8 states have internal predecessors, (352), 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) [2022-07-11 23:46:37,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:37,541 INFO L93 Difference]: Finished difference Result 6930 states and 9569 transitions. [2022-07-11 23:46:37,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:46:37,542 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 44.0) internal successors, (352), 8 states have internal predecessors, (352), 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 1015 [2022-07-11 23:46:37,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:37,548 INFO L225 Difference]: With dead ends: 6930 [2022-07-11 23:46:37,548 INFO L226 Difference]: Without dead ends: 4457 [2022-07-11 23:46:37,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2038 GetRequests, 2029 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:46:37,551 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 364 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:37,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 844 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:46:37,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4457 states. [2022-07-11 23:46:37,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4457 to 2612. [2022-07-11 23:46:37,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2612 states, 2611 states have (on average 1.3780160857908847) internal successors, (3598), 2611 states have internal predecessors, (3598), 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) [2022-07-11 23:46:37,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2612 states to 2612 states and 3598 transitions. [2022-07-11 23:46:37,619 INFO L78 Accepts]: Start accepts. Automaton has 2612 states and 3598 transitions. Word has length 1015 [2022-07-11 23:46:37,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:37,619 INFO L495 AbstractCegarLoop]: Abstraction has 2612 states and 3598 transitions. [2022-07-11 23:46:37,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 44.0) internal successors, (352), 8 states have internal predecessors, (352), 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) [2022-07-11 23:46:37,620 INFO L276 IsEmpty]: Start isEmpty. Operand 2612 states and 3598 transitions. [2022-07-11 23:46:37,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1182 [2022-07-11 23:46:37,630 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:37,630 INFO L195 NwaCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 41, 41, 38, 38, 38, 34, 34, 30, 30, 26, 26, 22, 22, 22, 22, 18, 14, 14, 10, 10, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-07-11 23:46:37,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-11 23:46:37,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:46:37,847 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:37,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:37,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1735176173, now seen corresponding path program 1 times [2022-07-11 23:46:37,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:37,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523406344] [2022-07-11 23:46:37,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:37,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:37,994 INFO L134 CoverageAnalysis]: Checked inductivity of 17466 backedges. 7796 proven. 0 refuted. 0 times theorem prover too weak. 9670 trivial. 0 not checked. [2022-07-11 23:46:37,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:37,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523406344] [2022-07-11 23:46:37,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523406344] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:37,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:37,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:37,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449506125] [2022-07-11 23:46:37,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:37,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:37,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:37,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:37,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:37,997 INFO L87 Difference]: Start difference. First operand 2612 states and 3598 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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) [2022-07-11 23:46:38,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:38,107 INFO L93 Difference]: Finished difference Result 5341 states and 7353 transitions. [2022-07-11 23:46:38,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:38,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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 1181 [2022-07-11 23:46:38,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:38,111 INFO L225 Difference]: With dead ends: 5341 [2022-07-11 23:46:38,111 INFO L226 Difference]: Without dead ends: 2713 [2022-07-11 23:46:38,113 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 [2022-07-11 23:46:38,114 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 37 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:38,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 306 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:38,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2713 states. [2022-07-11 23:46:38,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2713 to 2668. [2022-07-11 23:46:38,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2668 states, 2667 states have (on average 1.3678290213723285) internal successors, (3648), 2667 states have internal predecessors, (3648), 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) [2022-07-11 23:46:38,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 3648 transitions. [2022-07-11 23:46:38,171 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 3648 transitions. Word has length 1181 [2022-07-11 23:46:38,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:38,172 INFO L495 AbstractCegarLoop]: Abstraction has 2668 states and 3648 transitions. [2022-07-11 23:46:38,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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) [2022-07-11 23:46:38,172 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 3648 transitions. [2022-07-11 23:46:38,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1197 [2022-07-11 23:46:38,182 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:38,182 INFO L195 NwaCegarLoop]: trace histogram [43, 43, 43, 43, 42, 42, 42, 42, 42, 42, 42, 42, 38, 38, 38, 34, 34, 30, 30, 26, 26, 22, 22, 22, 22, 18, 14, 14, 10, 10, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-07-11 23:46:38,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-11 23:46:38,183 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:38,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:38,183 INFO L85 PathProgramCache]: Analyzing trace with hash -483097658, now seen corresponding path program 1 times [2022-07-11 23:46:38,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:38,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521838864] [2022-07-11 23:46:38,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:38,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:38,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:38,347 INFO L134 CoverageAnalysis]: Checked inductivity of 17758 backedges. 7711 proven. 0 refuted. 0 times theorem prover too weak. 10047 trivial. 0 not checked. [2022-07-11 23:46:38,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:38,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521838864] [2022-07-11 23:46:38,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521838864] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:38,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:38,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:38,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016277214] [2022-07-11 23:46:38,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:38,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:38,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:38,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:38,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:38,351 INFO L87 Difference]: Start difference. First operand 2668 states and 3648 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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) [2022-07-11 23:46:38,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:38,442 INFO L93 Difference]: Finished difference Result 3798 states and 5179 transitions. [2022-07-11 23:46:38,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:38,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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 1196 [2022-07-11 23:46:38,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:38,443 INFO L225 Difference]: With dead ends: 3798 [2022-07-11 23:46:38,443 INFO L226 Difference]: Without dead ends: 0 [2022-07-11 23:46:38,445 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 [2022-07-11 23:46:38,446 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 145 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:38,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 168 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:38,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-11 23:46:38,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-11 23:46:38,446 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) [2022-07-11 23:46:38,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-11 23:46:38,447 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1196 [2022-07-11 23:46:38,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:38,447 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-11 23:46:38,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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) [2022-07-11 23:46:38,447 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-11 23:46:38,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-11 23:46:38,452 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-11 23:46:38,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-11 23:46:38,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-11 23:46:48,403 INFO L899 garLoopResultBuilder]: For program point L564(lines 564 570) no Hoare annotation was computed. [2022-07-11 23:46:48,403 INFO L899 garLoopResultBuilder]: For program point L531(lines 531 534) no Hoare annotation was computed. [2022-07-11 23:46:48,403 INFO L899 garLoopResultBuilder]: For program point L564-1(lines 564 570) no Hoare annotation was computed. [2022-07-11 23:46:48,403 INFO L899 garLoopResultBuilder]: For program point L399(lines 399 417) no Hoare annotation was computed. [2022-07-11 23:46:48,403 INFO L895 garLoopResultBuilder]: At program point L201(lines 197 585) the Hoare annotation is: (let ((.cse10 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (.cse17 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse18 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592))) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608))) (.cse8 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse12 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse15 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse16 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse19 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse20 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse21 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) .cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse8 .cse9 .cse11 .cse12 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse13 .cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) .cse15 .cse16 .cse19 .cse20 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse21))) [2022-07-11 23:46:48,404 INFO L895 garLoopResultBuilder]: At program point L168(lines 164 596) the Hoare annotation is: (let ((.cse1 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640))) (.cse8 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse15 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse16 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse17 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592)) (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) .cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse6 .cse7 .cse8 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse9 .cse10 .cse11 .cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) .cse13 .cse14 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse16 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse17) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse2 .cse3 .cse4 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse16 .cse17))) [2022-07-11 23:46:48,404 INFO L895 garLoopResultBuilder]: At program point L135(lines 134 606) the Hoare annotation is: (and (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592)) (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529)) (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512)) (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) [2022-07-11 23:46:48,404 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 104) no Hoare annotation was computed. [2022-07-11 23:46:48,404 INFO L899 garLoopResultBuilder]: For program point L400(lines 400 406) no Hoare annotation was computed. [2022-07-11 23:46:48,404 INFO L899 garLoopResultBuilder]: For program point L500(lines 500 504) no Hoare annotation was computed. [2022-07-11 23:46:48,404 INFO L899 garLoopResultBuilder]: For program point L500-2(lines 500 504) no Hoare annotation was computed. [2022-07-11 23:46:48,404 INFO L899 garLoopResultBuilder]: For program point L203(lines 203 583) no Hoare annotation was computed. [2022-07-11 23:46:48,404 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 594) no Hoare annotation was computed. [2022-07-11 23:46:48,404 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 605) no Hoare annotation was computed. [2022-07-11 23:46:48,404 INFO L902 garLoopResultBuilder]: At program point L633(lines 109 634) the Hoare annotation is: true [2022-07-11 23:46:48,404 INFO L899 garLoopResultBuilder]: For program point L567(lines 567 569) no Hoare annotation was computed. [2022-07-11 23:46:48,404 INFO L899 garLoopResultBuilder]: For program point L468(lines 468 470) no Hoare annotation was computed. [2022-07-11 23:46:48,404 INFO L899 garLoopResultBuilder]: For program point L270(lines 270 272) no Hoare annotation was computed. [2022-07-11 23:46:48,404 INFO L899 garLoopResultBuilder]: For program point L237(lines 237 248) no Hoare annotation was computed. [2022-07-11 23:46:48,404 INFO L899 garLoopResultBuilder]: For program point L237-2(lines 219 576) no Hoare annotation was computed. [2022-07-11 23:46:48,404 INFO L899 garLoopResultBuilder]: For program point L304(lines 304 308) no Hoare annotation was computed. [2022-07-11 23:46:48,404 INFO L899 garLoopResultBuilder]: For program point L304-2(lines 304 308) no Hoare annotation was computed. [2022-07-11 23:46:48,404 INFO L899 garLoopResultBuilder]: For program point L437-1(lines 437 445) no Hoare annotation was computed. [2022-07-11 23:46:48,404 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 242) no Hoare annotation was computed. [2022-07-11 23:46:48,404 INFO L899 garLoopResultBuilder]: For program point L206(lines 206 582) no Hoare annotation was computed. [2022-07-11 23:46:48,404 INFO L899 garLoopResultBuilder]: For program point L173(lines 173 593) no Hoare annotation was computed. [2022-07-11 23:46:48,404 INFO L899 garLoopResultBuilder]: For program point L140(lines 140 604) no Hoare annotation was computed. [2022-07-11 23:46:48,405 INFO L895 garLoopResultBuilder]: At program point L207(lines 203 583) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592))) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse10 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640))) (.cse12 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse14 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse16 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse17 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641))) (.cse18 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse19 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse20 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse21 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse22 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse23 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse24 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse25 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse23 .cse24 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse25) (and .cse0 .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25))) [2022-07-11 23:46:48,405 INFO L895 garLoopResultBuilder]: At program point L174(lines 170 594) the Hoare annotation is: (let ((.cse1 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640))) (.cse8 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse15 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse16 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse17 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592)) (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) .cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse6 .cse7 .cse8 .cse9 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse10 .cse11 .cse12 .cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) .cse14 .cse15 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse17 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse2 .cse3 .cse4 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse17))) [2022-07-11 23:46:48,405 INFO L899 garLoopResultBuilder]: For program point L638(lines 638 640) no Hoare annotation was computed. [2022-07-11 23:46:48,405 INFO L899 garLoopResultBuilder]: For program point L638-2(lines 638 640) no Hoare annotation was computed. [2022-07-11 23:46:48,405 INFO L899 garLoopResultBuilder]: For program point L539(lines 539 549) no Hoare annotation was computed. [2022-07-11 23:46:48,405 INFO L899 garLoopResultBuilder]: For program point L440(lines 440 443) no Hoare annotation was computed. [2022-07-11 23:46:48,405 INFO L899 garLoopResultBuilder]: For program point L341(lines 341 379) no Hoare annotation was computed. [2022-07-11 23:46:48,405 INFO L899 garLoopResultBuilder]: For program point L209(lines 209 581) no Hoare annotation was computed. [2022-07-11 23:46:48,405 INFO L899 garLoopResultBuilder]: For program point L176(lines 176 592) no Hoare annotation was computed. [2022-07-11 23:46:48,405 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 603) no Hoare annotation was computed. [2022-07-11 23:46:48,405 INFO L895 garLoopResultBuilder]: At program point L110-2(lines 110 632) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2)) (.cse2 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641))) (.cse8 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse9 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481)) .cse0 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529)) .cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and .cse2 .cse3 .cse4 .cse0 .cse5 .cse6 .cse7 .cse8 .cse9) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3) (and .cse2 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 4) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448) (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse1))) [2022-07-11 23:46:48,405 INFO L895 garLoopResultBuilder]: At program point L408(lines 399 417) the Hoare annotation is: (let ((.cse1 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640))) (.cse8 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse15 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse16 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse17 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592)) (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) .cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse6 .cse7 .cse8 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse9 .cse10 .cse11 .cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) .cse13 .cse14 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse16 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse17) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse2 .cse3 .cse4 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse16 .cse17))) [2022-07-11 23:46:48,405 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 246) no Hoare annotation was computed. [2022-07-11 23:46:48,406 INFO L895 garLoopResultBuilder]: At program point L177(lines 176 592) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse3 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse11 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse14 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576))) (or (and (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592)) (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609)) .cse0 .cse1 .cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) .cse4 .cse5 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641)) .cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) .cse8 .cse9 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse10 (not .cse11) .cse12) (and (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2) .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse3 .cse4 .cse5 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse6 .cse7 .cse8 .cse11 .cse9 .cse10 .cse12) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse13 .cse14 .cse15))) [2022-07-11 23:46:48,406 INFO L895 garLoopResultBuilder]: At program point L144(lines 137 605) the Hoare annotation is: (let ((.cse12 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse14 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse2 .cse3 .cse4 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse13 .cse14) (and (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592)) (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse0 .cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609)) .cse2 .cse3 .cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) .cse6 .cse7 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641)) .cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) .cse10 .cse11 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse13 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse14))) [2022-07-11 23:46:48,406 INFO L899 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2022-07-11 23:46:48,406 INFO L899 garLoopResultBuilder]: For program point L542(lines 542 548) no Hoare annotation was computed. [2022-07-11 23:46:48,406 INFO L899 garLoopResultBuilder]: For program point L344(lines 344 378) no Hoare annotation was computed. [2022-07-11 23:46:48,406 INFO L899 garLoopResultBuilder]: For program point L344-1(lines 344 378) no Hoare annotation was computed. [2022-07-11 23:46:48,406 INFO L899 garLoopResultBuilder]: For program point L212(lines 212 580) no Hoare annotation was computed. [2022-07-11 23:46:48,406 INFO L899 garLoopResultBuilder]: For program point L179(lines 179 591) no Hoare annotation was computed. [2022-07-11 23:46:48,406 INFO L899 garLoopResultBuilder]: For program point L146(lines 146 602) no Hoare annotation was computed. [2022-07-11 23:46:48,406 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 613) no Hoare annotation was computed. [2022-07-11 23:46:48,406 INFO L899 garLoopResultBuilder]: For program point L510(lines 510 513) no Hoare annotation was computed. [2022-07-11 23:46:48,406 INFO L899 garLoopResultBuilder]: For program point L477(lines 477 479) no Hoare annotation was computed. [2022-07-11 23:46:48,406 INFO L899 garLoopResultBuilder]: For program point L411(lines 411 413) no Hoare annotation was computed. [2022-07-11 23:46:48,406 INFO L899 garLoopResultBuilder]: For program point L345(lines 345 375) no Hoare annotation was computed. [2022-07-11 23:46:48,406 INFO L895 garLoopResultBuilder]: At program point L213(lines 209 581) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592))) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608))) (.cse9 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640))) (.cse11 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse12 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse14 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse16 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641))) (.cse17 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse18 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse19 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse20 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse24 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse25 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse21 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse22 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse23 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse23) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse24 .cse25 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse24 .cse25 .cse21 .cse22 .cse23))) [2022-07-11 23:46:48,406 INFO L895 garLoopResultBuilder]: At program point L114(lines 113 613) the Hoare annotation is: (and (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592)) (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529)) (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512)) (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) [2022-07-11 23:46:48,406 INFO L902 garLoopResultBuilder]: At program point L643(lines 22 645) the Hoare annotation is: true [2022-07-11 23:46:48,407 INFO L895 garLoopResultBuilder]: At program point L577(lines 110 632) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2)) (.cse2 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641))) (.cse8 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse9 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481)) .cse0 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529)) .cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and .cse2 .cse3 .cse4 .cse0 .cse5 .cse6 .cse7 .cse8 .cse9) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3) (and .cse2 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 4) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448) (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse1))) [2022-07-11 23:46:48,407 INFO L899 garLoopResultBuilder]: For program point L545(lines 545 547) no Hoare annotation was computed. [2022-07-11 23:46:48,407 INFO L899 garLoopResultBuilder]: For program point L545-2(lines 219 576) no Hoare annotation was computed. [2022-07-11 23:46:48,407 INFO L899 garLoopResultBuilder]: For program point L215(lines 215 579) no Hoare annotation was computed. [2022-07-11 23:46:48,407 INFO L899 garLoopResultBuilder]: For program point L182(lines 182 590) no Hoare annotation was computed. [2022-07-11 23:46:48,407 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 601) no Hoare annotation was computed. [2022-07-11 23:46:48,407 INFO L899 garLoopResultBuilder]: For program point L116(lines 116 612) no Hoare annotation was computed. [2022-07-11 23:46:48,407 INFO L899 garLoopResultBuilder]: For program point L315(lines 315 322) no Hoare annotation was computed. [2022-07-11 23:46:48,407 INFO L899 garLoopResultBuilder]: For program point L315-2(lines 315 322) no Hoare annotation was computed. [2022-07-11 23:46:48,407 INFO L895 garLoopResultBuilder]: At program point L216(lines 215 579) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) [2022-07-11 23:46:48,407 INFO L895 garLoopResultBuilder]: At program point L183(lines 179 591) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592))) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse9 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640))) (.cse11 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse12 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse14 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641))) (.cse16 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse17 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse18 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse19 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse20 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse21 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse22 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse23 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse24 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) .cse17 .cse18 .cse21 .cse22 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse23) (and .cse0 .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24))) [2022-07-11 23:46:48,407 INFO L895 garLoopResultBuilder]: At program point L150(lines 146 602) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592))) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640))) (.cse12 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse14 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse16 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641))) (.cse17 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse18 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse19 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse20 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse21 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse22 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse23 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse24 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and .cse0 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse24) (and .cse0 .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse22 .cse23 .cse24))) [2022-07-11 23:46:48,407 INFO L899 garLoopResultBuilder]: For program point L614(lines 614 630) no Hoare annotation was computed. [2022-07-11 23:46:48,407 INFO L899 garLoopResultBuilder]: For program point L515(lines 515 525) no Hoare annotation was computed. [2022-07-11 23:46:48,407 INFO L899 garLoopResultBuilder]: For program point L350(lines 350 373) no Hoare annotation was computed. [2022-07-11 23:46:48,407 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-11 23:46:48,407 INFO L895 garLoopResultBuilder]: At program point L218(lines 217 579) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) [2022-07-11 23:46:48,407 INFO L899 garLoopResultBuilder]: For program point L185(lines 185 589) no Hoare annotation was computed. [2022-07-11 23:46:48,408 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 600) no Hoare annotation was computed. [2022-07-11 23:46:48,408 INFO L899 garLoopResultBuilder]: For program point L119(lines 119 611) no Hoare annotation was computed. [2022-07-11 23:46:48,408 INFO L899 garLoopResultBuilder]: For program point L615(lines 615 629) no Hoare annotation was computed. [2022-07-11 23:46:48,408 INFO L899 garLoopResultBuilder]: For program point L285(lines 285 287) no Hoare annotation was computed. [2022-07-11 23:46:48,408 INFO L899 garLoopResultBuilder]: For program point L285-2(lines 219 576) no Hoare annotation was computed. [2022-07-11 23:46:48,408 INFO L899 garLoopResultBuilder]: For program point L616(lines 616 621) no Hoare annotation was computed. [2022-07-11 23:46:48,408 INFO L899 garLoopResultBuilder]: For program point L616-2(lines 615 629) no Hoare annotation was computed. [2022-07-11 23:46:48,408 INFO L899 garLoopResultBuilder]: For program point L451(lines 451 453) no Hoare annotation was computed. [2022-07-11 23:46:48,408 INFO L899 garLoopResultBuilder]: For program point L319(lines 319 321) no Hoare annotation was computed. [2022-07-11 23:46:48,408 INFO L899 garLoopResultBuilder]: For program point L518(lines 518 524) no Hoare annotation was computed. [2022-07-11 23:46:48,408 INFO L899 garLoopResultBuilder]: For program point L353(lines 353 357) no Hoare annotation was computed. [2022-07-11 23:46:48,408 INFO L899 garLoopResultBuilder]: For program point L353-2(lines 353 357) no Hoare annotation was computed. [2022-07-11 23:46:48,408 INFO L899 garLoopResultBuilder]: For program point L254(lines 254 264) no Hoare annotation was computed. [2022-07-11 23:46:48,408 INFO L899 garLoopResultBuilder]: For program point L188(lines 188 588) no Hoare annotation was computed. [2022-07-11 23:46:48,408 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 599) no Hoare annotation was computed. [2022-07-11 23:46:48,408 INFO L899 garLoopResultBuilder]: For program point L122(lines 122 610) no Hoare annotation was computed. [2022-07-11 23:46:48,408 INFO L899 garLoopResultBuilder]: For program point L618(lines 618 620) no Hoare annotation was computed. [2022-07-11 23:46:48,408 INFO L899 garLoopResultBuilder]: For program point L486(lines 486 496) no Hoare annotation was computed. [2022-07-11 23:46:48,408 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 419) no Hoare annotation was computed. [2022-07-11 23:46:48,408 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 258) no Hoare annotation was computed. [2022-07-11 23:46:48,408 INFO L895 garLoopResultBuilder]: At program point L222(lines 116 612) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592))) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608))) (.cse10 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2)) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse12 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640))) (.cse14 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse16 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse17 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse18 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse19 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641))) (.cse20 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse21 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse22 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse23 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse27 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse24 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse25 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse26 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and .cse0 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse26) (and .cse0 .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse27 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse27 .cse24 .cse25 .cse26))) [2022-07-11 23:46:48,409 INFO L895 garLoopResultBuilder]: At program point L189(lines 185 589) the Hoare annotation is: (let ((.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640))) (.cse9 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse20 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (.cse10 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse12 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641))) (.cse15 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse16 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse17 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse21 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse22 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse18 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse19 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) .cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) .cse16 .cse17 .cse18 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2) .cse7 .cse8 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse21 .cse22 .cse18 .cse19) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse21 .cse22 .cse18 .cse19))) [2022-07-11 23:46:48,409 INFO L895 garLoopResultBuilder]: At program point L156(lines 152 600) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592))) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse10 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640))) (.cse12 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse14 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse16 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641))) (.cse17 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse18 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse19 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse20 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse21 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse22 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and .cse0 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) .cse18 .cse19 .cse21 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse22) (and .cse0 .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse21 .cse22))) [2022-07-11 23:46:48,412 INFO L899 garLoopResultBuilder]: For program point L454(lines 454 463) no Hoare annotation was computed. [2022-07-11 23:46:48,412 INFO L899 garLoopResultBuilder]: For program point L388(lines 388 394) no Hoare annotation was computed. [2022-07-11 23:46:48,412 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-11 23:46:48,412 INFO L899 garLoopResultBuilder]: For program point L554(lines 554 558) no Hoare annotation was computed. [2022-07-11 23:46:48,412 INFO L899 garLoopResultBuilder]: For program point L521(lines 521 523) no Hoare annotation was computed. [2022-07-11 23:46:48,412 INFO L899 garLoopResultBuilder]: For program point L554-2(lines 554 558) no Hoare annotation was computed. [2022-07-11 23:46:48,413 INFO L899 garLoopResultBuilder]: For program point L521-2(lines 219 576) no Hoare annotation was computed. [2022-07-11 23:46:48,415 INFO L899 garLoopResultBuilder]: For program point L191(lines 191 587) no Hoare annotation was computed. [2022-07-11 23:46:48,415 INFO L899 garLoopResultBuilder]: For program point L158(lines 158 598) no Hoare annotation was computed. [2022-07-11 23:46:48,415 INFO L899 garLoopResultBuilder]: For program point L125(lines 125 609) no Hoare annotation was computed. [2022-07-11 23:46:48,415 INFO L899 garLoopResultBuilder]: For program point L489(lines 489 495) no Hoare annotation was computed. [2022-07-11 23:46:48,416 INFO L899 garLoopResultBuilder]: For program point L489-2(lines 219 576) no Hoare annotation was computed. [2022-07-11 23:46:48,416 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 99) no Hoare annotation was computed. [2022-07-11 23:46:48,416 INFO L902 garLoopResultBuilder]: At program point L655(lines 646 657) the Hoare annotation is: true [2022-07-11 23:46:48,416 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-11 23:46:48,416 INFO L899 garLoopResultBuilder]: For program point L623(lines 623 627) no Hoare annotation was computed. [2022-07-11 23:46:48,416 INFO L899 garLoopResultBuilder]: For program point L458(lines 458 460) no Hoare annotation was computed. [2022-07-11 23:46:48,416 INFO L899 garLoopResultBuilder]: For program point L227(lines 227 229) no Hoare annotation was computed. [2022-07-11 23:46:48,416 INFO L899 garLoopResultBuilder]: For program point L194(lines 194 586) no Hoare annotation was computed. [2022-07-11 23:46:48,417 INFO L899 garLoopResultBuilder]: For program point L161(lines 161 597) no Hoare annotation was computed. [2022-07-11 23:46:48,417 INFO L899 garLoopResultBuilder]: For program point L227-2(lines 227 229) no Hoare annotation was computed. [2022-07-11 23:46:48,417 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 608) no Hoare annotation was computed. [2022-07-11 23:46:48,417 INFO L899 garLoopResultBuilder]: For program point L492(lines 492 494) no Hoare annotation was computed. [2022-07-11 23:46:48,417 INFO L895 garLoopResultBuilder]: At program point L195(lines 191 587) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592))) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640))) (.cse8 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (.cse10 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse12 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641))) (.cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse15 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse16 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse17 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse18 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse19 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse20 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse21 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse6 .cse7 .cse8 .cse10 .cse11 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse12 .cse13 .cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) .cse15 .cse16 .cse19 .cse20 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2022-07-11 23:46:48,417 INFO L895 garLoopResultBuilder]: At program point L162(lines 158 598) the Hoare annotation is: (let ((.cse3 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592))) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse10 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640))) (.cse12 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse14 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse16 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641))) (.cse17 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse21 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse18 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse19 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse20 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse14 .cse15 .cse16 .cse17 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) .cse18 .cse19 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse21 .cse18 .cse19 .cse20 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and .cse0 .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse4 .cse5 .cse6 .cse7 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse21 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse18 .cse19 .cse20))) [2022-07-11 23:46:48,418 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 98) no Hoare annotation was computed. [2022-07-11 23:46:48,418 INFO L899 garLoopResultBuilder]: For program point L96-2(lines 93 99) no Hoare annotation was computed. [2022-07-11 23:46:48,418 INFO L895 garLoopResultBuilder]: At program point L493(lines 83 644) the Hoare annotation is: false [2022-07-11 23:46:48,418 INFO L899 garLoopResultBuilder]: For program point L361(lines 361 369) no Hoare annotation was computed. [2022-07-11 23:46:48,418 INFO L895 garLoopResultBuilder]: At program point L362(lines 338 380) the Hoare annotation is: (let ((.cse3 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592))) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse10 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640))) (.cse12 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse14 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse16 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641))) (.cse17 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse21 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse18 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse19 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse20 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse14 .cse15 .cse16 .cse17 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) .cse18 .cse19 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse21 .cse18 .cse19 .cse20 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and .cse0 .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse4 .cse5 .cse6 .cse7 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse21 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse18 .cse19 .cse20))) [2022-07-11 23:46:48,418 INFO L899 garLoopResultBuilder]: For program point L197(lines 197 585) no Hoare annotation was computed. [2022-07-11 23:46:48,419 INFO L899 garLoopResultBuilder]: For program point L164(lines 164 596) no Hoare annotation was computed. [2022-07-11 23:46:48,419 INFO L899 garLoopResultBuilder]: For program point L131(lines 131 607) no Hoare annotation was computed. [2022-07-11 23:46:48,419 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-11 23:46:48,419 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 642) no Hoare annotation was computed. [2022-07-11 23:46:48,419 INFO L899 garLoopResultBuilder]: For program point L429(lines 429 431) no Hoare annotation was computed. [2022-07-11 23:46:48,419 INFO L895 garLoopResultBuilder]: At program point L396(lines 387 419) the Hoare annotation is: (let ((.cse1 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640))) (.cse8 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse15 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse16 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse17 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592)) (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) .cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse6 .cse7 .cse8 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse9 .cse10 .cse11 .cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) .cse13 .cse14 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse16 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse17) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse2 .cse3 .cse4 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse16 .cse17))) [2022-07-11 23:46:48,420 INFO L895 garLoopResultBuilder]: At program point L132(lines 128 608) the Hoare annotation is: (let ((.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse4 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640))) (.cse8 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse14 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse16 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse17 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592)) (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse0 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse1 .cse2 .cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) .cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse6 .cse7 .cse8 .cse9 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse10 .cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) .cse12 .cse13 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse16 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse17) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2022-07-11 23:46:48,420 INFO L899 garLoopResultBuilder]: For program point L364(lines 364 366) no Hoare annotation was computed. [2022-07-11 23:46:48,420 INFO L899 garLoopResultBuilder]: For program point L298(lines 298 300) no Hoare annotation was computed. [2022-07-11 23:46:48,420 INFO L899 garLoopResultBuilder]: For program point L232(lines 232 234) no Hoare annotation was computed. [2022-07-11 23:46:48,420 INFO L899 garLoopResultBuilder]: For program point L298-2(lines 219 576) no Hoare annotation was computed. [2022-07-11 23:46:48,420 INFO L899 garLoopResultBuilder]: For program point L332(lines 332 336) no Hoare annotation was computed. [2022-07-11 23:46:48,420 INFO L899 garLoopResultBuilder]: For program point L332-2(lines 219 576) no Hoare annotation was computed. [2022-07-11 23:46:48,420 INFO L899 garLoopResultBuilder]: For program point L200(lines 200 584) no Hoare annotation was computed. [2022-07-11 23:46:48,420 INFO L899 garLoopResultBuilder]: For program point L167(lines 167 595) no Hoare annotation was computed. [2022-07-11 23:46:48,421 INFO L899 garLoopResultBuilder]: For program point L134(lines 134 606) no Hoare annotation was computed. [2022-07-11 23:46:48,421 INFO L899 garLoopResultBuilder]: For program point L101(lines 101 105) no Hoare annotation was computed. [2022-07-11 23:46:48,421 INFO L899 garLoopResultBuilder]: For program point L101-1(lines 83 644) no Hoare annotation was computed. [2022-07-11 23:46:48,423 INFO L356 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:48,426 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-11 23:46:48,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 11:46:48 BoogieIcfgContainer [2022-07-11 23:46:48,481 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-11 23:46:48,482 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-11 23:46:48,482 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-11 23:46:48,482 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-11 23:46:48,482 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:46:27" (3/4) ... [2022-07-11 23:46:48,484 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-11 23:46:48,500 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-11 23:46:48,501 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-11 23:46:48,501 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-11 23:46:48,501 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-11 23:46:48,576 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-11 23:46:48,576 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-11 23:46:48,579 INFO L158 Benchmark]: Toolchain (without parser) took 21898.71ms. Allocated memory was 115.3MB in the beginning and 494.9MB in the end (delta: 379.6MB). Free memory was 87.2MB in the beginning and 210.8MB in the end (delta: -123.5MB). Peak memory consumption was 255.5MB. Max. memory is 16.1GB. [2022-07-11 23:46:48,582 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 115.3MB. Free memory is still 69.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 23:46:48,583 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.12ms. Allocated memory is still 115.3MB. Free memory was 87.1MB in the beginning and 84.7MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-11 23:46:48,583 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.82ms. Allocated memory is still 115.3MB. Free memory was 84.7MB in the beginning and 81.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-11 23:46:48,583 INFO L158 Benchmark]: Boogie Preprocessor took 23.99ms. Allocated memory is still 115.3MB. Free memory was 81.8MB in the beginning and 79.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-11 23:46:48,584 INFO L158 Benchmark]: RCFGBuilder took 565.76ms. Allocated memory was 115.3MB in the beginning and 157.3MB in the end (delta: 41.9MB). Free memory was 79.7MB in the beginning and 122.5MB in the end (delta: -42.8MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. [2022-07-11 23:46:48,584 INFO L158 Benchmark]: TraceAbstraction took 20897.89ms. Allocated memory was 157.3MB in the beginning and 494.9MB in the end (delta: 337.6MB). Free memory was 121.9MB in the beginning and 219.3MB in the end (delta: -97.4MB). Peak memory consumption was 317.5MB. Max. memory is 16.1GB. [2022-07-11 23:46:48,584 INFO L158 Benchmark]: Witness Printer took 94.54ms. Allocated memory is still 494.9MB. Free memory was 219.3MB in the beginning and 210.8MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-11 23:46:48,585 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.17ms. Allocated memory is still 115.3MB. Free memory is still 69.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.12ms. Allocated memory is still 115.3MB. Free memory was 87.1MB in the beginning and 84.7MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.82ms. Allocated memory is still 115.3MB. Free memory was 84.7MB in the beginning and 81.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.99ms. Allocated memory is still 115.3MB. Free memory was 81.8MB in the beginning and 79.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 565.76ms. Allocated memory was 115.3MB in the beginning and 157.3MB in the end (delta: 41.9MB). Free memory was 79.7MB in the beginning and 122.5MB in the end (delta: -42.8MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. * TraceAbstraction took 20897.89ms. Allocated memory was 157.3MB in the beginning and 494.9MB in the end (delta: 337.6MB). Free memory was 121.9MB in the beginning and 219.3MB in the end (delta: -97.4MB). Peak memory consumption was 317.5MB. Max. memory is 16.1GB. * Witness Printer took 94.54ms. Allocated memory is still 494.9MB. Free memory was 219.3MB in the beginning and 210.8MB in the end (delta: 8.5MB). 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: 642]: 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, 147 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.8s, OverallIterations: 37, TraceHistogramMax: 43, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5970 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5970 mSDsluCounter, 8923 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2369 mSDsCounter, 1400 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3543 IncrementalHoareTripleChecker+Invalid, 4943 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1400 mSolverCounterUnsat, 6554 mSDtfsCounter, 3543 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5060 GetRequests, 5002 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4641occurred in iteration=31, InterpolantAutomatonStates: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 37 MinimizatonAttempts, 2300 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 333 NumberOfFragments, 5683 HoareAnnotationTreeSize, 28 FomulaSimplifications, 12632 FormulaSimplificationTreeSizeReduction, 2.9s HoareSimplificationTime, 28 FomulaSimplificationsInter, 74718 FormulaSimplificationTreeSizeReductionInter, 7.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 12600 NumberOfCodeBlocks, 12600 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 14165 ConstructedInterpolants, 0 QuantifiedInterpolants, 19724 SizeOfPredicates, 2 NumberOfNonLiveVariables, 5160 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 45 InterpolantComputations, 35 PerfectInterpolantSequences, 103043/103383 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: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 646]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8608)) && blastFlag <= 2) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576) || (((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 7) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8593 == s__state)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state))) || (((((((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8608)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8512)) && !(8560 == s__state)) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(s__state == 8592) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: !(s__state == 8640) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(s__state == 8592) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8608)) && blastFlag <= 2) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state)) || (((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 7) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8593 == s__state)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((((((((((((((((((!(s__state == 8592) && !(8673 == s__state)) && 3 == blastFlag) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state)) - InvariantResult [Line: 399]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8608)) && blastFlag <= 2) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576) || (((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 7) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8593 == s__state)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state))) || (((((((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8608)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8512)) && !(8560 == s__state)) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(s__state == 8592) && 3 == blastFlag) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(8577 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state)) || (((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 7) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8593 == s__state)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((((((((((((((!(s__state == 8592) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag <= 2) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(8577 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state)) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: (((((((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag <= 2) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576) || ((((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8512)) && !(8560 == s__state))) || (((((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 7) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8593 == s__state)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state)) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: !(s__state == 8640) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag <= 2) && !(8497 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8529)) && 8448 <= s__state) && s__state <= 8576) || ((((((((!(8673 == s__state) && !(s__state == 8609)) && !(s__state == 8657)) && blastFlag <= 2) && !(8577 == s__state)) && !(12292 == s__state)) && !(s__state == 8641)) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state))) || s__state <= 3) || ((((((((!(8673 == s__state) && 3 == blastFlag) && !(s__state == 8609)) && !(s__state == 8657)) && !(8577 == s__state)) && !(12292 == s__state)) && !(s__state == 8641)) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state))) || (blastFlag <= 7 && !(0 == s__hit))) || (((blastFlag == 4 && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 8448 <= s__state) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((!(s__state == 8592) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && blastFlag <= 2) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576) || ((((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 7) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8593 == s__state)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state))) || (((((((((((((((((((((((((((!(s__state == 8592) && !(8673 == s__state)) && 3 == blastFlag) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state))) || (((((((((((((((((((((((((((!(s__state == 8592) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && blastFlag <= 2) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state)) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 7) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8593 == s__state)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 7) && !(8673 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8593 == s__state)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state)) || (((blastFlag <= 2 && s__state <= 8448) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((((((((((((((!(s__state == 8561) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && 3 == s__s3__tmp__next_state___0) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8528)) && 0 == s__hit) && !(s__state == 8529)) && !(s__state == 8512)) && !(8560 == s__state))) || (((3 == blastFlag && s__state <= 8448) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((blastFlag <= 7 && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state)) || (((((((((((((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8608)) && blastFlag <= 2) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8512)) && !(8560 == s__state))) || (((((((((((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8608)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8512)) && !(8560 == s__state)) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8608)) && blastFlag <= 2) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576) || (((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 7) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8593 == s__state)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state))) || (((((((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8608)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8512)) && !(8560 == s__state)) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 7) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8593 == s__state)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state)) || ((((((((((((((((((((((((((!(s__state == 8592) && 3 == blastFlag) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state))) || ((((((((((((((((((((((((((!(s__state == 8592) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && blastFlag <= 2) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state)) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(8448 == s__state) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && s__state < 8576) && !(s__state == 8608)) && blastFlag <= 2) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8512)) && !(8560 == s__state)) || (((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 7) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8593 == s__state)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && s__state < 8576) && !(s__state == 8608)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8512)) && !(8560 == s__state)) - InvariantResult [Line: 338]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 7) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8593 == s__state)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state)) || (((((((((((((((((((((((!(s__state == 8592) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8608)) && blastFlag <= 2) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && 8448 <= s__state) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576)) || (((((((((((((((((((((((!(s__state == 8592) && !(8673 == s__state)) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state)) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8592) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8608)) && blastFlag <= 2) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && !(8593 == s__state)) && !(8560 == s__state)) && s__state <= 8576) || (((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 7) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8593 == s__state)) && !(0 == s__hit)) && !(8560 == s__state))) || (((((((((((((((((((((((((!(s__state == 8592) && !(8673 == s__state)) && 3 == blastFlag) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state)) && !(8560 == s__state)) - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8608)) && blastFlag <= 2) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && !(s__state == 8512)) && s__state <= 8576) || (((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 7) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8593 == s__state)) && !(s__state == 8512)) && !(0 == s__hit))) || (((((((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8609)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8608)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8512)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(s__state == 8592) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8608)) && blastFlag <= 2) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576) || (((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 7) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8593 == s__state)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state))) || (((((((((((((((((((((((((!(s__state == 8592) && !(8673 == s__state)) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(s__state == 8592) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && blastFlag <= 2) && !(s__state == 8672)) && !(s__state == 8640)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576) || (((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 7) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8640)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8593 == s__state)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state))) || (((((((((((((((((((((((((((!(s__state == 8592) && !(8673 == s__state)) && 3 == blastFlag) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8640)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state)) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(s__state == 8592) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8608)) && blastFlag <= 2) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(8577 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state)) || ((((((((((((((((((((((!(s__state == 8592) && 3 == blastFlag) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8608)) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(8577 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state))) || (((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 7) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8593 == s__state)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state)) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag <= 2) && !(8497 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8529)) && 8448 <= s__state) && s__state <= 8576) || ((((((((!(8673 == s__state) && !(s__state == 8609)) && !(s__state == 8657)) && blastFlag <= 2) && !(8577 == s__state)) && !(12292 == s__state)) && !(s__state == 8641)) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state))) || s__state <= 3) || ((((((((!(8673 == s__state) && 3 == blastFlag) && !(s__state == 8609)) && !(s__state == 8657)) && !(8577 == s__state)) && !(12292 == s__state)) && !(s__state == 8641)) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state))) || (blastFlag <= 7 && !(0 == s__hit))) || (((blastFlag == 4 && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 8448 <= s__state) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 7) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8593 == s__state)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state)) || (((((((((((((((((((((((!(s__state == 8592) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8608)) && blastFlag <= 2) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && 8448 <= s__state) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576)) || (((((((((((((((((((((((!(s__state == 8592) && !(8673 == s__state)) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state)) RESULT: Ultimate proved your program to be correct! [2022-07-11 23:46:48,627 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