/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/s3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 11:50:29,298 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 11:50:29,300 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 11:50:29,326 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 11:50:29,326 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 11:50:29,327 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 11:50:29,328 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 11:50:29,329 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 11:50:29,330 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 11:50:29,330 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 11:50:29,331 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 11:50:29,332 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 11:50:29,332 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 11:50:29,337 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 11:50:29,338 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 11:50:29,338 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 11:50:29,339 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 11:50:29,339 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 11:50:29,340 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 11:50:29,350 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 11:50:29,351 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 11:50:29,353 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 11:50:29,354 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 11:50:29,354 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 11:50:29,356 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 11:50:29,356 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 11:50:29,356 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 11:50:29,357 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 11:50:29,357 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 11:50:29,358 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 11:50:29,358 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 11:50:29,359 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 11:50:29,359 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 11:50:29,360 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 11:50:29,360 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 11:50:29,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 11:50:29,361 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 11:50:29,361 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 11:50:29,361 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 11:50:29,362 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 11:50:29,363 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 11:50:29,363 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2021-05-02 11:50:29,387 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 11:50:29,387 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 11:50:29,388 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-05-02 11:50:29,388 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-05-02 11:50:29,388 INFO L138 SettingsManager]: * Use SBE=true [2021-05-02 11:50:29,388 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 11:50:29,388 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 11:50:29,389 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 11:50:29,389 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 11:50:29,389 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 11:50:29,389 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 11:50:29,389 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 11:50:29,389 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 11:50:29,389 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 11:50:29,389 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 11:50:29,390 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 11:50:29,390 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 11:50:29,390 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 11:50:29,390 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 11:50:29,390 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 11:50:29,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 11:50:29,390 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 11:50:29,391 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-05-02 11:50:29,391 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-05-02 11:50:29,391 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-02 11:50:29,391 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-05-02 11:50:29,391 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 11:50:29,391 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-05-02 11:50:29,391 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-02 11:50:29,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 11:50:29,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 11:50:29,621 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 11:50:29,622 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 11:50:29,623 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 11:50:29,623 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/s3.i [2021-05-02 11:50:29,695 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3790e5ab/3739d654cc0646ccb1c92e79856b1411/FLAG08eaea09b [2021-05-02 11:50:30,126 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 11:50:30,127 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/s3.i [2021-05-02 11:50:30,137 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3790e5ab/3739d654cc0646ccb1c92e79856b1411/FLAG08eaea09b [2021-05-02 11:50:30,146 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3790e5ab/3739d654cc0646ccb1c92e79856b1411 [2021-05-02 11:50:30,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 11:50:30,149 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 11:50:30,150 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 11:50:30,150 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 11:50:30,152 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 11:50:30,153 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:50:30" (1/1) ... [2021-05-02 11:50:30,154 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@708717b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:50:30, skipping insertion in model container [2021-05-02 11:50:30,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:50:30" (1/1) ... [2021-05-02 11:50:30,158 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 11:50:30,189 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 11:50:30,469 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/s3.i[63567,63580] [2021-05-02 11:50:30,483 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 11:50:30,497 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 11:50:30,565 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/s3.i[63567,63580] [2021-05-02 11:50:30,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 11:50:30,578 INFO L208 MainTranslator]: Completed translation [2021-05-02 11:50:30,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:50:30 WrapperNode [2021-05-02 11:50:30,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 11:50:30,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 11:50:30,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 11:50:30,579 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 11:50:30,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:50:30" (1/1) ... [2021-05-02 11:50:30,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:50:30" (1/1) ... [2021-05-02 11:50:30,609 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:50:30" (1/1) ... [2021-05-02 11:50:30,609 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:50:30" (1/1) ... [2021-05-02 11:50:30,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:50:30" (1/1) ... [2021-05-02 11:50:30,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:50:30" (1/1) ... [2021-05-02 11:50:30,655 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:50:30" (1/1) ... [2021-05-02 11:50:30,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 11:50:30,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 11:50:30,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 11:50:30,663 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 11:50:30,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:50:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 11:50:30,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 11:50:30,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 11:50:30,713 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 11:50:30,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2021-05-02 11:50:30,713 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2021-05-02 11:50:30,713 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 11:50:30,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2021-05-02 11:50:30,714 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2021-05-02 11:50:30,714 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-05-02 11:50:30,714 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-05-02 11:50:30,714 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 11:50:30,714 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 11:50:30,714 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 11:50:30,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 11:50:30,714 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-05-02 11:50:30,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-02 11:50:30,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2021-05-02 11:50:30,714 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2021-05-02 11:50:30,714 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2021-05-02 11:50:30,714 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2021-05-02 11:50:30,714 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2021-05-02 11:50:30,715 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2021-05-02 11:50:30,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-05-02 11:50:30,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-05-02 11:50:30,715 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 11:50:30,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-05-02 11:50:30,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 11:50:30,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-05-02 11:50:30,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 11:50:30,715 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-05-02 11:50:30,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-05-02 11:50:30,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 11:50:30,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 11:50:30,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 11:50:30,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-05-02 11:50:30,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-05-02 11:50:30,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-05-02 11:50:30,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-05-02 11:50:30,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 11:50:31,062 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-05-02 11:50:31,442 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2021-05-02 11:50:31,442 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2021-05-02 11:50:31,469 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 11:50:31,469 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-05-02 11:50:31,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:50:31 BoogieIcfgContainer [2021-05-02 11:50:31,470 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 11:50:31,471 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 11:50:31,471 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 11:50:31,473 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 11:50:31,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 11:50:30" (1/3) ... [2021-05-02 11:50:31,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a5fdd5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:50:31, skipping insertion in model container [2021-05-02 11:50:31,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:50:30" (2/3) ... [2021-05-02 11:50:31,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a5fdd5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:50:31, skipping insertion in model container [2021-05-02 11:50:31,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:50:31" (3/3) ... [2021-05-02 11:50:31,475 INFO L111 eAbstractionObserver]: Analyzing ICFG s3.i [2021-05-02 11:50:31,478 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-05-02 11:50:31,481 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 11:50:31,492 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 11:50:31,506 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 11:50:31,506 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 11:50:31,506 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-02 11:50:31,507 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 11:50:31,507 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 11:50:31,507 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 11:50:31,507 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 11:50:31,507 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 11:50:31,518 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 132 states have (on average 1.6742424242424243) internal successors, (221), 133 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 11:50:31,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-05-02 11:50:31,522 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:31,523 INFO L523 BasicCegarLoop]: 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] [2021-05-02 11:50:31,523 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:31,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:31,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1896540148, now seen corresponding path program 1 times [2021-05-02 11:50:31,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:31,532 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367705460] [2021-05-02 11:50:31,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:31,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:31,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:31,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:31,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 11:50:31,737 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:31,737 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367705460] [2021-05-02 11:50:31,738 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367705460] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:50:31,738 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:50:31,738 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 11:50:31,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250788781] [2021-05-02 11:50:31,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 11:50:31,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:31,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 11:50:31,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 11:50:31,759 INFO L87 Difference]: Start difference. First operand has 140 states, 132 states have (on average 1.6742424242424243) internal successors, (221), 133 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:32,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:32,146 INFO L93 Difference]: Finished difference Result 385 states and 637 transitions. [2021-05-02 11:50:32,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-02 11:50:32,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2021-05-02 11:50:32,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:32,155 INFO L225 Difference]: With dead ends: 385 [2021-05-02 11:50:32,156 INFO L226 Difference]: Without dead ends: 223 [2021-05-02 11:50:32,158 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.2ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 11:50:32,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-05-02 11:50:32,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2021-05-02 11:50:32,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 218 states have (on average 1.481651376146789) internal successors, (323), 218 states have internal predecessors, (323), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:32,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 327 transitions. [2021-05-02 11:50:32,189 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 327 transitions. Word has length 30 [2021-05-02 11:50:32,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:32,189 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 327 transitions. [2021-05-02 11:50:32,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:32,189 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2021-05-02 11:50:32,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-05-02 11:50:32,193 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:32,193 INFO L523 BasicCegarLoop]: trace histogram [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] [2021-05-02 11:50:32,193 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 11:50:32,193 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:32,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:32,194 INFO L82 PathProgramCache]: Analyzing trace with hash 969835136, now seen corresponding path program 1 times [2021-05-02 11:50:32,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:32,194 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959236583] [2021-05-02 11:50:32,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:32,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:32,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:32,364 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 11:50:32,364 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:32,364 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959236583] [2021-05-02 11:50:32,364 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959236583] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:50:32,364 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:50:32,364 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 11:50:32,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23081378] [2021-05-02 11:50:32,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 11:50:32,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:32,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 11:50:32,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 11:50:32,366 INFO L87 Difference]: Start difference. First operand 223 states and 327 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:32,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:32,790 INFO L93 Difference]: Finished difference Result 432 states and 642 transitions. [2021-05-02 11:50:32,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-02 11:50:32,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2021-05-02 11:50:32,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:32,792 INFO L225 Difference]: With dead ends: 432 [2021-05-02 11:50:32,792 INFO L226 Difference]: Without dead ends: 325 [2021-05-02 11:50:32,793 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.6ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 11:50:32,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-05-02 11:50:32,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2021-05-02 11:50:32,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 320 states have (on average 1.475) internal successors, (472), 320 states have internal predecessors, (472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:32,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 476 transitions. [2021-05-02 11:50:32,808 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 476 transitions. Word has length 45 [2021-05-02 11:50:32,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:32,809 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 476 transitions. [2021-05-02 11:50:32,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:32,809 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 476 transitions. [2021-05-02 11:50:32,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-05-02 11:50:32,811 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:32,811 INFO L523 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2021-05-02 11:50:32,811 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 11:50:32,811 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:32,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:32,811 INFO L82 PathProgramCache]: Analyzing trace with hash -2112862728, now seen corresponding path program 1 times [2021-05-02 11:50:32,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:32,812 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563579608] [2021-05-02 11:50:32,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:32,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:32,927 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 11:50:32,927 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:32,927 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563579608] [2021-05-02 11:50:32,927 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563579608] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:50:32,927 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:50:32,927 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 11:50:32,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985491020] [2021-05-02 11:50:32,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 11:50:32,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:32,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 11:50:32,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 11:50:32,928 INFO L87 Difference]: Start difference. First operand 325 states and 476 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:33,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:33,591 INFO L93 Difference]: Finished difference Result 825 states and 1216 transitions. [2021-05-02 11:50:33,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 11:50:33,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2021-05-02 11:50:33,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:33,594 INFO L225 Difference]: With dead ends: 825 [2021-05-02 11:50:33,594 INFO L226 Difference]: Without dead ends: 513 [2021-05-02 11:50:33,595 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 11:50:33,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2021-05-02 11:50:33,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 375. [2021-05-02 11:50:33,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 370 states have (on average 1.508108108108108) internal successors, (558), 370 states have internal predecessors, (558), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:33,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 562 transitions. [2021-05-02 11:50:33,607 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 562 transitions. Word has length 63 [2021-05-02 11:50:33,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:33,607 INFO L480 AbstractCegarLoop]: Abstraction has 375 states and 562 transitions. [2021-05-02 11:50:33,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:33,608 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 562 transitions. [2021-05-02 11:50:33,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-05-02 11:50:33,610 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:33,610 INFO L523 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2021-05-02 11:50:33,610 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 11:50:33,610 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:33,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:33,610 INFO L82 PathProgramCache]: Analyzing trace with hash 2048091062, now seen corresponding path program 1 times [2021-05-02 11:50:33,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:33,611 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547368562] [2021-05-02 11:50:33,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:33,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:33,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:33,694 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 11:50:33,696 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:33,696 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547368562] [2021-05-02 11:50:33,696 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547368562] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:50:33,696 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:50:33,696 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 11:50:33,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642317280] [2021-05-02 11:50:33,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 11:50:33,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:33,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 11:50:33,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 11:50:33,698 INFO L87 Difference]: Start difference. First operand 375 states and 562 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:34,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:34,136 INFO L93 Difference]: Finished difference Result 821 states and 1232 transitions. [2021-05-02 11:50:34,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 11:50:34,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2021-05-02 11:50:34,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:34,138 INFO L225 Difference]: With dead ends: 821 [2021-05-02 11:50:34,138 INFO L226 Difference]: Without dead ends: 459 [2021-05-02 11:50:34,139 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 38.2ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 11:50:34,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-05-02 11:50:34,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 415. [2021-05-02 11:50:34,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 410 states have (on average 1.526829268292683) internal successors, (626), 410 states have internal predecessors, (626), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:34,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 630 transitions. [2021-05-02 11:50:34,149 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 630 transitions. Word has length 63 [2021-05-02 11:50:34,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:34,149 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 630 transitions. [2021-05-02 11:50:34,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:34,149 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 630 transitions. [2021-05-02 11:50:34,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-02 11:50:34,151 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:34,151 INFO L523 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2021-05-02 11:50:34,151 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-02 11:50:34,151 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:34,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:34,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1078652993, now seen corresponding path program 1 times [2021-05-02 11:50:34,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:34,152 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858641741] [2021-05-02 11:50:34,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:34,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:34,229 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 11:50:34,229 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:34,230 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858641741] [2021-05-02 11:50:34,230 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858641741] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:50:34,230 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:50:34,230 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 11:50:34,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806500567] [2021-05-02 11:50:34,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 11:50:34,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:34,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 11:50:34,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 11:50:34,231 INFO L87 Difference]: Start difference. First operand 415 states and 630 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:34,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:34,814 INFO L93 Difference]: Finished difference Result 949 states and 1429 transitions. [2021-05-02 11:50:34,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 11:50:34,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2021-05-02 11:50:34,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:34,816 INFO L225 Difference]: With dead ends: 949 [2021-05-02 11:50:34,816 INFO L226 Difference]: Without dead ends: 547 [2021-05-02 11:50:34,817 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.8ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 11:50:34,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2021-05-02 11:50:34,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 417. [2021-05-02 11:50:34,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 412 states have (on average 1.5242718446601942) internal successors, (628), 412 states have internal predecessors, (628), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:34,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 632 transitions. [2021-05-02 11:50:34,825 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 632 transitions. Word has length 64 [2021-05-02 11:50:34,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:34,826 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 632 transitions. [2021-05-02 11:50:34,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:34,826 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 632 transitions. [2021-05-02 11:50:34,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-05-02 11:50:34,829 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:34,829 INFO L523 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2021-05-02 11:50:34,829 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-02 11:50:34,829 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:34,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:34,829 INFO L82 PathProgramCache]: Analyzing trace with hash 917238579, now seen corresponding path program 1 times [2021-05-02 11:50:34,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:34,830 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323396262] [2021-05-02 11:50:34,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:34,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:34,934 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 11:50:34,934 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:34,934 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323396262] [2021-05-02 11:50:34,934 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323396262] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:50:34,935 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:50:34,935 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 11:50:34,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452234903] [2021-05-02 11:50:34,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 11:50:34,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:34,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 11:50:34,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 11:50:34,936 INFO L87 Difference]: Start difference. First operand 417 states and 632 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:35,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:35,596 INFO L93 Difference]: Finished difference Result 951 states and 1429 transitions. [2021-05-02 11:50:35,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 11:50:35,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2021-05-02 11:50:35,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:35,598 INFO L225 Difference]: With dead ends: 951 [2021-05-02 11:50:35,598 INFO L226 Difference]: Without dead ends: 547 [2021-05-02 11:50:35,599 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 47.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 11:50:35,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2021-05-02 11:50:35,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 419. [2021-05-02 11:50:35,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.5217391304347827) internal successors, (630), 414 states have internal predecessors, (630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:35,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 634 transitions. [2021-05-02 11:50:35,607 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 634 transitions. Word has length 65 [2021-05-02 11:50:35,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:35,607 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 634 transitions. [2021-05-02 11:50:35,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:35,607 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 634 transitions. [2021-05-02 11:50:35,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-05-02 11:50:35,608 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:35,608 INFO L523 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2021-05-02 11:50:35,608 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-02 11:50:35,609 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:35,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:35,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1634852198, now seen corresponding path program 1 times [2021-05-02 11:50:35,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:35,609 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459404135] [2021-05-02 11:50:35,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:35,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:35,682 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 11:50:35,682 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:35,682 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459404135] [2021-05-02 11:50:35,683 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459404135] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:50:35,683 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:50:35,683 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 11:50:35,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310790418] [2021-05-02 11:50:35,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 11:50:35,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:35,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 11:50:35,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 11:50:35,684 INFO L87 Difference]: Start difference. First operand 419 states and 634 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:36,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:36,249 INFO L93 Difference]: Finished difference Result 943 states and 1417 transitions. [2021-05-02 11:50:36,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 11:50:36,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2021-05-02 11:50:36,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:36,251 INFO L225 Difference]: With dead ends: 943 [2021-05-02 11:50:36,251 INFO L226 Difference]: Without dead ends: 537 [2021-05-02 11:50:36,252 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 53.9ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 11:50:36,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2021-05-02 11:50:36,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 421. [2021-05-02 11:50:36,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.5192307692307692) internal successors, (632), 416 states have internal predecessors, (632), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:36,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 636 transitions. [2021-05-02 11:50:36,260 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 636 transitions. Word has length 66 [2021-05-02 11:50:36,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:36,260 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 636 transitions. [2021-05-02 11:50:36,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:36,261 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 636 transitions. [2021-05-02 11:50:36,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-05-02 11:50:36,261 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:36,261 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:50:36,261 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-02 11:50:36,262 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:36,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:36,262 INFO L82 PathProgramCache]: Analyzing trace with hash 391550933, now seen corresponding path program 1 times [2021-05-02 11:50:36,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:36,262 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636009160] [2021-05-02 11:50:36,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:36,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:36,348 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 11:50:36,349 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:36,349 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636009160] [2021-05-02 11:50:36,349 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636009160] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:50:36,349 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:50:36,349 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 11:50:36,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854886209] [2021-05-02 11:50:36,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 11:50:36,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:36,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 11:50:36,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 11:50:36,350 INFO L87 Difference]: Start difference. First operand 421 states and 636 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:36,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:36,919 INFO L93 Difference]: Finished difference Result 943 states and 1415 transitions. [2021-05-02 11:50:36,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 11:50:36,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2021-05-02 11:50:36,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:36,921 INFO L225 Difference]: With dead ends: 943 [2021-05-02 11:50:36,921 INFO L226 Difference]: Without dead ends: 535 [2021-05-02 11:50:36,922 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.5ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 11:50:36,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-05-02 11:50:36,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2021-05-02 11:50:36,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.5144230769230769) internal successors, (630), 416 states have internal predecessors, (630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:36,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 634 transitions. [2021-05-02 11:50:36,930 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 634 transitions. Word has length 78 [2021-05-02 11:50:36,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:36,930 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 634 transitions. [2021-05-02 11:50:36,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:36,930 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 634 transitions. [2021-05-02 11:50:36,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-05-02 11:50:36,931 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:36,931 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2021-05-02 11:50:36,931 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-02 11:50:36,932 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:36,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:36,932 INFO L82 PathProgramCache]: Analyzing trace with hash -332605162, now seen corresponding path program 1 times [2021-05-02 11:50:36,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:36,932 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140139388] [2021-05-02 11:50:36,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:37,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:37,024 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 11:50:37,024 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:37,024 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140139388] [2021-05-02 11:50:37,024 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140139388] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:50:37,024 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:50:37,024 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 11:50:37,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504803287] [2021-05-02 11:50:37,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 11:50:37,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:37,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 11:50:37,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 11:50:37,025 INFO L87 Difference]: Start difference. First operand 421 states and 634 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:37,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:37,623 INFO L93 Difference]: Finished difference Result 794 states and 1184 transitions. [2021-05-02 11:50:37,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 11:50:37,623 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2021-05-02 11:50:37,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:37,625 INFO L225 Difference]: With dead ends: 794 [2021-05-02 11:50:37,625 INFO L226 Difference]: Without dead ends: 535 [2021-05-02 11:50:37,626 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 38.6ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 11:50:37,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-05-02 11:50:37,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2021-05-02 11:50:37,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.5096153846153846) internal successors, (628), 416 states have internal predecessors, (628), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:37,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 632 transitions. [2021-05-02 11:50:37,633 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 632 transitions. Word has length 78 [2021-05-02 11:50:37,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:37,633 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 632 transitions. [2021-05-02 11:50:37,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:37,634 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 632 transitions. [2021-05-02 11:50:37,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-05-02 11:50:37,634 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:37,634 INFO L523 BasicCegarLoop]: trace histogram [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, 1] [2021-05-02 11:50:37,635 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-02 11:50:37,635 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:37,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:37,635 INFO L82 PathProgramCache]: Analyzing trace with hash 372895475, now seen corresponding path program 1 times [2021-05-02 11:50:37,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:37,635 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722614860] [2021-05-02 11:50:37,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:37,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:37,716 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 11:50:37,716 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:37,716 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722614860] [2021-05-02 11:50:37,718 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722614860] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:50:37,718 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:50:37,718 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 11:50:37,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977731918] [2021-05-02 11:50:37,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 11:50:37,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:37,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 11:50:37,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 11:50:37,719 INFO L87 Difference]: Start difference. First operand 421 states and 632 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:38,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:38,292 INFO L93 Difference]: Finished difference Result 943 states and 1407 transitions. [2021-05-02 11:50:38,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 11:50:38,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2021-05-02 11:50:38,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:38,294 INFO L225 Difference]: With dead ends: 943 [2021-05-02 11:50:38,294 INFO L226 Difference]: Without dead ends: 535 [2021-05-02 11:50:38,295 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.7ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 11:50:38,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-05-02 11:50:38,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2021-05-02 11:50:38,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.5048076923076923) internal successors, (626), 416 states have internal predecessors, (626), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:38,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 630 transitions. [2021-05-02 11:50:38,302 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 630 transitions. Word has length 78 [2021-05-02 11:50:38,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:38,302 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 630 transitions. [2021-05-02 11:50:38,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:38,302 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 630 transitions. [2021-05-02 11:50:38,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-05-02 11:50:38,303 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:38,303 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:50:38,303 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-02 11:50:38,303 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:38,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:38,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1453816233, now seen corresponding path program 1 times [2021-05-02 11:50:38,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:38,304 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56536413] [2021-05-02 11:50:38,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:38,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:38,363 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 11:50:38,364 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:38,364 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56536413] [2021-05-02 11:50:38,364 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56536413] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:50:38,364 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:50:38,364 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 11:50:38,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976744395] [2021-05-02 11:50:38,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 11:50:38,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:38,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 11:50:38,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 11:50:38,365 INFO L87 Difference]: Start difference. First operand 421 states and 630 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:38,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:38,767 INFO L93 Difference]: Finished difference Result 871 states and 1296 transitions. [2021-05-02 11:50:38,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 11:50:38,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2021-05-02 11:50:38,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:38,769 INFO L225 Difference]: With dead ends: 871 [2021-05-02 11:50:38,769 INFO L226 Difference]: Without dead ends: 463 [2021-05-02 11:50:38,770 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.4ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 11:50:38,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2021-05-02 11:50:38,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2021-05-02 11:50:38,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.5) internal successors, (624), 416 states have internal predecessors, (624), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:38,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 628 transitions. [2021-05-02 11:50:38,777 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 628 transitions. Word has length 78 [2021-05-02 11:50:38,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:38,777 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 628 transitions. [2021-05-02 11:50:38,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:38,777 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 628 transitions. [2021-05-02 11:50:38,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-05-02 11:50:38,778 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:38,778 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2021-05-02 11:50:38,778 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-02 11:50:38,778 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:38,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:38,779 INFO L82 PathProgramCache]: Analyzing trace with hash 2116994968, now seen corresponding path program 1 times [2021-05-02 11:50:38,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:38,779 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409530209] [2021-05-02 11:50:38,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:38,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:38,836 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 11:50:38,836 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:38,837 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409530209] [2021-05-02 11:50:38,837 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409530209] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:50:38,837 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:50:38,837 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 11:50:38,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380229069] [2021-05-02 11:50:38,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 11:50:38,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:38,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 11:50:38,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 11:50:38,838 INFO L87 Difference]: Start difference. First operand 421 states and 628 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:39,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:39,240 INFO L93 Difference]: Finished difference Result 722 states and 1068 transitions. [2021-05-02 11:50:39,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 11:50:39,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2021-05-02 11:50:39,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:39,242 INFO L225 Difference]: With dead ends: 722 [2021-05-02 11:50:39,242 INFO L226 Difference]: Without dead ends: 463 [2021-05-02 11:50:39,242 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 11:50:39,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2021-05-02 11:50:39,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2021-05-02 11:50:39,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4951923076923077) internal successors, (622), 416 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:39,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 626 transitions. [2021-05-02 11:50:39,249 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 626 transitions. Word has length 78 [2021-05-02 11:50:39,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:39,249 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 626 transitions. [2021-05-02 11:50:39,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:39,250 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 626 transitions. [2021-05-02 11:50:39,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-05-02 11:50:39,250 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:39,250 INFO L523 BasicCegarLoop]: trace histogram [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, 1] [2021-05-02 11:50:39,251 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-02 11:50:39,251 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:39,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:39,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1472471691, now seen corresponding path program 1 times [2021-05-02 11:50:39,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:39,251 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12435864] [2021-05-02 11:50:39,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:39,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:39,320 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 11:50:39,320 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:39,320 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12435864] [2021-05-02 11:50:39,320 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12435864] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:50:39,320 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:50:39,320 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 11:50:39,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901101101] [2021-05-02 11:50:39,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 11:50:39,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:39,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 11:50:39,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 11:50:39,321 INFO L87 Difference]: Start difference. First operand 421 states and 626 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:39,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:39,706 INFO L93 Difference]: Finished difference Result 871 states and 1288 transitions. [2021-05-02 11:50:39,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 11:50:39,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2021-05-02 11:50:39,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:39,707 INFO L225 Difference]: With dead ends: 871 [2021-05-02 11:50:39,708 INFO L226 Difference]: Without dead ends: 463 [2021-05-02 11:50:39,708 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.2ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 11:50:39,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2021-05-02 11:50:39,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2021-05-02 11:50:39,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4903846153846154) internal successors, (620), 416 states have internal predecessors, (620), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:39,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 624 transitions. [2021-05-02 11:50:39,716 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 624 transitions. Word has length 78 [2021-05-02 11:50:39,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:39,716 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 624 transitions. [2021-05-02 11:50:39,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:39,716 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 624 transitions. [2021-05-02 11:50:39,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-02 11:50:39,717 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:39,717 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1] [2021-05-02 11:50:39,717 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-02 11:50:39,717 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:39,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:39,717 INFO L82 PathProgramCache]: Analyzing trace with hash 802013836, now seen corresponding path program 1 times [2021-05-02 11:50:39,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:39,717 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486602397] [2021-05-02 11:50:39,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:39,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:39,786 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 11:50:39,786 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:39,786 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486602397] [2021-05-02 11:50:39,786 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486602397] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:50:39,787 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:50:39,787 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 11:50:39,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233372784] [2021-05-02 11:50:39,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 11:50:39,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:39,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 11:50:39,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 11:50:39,787 INFO L87 Difference]: Start difference. First operand 421 states and 624 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:40,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:40,303 INFO L93 Difference]: Finished difference Result 943 states and 1391 transitions. [2021-05-02 11:50:40,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 11:50:40,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2021-05-02 11:50:40,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:40,305 INFO L225 Difference]: With dead ends: 943 [2021-05-02 11:50:40,305 INFO L226 Difference]: Without dead ends: 535 [2021-05-02 11:50:40,306 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 37.5ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 11:50:40,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-05-02 11:50:40,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2021-05-02 11:50:40,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4855769230769231) internal successors, (618), 416 states have internal predecessors, (618), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:40,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 622 transitions. [2021-05-02 11:50:40,314 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 622 transitions. Word has length 79 [2021-05-02 11:50:40,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:40,314 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 622 transitions. [2021-05-02 11:50:40,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:40,314 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 622 transitions. [2021-05-02 11:50:40,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-02 11:50:40,315 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:40,315 INFO L523 BasicCegarLoop]: trace histogram [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] [2021-05-02 11:50:40,315 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-02 11:50:40,315 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:40,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:40,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1436944913, now seen corresponding path program 1 times [2021-05-02 11:50:40,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:40,315 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746886869] [2021-05-02 11:50:40,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:40,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:40,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:40,376 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 11:50:40,376 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:40,376 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746886869] [2021-05-02 11:50:40,376 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746886869] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:50:40,376 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:50:40,376 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 11:50:40,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138236784] [2021-05-02 11:50:40,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 11:50:40,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:40,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 11:50:40,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 11:50:40,377 INFO L87 Difference]: Start difference. First operand 421 states and 622 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:40,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:40,897 INFO L93 Difference]: Finished difference Result 788 states and 1159 transitions. [2021-05-02 11:50:40,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 11:50:40,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2021-05-02 11:50:40,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:40,898 INFO L225 Difference]: With dead ends: 788 [2021-05-02 11:50:40,898 INFO L226 Difference]: Without dead ends: 529 [2021-05-02 11:50:40,899 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.8ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 11:50:40,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2021-05-02 11:50:40,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 421. [2021-05-02 11:50:40,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4807692307692308) internal successors, (616), 416 states have internal predecessors, (616), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:40,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 620 transitions. [2021-05-02 11:50:40,908 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 620 transitions. Word has length 79 [2021-05-02 11:50:40,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:40,908 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 620 transitions. [2021-05-02 11:50:40,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:40,908 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 620 transitions. [2021-05-02 11:50:40,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-02 11:50:40,909 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:40,909 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1] [2021-05-02 11:50:40,909 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-02 11:50:40,910 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:40,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:40,910 INFO L82 PathProgramCache]: Analyzing trace with hash -569793462, now seen corresponding path program 1 times [2021-05-02 11:50:40,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:40,910 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186525605] [2021-05-02 11:50:40,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:40,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:40,982 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 11:50:40,982 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:40,982 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186525605] [2021-05-02 11:50:40,982 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186525605] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:50:40,982 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:50:40,982 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 11:50:40,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191820614] [2021-05-02 11:50:40,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 11:50:40,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:40,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 11:50:40,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 11:50:40,983 INFO L87 Difference]: Start difference. First operand 421 states and 620 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:41,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:41,380 INFO L93 Difference]: Finished difference Result 871 states and 1276 transitions. [2021-05-02 11:50:41,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 11:50:41,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2021-05-02 11:50:41,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:41,382 INFO L225 Difference]: With dead ends: 871 [2021-05-02 11:50:41,382 INFO L226 Difference]: Without dead ends: 463 [2021-05-02 11:50:41,383 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.4ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 11:50:41,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2021-05-02 11:50:41,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2021-05-02 11:50:41,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4759615384615385) internal successors, (614), 416 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:41,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 618 transitions. [2021-05-02 11:50:41,390 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 618 transitions. Word has length 79 [2021-05-02 11:50:41,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:41,390 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 618 transitions. [2021-05-02 11:50:41,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:41,390 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 618 transitions. [2021-05-02 11:50:41,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-02 11:50:41,391 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:41,391 INFO L523 BasicCegarLoop]: trace histogram [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] [2021-05-02 11:50:41,391 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-02 11:50:41,391 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:41,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:41,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1486215085, now seen corresponding path program 1 times [2021-05-02 11:50:41,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:41,392 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841866365] [2021-05-02 11:50:41,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:41,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:41,457 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 11:50:41,457 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:41,457 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841866365] [2021-05-02 11:50:41,457 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841866365] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:50:41,457 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:50:41,457 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 11:50:41,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233029944] [2021-05-02 11:50:41,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 11:50:41,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:41,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 11:50:41,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 11:50:41,460 INFO L87 Difference]: Start difference. First operand 421 states and 618 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:41,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:41,848 INFO L93 Difference]: Finished difference Result 716 states and 1046 transitions. [2021-05-02 11:50:41,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 11:50:41,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2021-05-02 11:50:41,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:41,850 INFO L225 Difference]: With dead ends: 716 [2021-05-02 11:50:41,850 INFO L226 Difference]: Without dead ends: 457 [2021-05-02 11:50:41,850 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 41.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 11:50:41,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2021-05-02 11:50:41,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 421. [2021-05-02 11:50:41,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4711538461538463) internal successors, (612), 416 states have internal predecessors, (612), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:41,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 616 transitions. [2021-05-02 11:50:41,857 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 616 transitions. Word has length 79 [2021-05-02 11:50:41,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:41,857 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 616 transitions. [2021-05-02 11:50:41,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:41,857 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 616 transitions. [2021-05-02 11:50:41,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-05-02 11:50:41,858 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:41,858 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1] [2021-05-02 11:50:41,858 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-02 11:50:41,858 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:41,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:41,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1321186472, now seen corresponding path program 1 times [2021-05-02 11:50:41,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:41,859 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808361076] [2021-05-02 11:50:41,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:41,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:41,933 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 11:50:41,933 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:41,933 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808361076] [2021-05-02 11:50:41,933 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808361076] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:50:41,933 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:50:41,933 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 11:50:41,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660265927] [2021-05-02 11:50:41,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 11:50:41,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:41,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 11:50:41,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 11:50:41,935 INFO L87 Difference]: Start difference. First operand 421 states and 616 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:42,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:42,438 INFO L93 Difference]: Finished difference Result 937 states and 1368 transitions. [2021-05-02 11:50:42,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 11:50:42,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2021-05-02 11:50:42,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:42,440 INFO L225 Difference]: With dead ends: 937 [2021-05-02 11:50:42,440 INFO L226 Difference]: Without dead ends: 529 [2021-05-02 11:50:42,441 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 38.9ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 11:50:42,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2021-05-02 11:50:42,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 421. [2021-05-02 11:50:42,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4663461538461537) internal successors, (610), 416 states have internal predecessors, (610), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:42,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 614 transitions. [2021-05-02 11:50:42,448 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 614 transitions. Word has length 80 [2021-05-02 11:50:42,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:42,448 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 614 transitions. [2021-05-02 11:50:42,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:42,448 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 614 transitions. [2021-05-02 11:50:42,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-05-02 11:50:42,449 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:42,449 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1] [2021-05-02 11:50:42,449 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-05-02 11:50:42,449 INFO L428 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:42,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:42,449 INFO L82 PathProgramCache]: Analyzing trace with hash -897539750, now seen corresponding path program 1 times [2021-05-02 11:50:42,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:42,449 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251732303] [2021-05-02 11:50:42,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:42,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:42,509 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 11:50:42,509 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:42,509 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251732303] [2021-05-02 11:50:42,509 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251732303] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:50:42,509 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:50:42,509 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 11:50:42,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48438597] [2021-05-02 11:50:42,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 11:50:42,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:42,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 11:50:42,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 11:50:42,511 INFO L87 Difference]: Start difference. First operand 421 states and 614 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:42,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:42,889 INFO L93 Difference]: Finished difference Result 865 states and 1257 transitions. [2021-05-02 11:50:42,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 11:50:42,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2021-05-02 11:50:42,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:42,891 INFO L225 Difference]: With dead ends: 865 [2021-05-02 11:50:42,891 INFO L226 Difference]: Without dead ends: 457 [2021-05-02 11:50:42,892 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.7ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 11:50:42,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2021-05-02 11:50:42,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 421. [2021-05-02 11:50:42,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4615384615384615) internal successors, (608), 416 states have internal predecessors, (608), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:42,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 612 transitions. [2021-05-02 11:50:42,898 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 612 transitions. Word has length 80 [2021-05-02 11:50:42,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:42,898 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 612 transitions. [2021-05-02 11:50:42,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:42,899 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 612 transitions. [2021-05-02 11:50:42,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-05-02 11:50:42,899 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:42,899 INFO L523 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:50:42,899 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-02 11:50:42,900 INFO L428 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:42,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:42,900 INFO L82 PathProgramCache]: Analyzing trace with hash -961886895, now seen corresponding path program 1 times [2021-05-02 11:50:42,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:42,900 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891227265] [2021-05-02 11:50:42,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:42,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:42,961 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 11:50:42,961 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:42,961 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891227265] [2021-05-02 11:50:42,961 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891227265] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:50:42,961 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:50:42,961 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 11:50:42,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233844919] [2021-05-02 11:50:42,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 11:50:42,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:42,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 11:50:42,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 11:50:42,962 INFO L87 Difference]: Start difference. First operand 421 states and 612 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:43,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:43,454 INFO L93 Difference]: Finished difference Result 919 states and 1338 transitions. [2021-05-02 11:50:43,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 11:50:43,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2021-05-02 11:50:43,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:43,456 INFO L225 Difference]: With dead ends: 919 [2021-05-02 11:50:43,468 INFO L226 Difference]: Without dead ends: 511 [2021-05-02 11:50:43,469 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.4ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 11:50:43,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2021-05-02 11:50:43,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 421. [2021-05-02 11:50:43,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4567307692307692) internal successors, (606), 416 states have internal predecessors, (606), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:43,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 610 transitions. [2021-05-02 11:50:43,476 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 610 transitions. Word has length 81 [2021-05-02 11:50:43,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:43,476 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 610 transitions. [2021-05-02 11:50:43,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:43,476 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 610 transitions. [2021-05-02 11:50:43,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-05-02 11:50:43,477 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:43,477 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2021-05-02 11:50:43,477 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-05-02 11:50:43,477 INFO L428 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:43,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:43,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1641653410, now seen corresponding path program 1 times [2021-05-02 11:50:43,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:43,478 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123880399] [2021-05-02 11:50:43,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:43,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:43,536 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 11:50:43,536 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:43,536 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123880399] [2021-05-02 11:50:43,536 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123880399] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:50:43,536 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:50:43,536 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 11:50:43,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249160322] [2021-05-02 11:50:43,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 11:50:43,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:43,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 11:50:43,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 11:50:43,537 INFO L87 Difference]: Start difference. First operand 421 states and 610 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:44,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:44,010 INFO L93 Difference]: Finished difference Result 919 states and 1334 transitions. [2021-05-02 11:50:44,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 11:50:44,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2021-05-02 11:50:44,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:44,012 INFO L225 Difference]: With dead ends: 919 [2021-05-02 11:50:44,012 INFO L226 Difference]: Without dead ends: 511 [2021-05-02 11:50:44,012 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.2ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 11:50:44,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2021-05-02 11:50:44,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 421. [2021-05-02 11:50:44,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4519230769230769) internal successors, (604), 416 states have internal predecessors, (604), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:44,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 608 transitions. [2021-05-02 11:50:44,035 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 608 transitions. Word has length 81 [2021-05-02 11:50:44,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:44,035 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 608 transitions. [2021-05-02 11:50:44,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:44,036 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 608 transitions. [2021-05-02 11:50:44,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-05-02 11:50:44,036 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:44,036 INFO L523 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:50:44,037 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-02 11:50:44,037 INFO L428 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:44,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:44,037 INFO L82 PathProgramCache]: Analyzing trace with hash -713740401, now seen corresponding path program 1 times [2021-05-02 11:50:44,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:44,037 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427124024] [2021-05-02 11:50:44,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:44,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:44,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:44,100 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-02 11:50:44,101 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:44,101 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427124024] [2021-05-02 11:50:44,101 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427124024] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:50:44,101 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:50:44,101 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 11:50:44,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620217092] [2021-05-02 11:50:44,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 11:50:44,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:44,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 11:50:44,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 11:50:44,102 INFO L87 Difference]: Start difference. First operand 421 states and 608 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:44,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:44,436 INFO L93 Difference]: Finished difference Result 847 states and 1223 transitions. [2021-05-02 11:50:44,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 11:50:44,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2021-05-02 11:50:44,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:44,439 INFO L225 Difference]: With dead ends: 847 [2021-05-02 11:50:44,439 INFO L226 Difference]: Without dead ends: 439 [2021-05-02 11:50:44,440 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.5ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 11:50:44,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2021-05-02 11:50:44,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 421. [2021-05-02 11:50:44,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4471153846153846) internal successors, (602), 416 states have internal predecessors, (602), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:44,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 606 transitions. [2021-05-02 11:50:44,447 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 606 transitions. Word has length 81 [2021-05-02 11:50:44,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:44,447 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 606 transitions. [2021-05-02 11:50:44,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:44,447 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 606 transitions. [2021-05-02 11:50:44,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-05-02 11:50:44,448 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:44,448 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2021-05-02 11:50:44,448 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-05-02 11:50:44,448 INFO L428 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:44,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:44,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1889799904, now seen corresponding path program 1 times [2021-05-02 11:50:44,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:44,448 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801918748] [2021-05-02 11:50:44,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:44,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:44,503 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-05-02 11:50:44,503 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:44,503 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801918748] [2021-05-02 11:50:44,504 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801918748] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:50:44,504 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:50:44,504 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 11:50:44,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334482512] [2021-05-02 11:50:44,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 11:50:44,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:44,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 11:50:44,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 11:50:44,504 INFO L87 Difference]: Start difference. First operand 421 states and 606 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:44,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:44,955 INFO L93 Difference]: Finished difference Result 830 states and 1203 transitions. [2021-05-02 11:50:44,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-02 11:50:44,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2021-05-02 11:50:44,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:44,957 INFO L225 Difference]: With dead ends: 830 [2021-05-02 11:50:44,957 INFO L226 Difference]: Without dead ends: 573 [2021-05-02 11:50:44,963 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.5ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 11:50:44,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2021-05-02 11:50:44,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2021-05-02 11:50:44,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 568 states have (on average 1.4419014084507042) internal successors, (819), 568 states have internal predecessors, (819), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:44,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 823 transitions. [2021-05-02 11:50:44,971 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 823 transitions. Word has length 81 [2021-05-02 11:50:44,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:44,971 INFO L480 AbstractCegarLoop]: Abstraction has 573 states and 823 transitions. [2021-05-02 11:50:44,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:44,971 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 823 transitions. [2021-05-02 11:50:44,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-05-02 11:50:44,972 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:44,972 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2021-05-02 11:50:44,972 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-05-02 11:50:44,972 INFO L428 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:44,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:44,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1289658122, now seen corresponding path program 1 times [2021-05-02 11:50:44,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:44,972 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173622955] [2021-05-02 11:50:44,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:45,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:45,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:45,040 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-05-02 11:50:45,040 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:45,040 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173622955] [2021-05-02 11:50:45,040 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173622955] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:50:45,040 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:50:45,040 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 11:50:45,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909986777] [2021-05-02 11:50:45,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 11:50:45,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:45,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 11:50:45,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 11:50:45,041 INFO L87 Difference]: Start difference. First operand 573 states and 823 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:45,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:45,283 INFO L93 Difference]: Finished difference Result 728 states and 1048 transitions. [2021-05-02 11:50:45,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-02 11:50:45,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2021-05-02 11:50:45,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:45,285 INFO L225 Difference]: With dead ends: 728 [2021-05-02 11:50:45,286 INFO L226 Difference]: Without dead ends: 726 [2021-05-02 11:50:45,287 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.3ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 11:50:45,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2021-05-02 11:50:45,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2021-05-02 11:50:45,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 721 states have (on average 1.4438280166435506) internal successors, (1041), 721 states have internal predecessors, (1041), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:45,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1045 transitions. [2021-05-02 11:50:45,297 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1045 transitions. Word has length 83 [2021-05-02 11:50:45,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:45,297 INFO L480 AbstractCegarLoop]: Abstraction has 726 states and 1045 transitions. [2021-05-02 11:50:45,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:45,297 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1045 transitions. [2021-05-02 11:50:45,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-05-02 11:50:45,298 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:45,298 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:50:45,299 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-05-02 11:50:45,299 INFO L428 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:45,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:45,299 INFO L82 PathProgramCache]: Analyzing trace with hash 646584519, now seen corresponding path program 1 times [2021-05-02 11:50:45,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:45,300 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618216511] [2021-05-02 11:50:45,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:45,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:45,357 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-05-02 11:50:45,357 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:45,357 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618216511] [2021-05-02 11:50:45,357 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618216511] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:50:45,357 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:50:45,357 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 11:50:45,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801844527] [2021-05-02 11:50:45,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 11:50:45,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:45,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 11:50:45,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 11:50:45,358 INFO L87 Difference]: Start difference. First operand 726 states and 1045 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:45,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:45,776 INFO L93 Difference]: Finished difference Result 1285 states and 1854 transitions. [2021-05-02 11:50:45,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-02 11:50:45,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2021-05-02 11:50:45,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:45,778 INFO L225 Difference]: With dead ends: 1285 [2021-05-02 11:50:45,778 INFO L226 Difference]: Without dead ends: 723 [2021-05-02 11:50:45,779 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.1ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 11:50:45,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2021-05-02 11:50:45,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2021-05-02 11:50:45,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 718 states have (on average 1.435933147632312) internal successors, (1031), 718 states have internal predecessors, (1031), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:45,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1035 transitions. [2021-05-02 11:50:45,793 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1035 transitions. Word has length 104 [2021-05-02 11:50:45,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:45,793 INFO L480 AbstractCegarLoop]: Abstraction has 723 states and 1035 transitions. [2021-05-02 11:50:45,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:45,794 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1035 transitions. [2021-05-02 11:50:45,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-05-02 11:50:45,795 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:45,795 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:50:45,795 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-05-02 11:50:45,795 INFO L428 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:45,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:45,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1543745982, now seen corresponding path program 1 times [2021-05-02 11:50:45,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:45,795 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554172755] [2021-05-02 11:50:45,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:45,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:45,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:45,867 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-05-02 11:50:45,867 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:45,867 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554172755] [2021-05-02 11:50:45,867 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554172755] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:50:45,867 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:50:45,868 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 11:50:45,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092548582] [2021-05-02 11:50:45,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 11:50:45,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:45,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 11:50:45,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 11:50:45,870 INFO L87 Difference]: Start difference. First operand 723 states and 1035 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:46,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:46,306 INFO L93 Difference]: Finished difference Result 1689 states and 2427 transitions. [2021-05-02 11:50:46,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 11:50:46,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2021-05-02 11:50:46,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:46,308 INFO L225 Difference]: With dead ends: 1689 [2021-05-02 11:50:46,308 INFO L226 Difference]: Without dead ends: 979 [2021-05-02 11:50:46,309 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.8ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 11:50:46,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2021-05-02 11:50:46,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 843. [2021-05-02 11:50:46,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 838 states have (on average 1.4809069212410502) internal successors, (1241), 838 states have internal predecessors, (1241), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:46,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1245 transitions. [2021-05-02 11:50:46,321 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1245 transitions. Word has length 106 [2021-05-02 11:50:46,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:46,322 INFO L480 AbstractCegarLoop]: Abstraction has 843 states and 1245 transitions. [2021-05-02 11:50:46,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:46,322 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1245 transitions. [2021-05-02 11:50:46,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-05-02 11:50:46,323 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:46,323 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:50:46,323 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-05-02 11:50:46,323 INFO L428 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:46,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:46,324 INFO L82 PathProgramCache]: Analyzing trace with hash -306215199, now seen corresponding path program 1 times [2021-05-02 11:50:46,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:46,324 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761113911] [2021-05-02 11:50:46,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:46,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:46,397 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-05-02 11:50:46,397 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:46,397 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761113911] [2021-05-02 11:50:46,397 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761113911] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:50:46,397 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:50:46,398 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 11:50:46,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245190535] [2021-05-02 11:50:46,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 11:50:46,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:46,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 11:50:46,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 11:50:46,398 INFO L87 Difference]: Start difference. First operand 843 states and 1245 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:46,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:46,843 INFO L93 Difference]: Finished difference Result 1804 states and 2627 transitions. [2021-05-02 11:50:46,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 11:50:46,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2021-05-02 11:50:46,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:46,846 INFO L225 Difference]: With dead ends: 1804 [2021-05-02 11:50:46,846 INFO L226 Difference]: Without dead ends: 974 [2021-05-02 11:50:46,847 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.5ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 11:50:46,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2021-05-02 11:50:46,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 843. [2021-05-02 11:50:46,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 838 states have (on average 1.4749403341288783) internal successors, (1236), 838 states have internal predecessors, (1236), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:46,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1240 transitions. [2021-05-02 11:50:46,860 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1240 transitions. Word has length 121 [2021-05-02 11:50:46,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:46,860 INFO L480 AbstractCegarLoop]: Abstraction has 843 states and 1240 transitions. [2021-05-02 11:50:46,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:46,860 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1240 transitions. [2021-05-02 11:50:46,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-05-02 11:50:46,862 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:46,862 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 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] [2021-05-02 11:50:46,862 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-05-02 11:50:46,862 INFO L428 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:46,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:46,862 INFO L82 PathProgramCache]: Analyzing trace with hash -435520542, now seen corresponding path program 1 times [2021-05-02 11:50:46,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:46,862 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909311150] [2021-05-02 11:50:46,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:46,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:46,947 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-05-02 11:50:46,948 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:46,948 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909311150] [2021-05-02 11:50:46,948 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909311150] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:50:46,948 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:50:46,948 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 11:50:46,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337221644] [2021-05-02 11:50:46,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 11:50:46,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:46,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 11:50:46,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 11:50:46,948 INFO L87 Difference]: Start difference. First operand 843 states and 1240 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:47,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:47,340 INFO L93 Difference]: Finished difference Result 1636 states and 2410 transitions. [2021-05-02 11:50:47,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 11:50:47,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2021-05-02 11:50:47,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:47,343 INFO L225 Difference]: With dead ends: 1636 [2021-05-02 11:50:47,343 INFO L226 Difference]: Without dead ends: 981 [2021-05-02 11:50:47,344 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.3ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 11:50:47,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2021-05-02 11:50:47,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 915. [2021-05-02 11:50:47,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 910 states have (on average 1.4901098901098901) internal successors, (1356), 910 states have internal predecessors, (1356), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:47,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1360 transitions. [2021-05-02 11:50:47,362 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1360 transitions. Word has length 121 [2021-05-02 11:50:47,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:47,362 INFO L480 AbstractCegarLoop]: Abstraction has 915 states and 1360 transitions. [2021-05-02 11:50:47,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:47,362 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1360 transitions. [2021-05-02 11:50:47,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-05-02 11:50:47,364 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:47,364 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:50:47,364 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-05-02 11:50:47,364 INFO L428 AbstractCegarLoop]: === Iteration 29 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:47,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:47,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1054241153, now seen corresponding path program 1 times [2021-05-02 11:50:47,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:47,364 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705996992] [2021-05-02 11:50:47,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:47,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:47,427 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-05-02 11:50:47,427 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:47,427 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705996992] [2021-05-02 11:50:47,427 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705996992] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:50:47,427 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:50:47,427 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 11:50:47,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153836131] [2021-05-02 11:50:47,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 11:50:47,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:47,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 11:50:47,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 11:50:47,428 INFO L87 Difference]: Start difference. First operand 915 states and 1360 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:47,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:47,827 INFO L93 Difference]: Finished difference Result 1948 states and 2857 transitions. [2021-05-02 11:50:47,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 11:50:47,827 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2021-05-02 11:50:47,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:47,830 INFO L225 Difference]: With dead ends: 1948 [2021-05-02 11:50:47,830 INFO L226 Difference]: Without dead ends: 1046 [2021-05-02 11:50:47,832 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.7ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 11:50:47,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2021-05-02 11:50:47,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 915. [2021-05-02 11:50:47,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 910 states have (on average 1.4846153846153847) internal successors, (1351), 910 states have internal predecessors, (1351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:47,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1355 transitions. [2021-05-02 11:50:47,845 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1355 transitions. Word has length 121 [2021-05-02 11:50:47,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:47,845 INFO L480 AbstractCegarLoop]: Abstraction has 915 states and 1355 transitions. [2021-05-02 11:50:47,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:47,845 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1355 transitions. [2021-05-02 11:50:47,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-05-02 11:50:47,847 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:47,847 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:50:47,847 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-05-02 11:50:47,847 INFO L428 AbstractCegarLoop]: === Iteration 30 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:47,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:47,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1412102102, now seen corresponding path program 1 times [2021-05-02 11:50:47,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:47,847 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363303836] [2021-05-02 11:50:47,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:47,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:47,909 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-05-02 11:50:47,909 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:47,909 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363303836] [2021-05-02 11:50:47,909 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363303836] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:50:47,910 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:50:47,910 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 11:50:47,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638788273] [2021-05-02 11:50:47,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 11:50:47,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:47,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 11:50:47,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 11:50:47,911 INFO L87 Difference]: Start difference. First operand 915 states and 1355 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:48,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:48,376 INFO L93 Difference]: Finished difference Result 1948 states and 2847 transitions. [2021-05-02 11:50:48,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 11:50:48,376 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2021-05-02 11:50:48,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:48,379 INFO L225 Difference]: With dead ends: 1948 [2021-05-02 11:50:48,379 INFO L226 Difference]: Without dead ends: 1046 [2021-05-02 11:50:48,380 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.4ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 11:50:48,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2021-05-02 11:50:48,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 915. [2021-05-02 11:50:48,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 910 states have (on average 1.4791208791208792) internal successors, (1346), 910 states have internal predecessors, (1346), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:48,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1350 transitions. [2021-05-02 11:50:48,394 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1350 transitions. Word has length 122 [2021-05-02 11:50:48,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:48,394 INFO L480 AbstractCegarLoop]: Abstraction has 915 states and 1350 transitions. [2021-05-02 11:50:48,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:48,394 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1350 transitions. [2021-05-02 11:50:48,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-05-02 11:50:48,396 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:48,399 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:50:48,399 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-05-02 11:50:48,399 INFO L428 AbstractCegarLoop]: === Iteration 31 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:48,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:48,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1769118364, now seen corresponding path program 1 times [2021-05-02 11:50:48,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:48,400 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273017954] [2021-05-02 11:50:48,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:48,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:48,464 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-05-02 11:50:48,464 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:48,464 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273017954] [2021-05-02 11:50:48,464 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273017954] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:50:48,464 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:50:48,464 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 11:50:48,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196455123] [2021-05-02 11:50:48,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 11:50:48,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:48,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 11:50:48,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 11:50:48,465 INFO L87 Difference]: Start difference. First operand 915 states and 1350 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:48,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:48,880 INFO L93 Difference]: Finished difference Result 1948 states and 2837 transitions. [2021-05-02 11:50:48,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 11:50:48,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2021-05-02 11:50:48,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:48,883 INFO L225 Difference]: With dead ends: 1948 [2021-05-02 11:50:48,883 INFO L226 Difference]: Without dead ends: 1046 [2021-05-02 11:50:48,884 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.4ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 11:50:48,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2021-05-02 11:50:48,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 915. [2021-05-02 11:50:48,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 910 states have (on average 1.4736263736263737) internal successors, (1341), 910 states have internal predecessors, (1341), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:48,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1345 transitions. [2021-05-02 11:50:48,895 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1345 transitions. Word has length 123 [2021-05-02 11:50:48,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:48,896 INFO L480 AbstractCegarLoop]: Abstraction has 915 states and 1345 transitions. [2021-05-02 11:50:48,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:48,896 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1345 transitions. [2021-05-02 11:50:48,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-05-02 11:50:48,897 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:48,897 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:50:48,897 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-05-02 11:50:48,897 INFO L428 AbstractCegarLoop]: === Iteration 32 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:48,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:48,898 INFO L82 PathProgramCache]: Analyzing trace with hash 363812251, now seen corresponding path program 1 times [2021-05-02 11:50:48,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:48,898 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474139245] [2021-05-02 11:50:48,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:48,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:48,961 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-05-02 11:50:48,961 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:48,962 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474139245] [2021-05-02 11:50:48,962 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474139245] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:50:48,962 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:50:48,962 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 11:50:48,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832237812] [2021-05-02 11:50:48,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 11:50:48,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:48,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 11:50:48,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 11:50:48,963 INFO L87 Difference]: Start difference. First operand 915 states and 1345 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:49,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:49,335 INFO L93 Difference]: Finished difference Result 1903 states and 2772 transitions. [2021-05-02 11:50:49,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 11:50:49,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 124 [2021-05-02 11:50:49,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:49,338 INFO L225 Difference]: With dead ends: 1903 [2021-05-02 11:50:49,338 INFO L226 Difference]: Without dead ends: 1001 [2021-05-02 11:50:49,339 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.2ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 11:50:49,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2021-05-02 11:50:49,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 915. [2021-05-02 11:50:49,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 910 states have (on average 1.468131868131868) internal successors, (1336), 910 states have internal predecessors, (1336), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:49,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1340 transitions. [2021-05-02 11:50:49,350 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1340 transitions. Word has length 124 [2021-05-02 11:50:49,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:49,350 INFO L480 AbstractCegarLoop]: Abstraction has 915 states and 1340 transitions. [2021-05-02 11:50:49,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:49,350 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1340 transitions. [2021-05-02 11:50:49,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-05-02 11:50:49,352 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:49,352 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 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] [2021-05-02 11:50:49,352 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-05-02 11:50:49,352 INFO L428 AbstractCegarLoop]: === Iteration 33 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:49,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:49,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1599888212, now seen corresponding path program 1 times [2021-05-02 11:50:49,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:49,352 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784117140] [2021-05-02 11:50:49,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:49,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:49,409 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2021-05-02 11:50:49,409 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:49,409 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784117140] [2021-05-02 11:50:49,409 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784117140] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:50:49,409 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:50:49,409 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 11:50:49,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879432801] [2021-05-02 11:50:49,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 11:50:49,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:49,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 11:50:49,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 11:50:49,410 INFO L87 Difference]: Start difference. First operand 915 states and 1340 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:49,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:49,811 INFO L93 Difference]: Finished difference Result 2048 states and 3002 transitions. [2021-05-02 11:50:49,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 11:50:49,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 124 [2021-05-02 11:50:49,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:49,814 INFO L225 Difference]: With dead ends: 2048 [2021-05-02 11:50:49,814 INFO L226 Difference]: Without dead ends: 1146 [2021-05-02 11:50:49,815 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 11:50:49,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2021-05-02 11:50:49,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1025. [2021-05-02 11:50:49,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1020 states have (on average 1.496078431372549) internal successors, (1526), 1020 states have internal predecessors, (1526), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:49,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1530 transitions. [2021-05-02 11:50:49,828 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1530 transitions. Word has length 124 [2021-05-02 11:50:49,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:49,828 INFO L480 AbstractCegarLoop]: Abstraction has 1025 states and 1530 transitions. [2021-05-02 11:50:49,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:49,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1530 transitions. [2021-05-02 11:50:49,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-05-02 11:50:49,830 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:49,830 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:50:49,830 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-05-02 11:50:49,830 INFO L428 AbstractCegarLoop]: === Iteration 34 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:49,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:49,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1834894398, now seen corresponding path program 1 times [2021-05-02 11:50:49,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:49,831 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289638900] [2021-05-02 11:50:49,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:49,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:49,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:49,963 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2021-05-02 11:50:49,963 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:49,964 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289638900] [2021-05-02 11:50:49,964 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289638900] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:50:49,964 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:50:49,964 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 11:50:49,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438242310] [2021-05-02 11:50:49,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 11:50:49,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:49,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 11:50:49,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-05-02 11:50:49,964 INFO L87 Difference]: Start difference. First operand 1025 states and 1530 transitions. Second operand has 7 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:50,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:50,421 INFO L93 Difference]: Finished difference Result 2041 states and 3048 transitions. [2021-05-02 11:50:50,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 11:50:50,421 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 128 [2021-05-02 11:50:50,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:50,423 INFO L225 Difference]: With dead ends: 2041 [2021-05-02 11:50:50,424 INFO L226 Difference]: Without dead ends: 1029 [2021-05-02 11:50:50,425 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 117.5ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-05-02 11:50:50,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2021-05-02 11:50:50,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1028. [2021-05-02 11:50:50,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 1023 states have (on average 1.4946236559139785) internal successors, (1529), 1023 states have internal predecessors, (1529), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:50,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1533 transitions. [2021-05-02 11:50:50,440 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1533 transitions. Word has length 128 [2021-05-02 11:50:50,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:50,440 INFO L480 AbstractCegarLoop]: Abstraction has 1028 states and 1533 transitions. [2021-05-02 11:50:50,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:50:50,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1533 transitions. [2021-05-02 11:50:50,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-05-02 11:50:50,442 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:50,442 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:50:50,442 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-05-02 11:50:50,442 INFO L428 AbstractCegarLoop]: === Iteration 35 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:50,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:50,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1878601165, now seen corresponding path program 1 times [2021-05-02 11:50:50,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:50,442 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759148031] [2021-05-02 11:50:50,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-02 11:50:50,540 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-02 11:50:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-02 11:50:50,631 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-02 11:50:50,680 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-05-02 11:50:50,680 INFO L624 BasicCegarLoop]: Counterexample might be feasible [2021-05-02 11:50:50,680 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-05-02 11:50:50,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 11:50:50 BoogieIcfgContainer [2021-05-02 11:50:50,786 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-02 11:50:50,787 INFO L168 Benchmark]: Toolchain (without parser) took 20637.76 ms. Allocated memory was 194.0 MB in the beginning and 368.1 MB in the end (delta: 174.1 MB). Free memory was 155.4 MB in the beginning and 175.3 MB in the end (delta: -19.9 MB). Peak memory consumption was 154.7 MB. Max. memory is 8.0 GB. [2021-05-02 11:50:50,788 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 194.0 MB. Free memory is still 174.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 11:50:50,788 INFO L168 Benchmark]: CACSL2BoogieTranslator took 428.42 ms. Allocated memory is still 194.0 MB. Free memory was 155.3 MB in the beginning and 157.7 MB in the end (delta: -2.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-05-02 11:50:50,788 INFO L168 Benchmark]: Boogie Preprocessor took 84.08 ms. Allocated memory is still 194.0 MB. Free memory was 157.7 MB in the beginning and 150.4 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. [2021-05-02 11:50:50,788 INFO L168 Benchmark]: RCFGBuilder took 807.04 ms. Allocated memory is still 194.0 MB. Free memory was 150.4 MB in the beginning and 167.8 MB in the end (delta: -17.5 MB). Peak memory consumption was 93.7 MB. Max. memory is 8.0 GB. [2021-05-02 11:50:50,788 INFO L168 Benchmark]: TraceAbstraction took 19314.70 ms. Allocated memory was 194.0 MB in the beginning and 368.1 MB in the end (delta: 174.1 MB). Free memory was 167.3 MB in the beginning and 175.3 MB in the end (delta: -8.0 MB). Peak memory consumption was 166.0 MB. Max. memory is 8.0 GB. [2021-05-02 11:50:50,788 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.09 ms. Allocated memory is still 194.0 MB. Free memory is still 174.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 428.42 ms. Allocated memory is still 194.0 MB. Free memory was 155.3 MB in the beginning and 157.7 MB in the end (delta: -2.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 84.08 ms. Allocated memory is still 194.0 MB. Free memory was 157.7 MB in the beginning and 150.4 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. * RCFGBuilder took 807.04 ms. Allocated memory is still 194.0 MB. Free memory was 150.4 MB in the beginning and 167.8 MB in the end (delta: -17.5 MB). Peak memory consumption was 93.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 19314.70 ms. Allocated memory was 194.0 MB in the beginning and 368.1 MB in the end (delta: 174.1 MB). Free memory was 167.3 MB in the beginning and 175.3 MB in the end (delta: -8.0 MB). Peak memory consumption was 166.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1647]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1332. Possible FailurePath: [L1041] static int init = 1; [L1042] static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=4294967355, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={8:0}] [L1064] SSL *s ; [L1068] s = malloc (sizeof (SSL)) [L1069] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] s->ctx = malloc(sizeof(SSL_CTX)) [L1071] s->state = 12292 [L1072] s->version = __VERIFIER_nondet_int() [L1073] CALL ssl3_connect(s) VAL [init=1, s={-3:0}, SSLv3_client_data={8:0}] [L1079] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1080] unsigned long tmp ; [L1081] unsigned long l ; [L1082] long num1 ; [L1083] void (*cb)() ; [L1084] int ret ; [L1085] int new_state ; [L1086] int state ; [L1087] int skip ; [L1088] int *tmp___0 ; [L1089] int tmp___1 = __VERIFIER_nondet_int(); [L1090] int tmp___2 = __VERIFIER_nondet_int(); [L1091] int tmp___3 ; [L1092] int tmp___4 ; [L1093] int tmp___5 ; [L1094] int tmp___6 ; [L1095] int tmp___7 ; [L1096] int tmp___8 ; [L1097] long tmp___9 ; [L1099] int blastFlag ; [L1102] blastFlag = 0 [L1103] s->state = 12292 [L1104] s->hit = __VERIFIER_nondet_int() [L1106] tmp = __VERIFIER_nondet_int() [L1107] cb = (void (*)())((void *)0) [L1108] ret = -1 [L1109] skip = 0 [L1110] tmp___0 = (int*)malloc(sizeof(int)) [L1111] *tmp___0 = 0 [L1112] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->info_callback={0:-4294967295}, skip=0, SSLv3_client_data={8:0}, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0] [L1112] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1113] EXPR s->info_callback [L1113] cb = s->info_callback [L1121] EXPR s->in_handshake [L1121] s->in_handshake += 1 [L1122] COND FALSE !(tmp___1 & 12288) VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0] [L1132] COND TRUE 1 VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->state=12292, skip=0, SSLv3_client_data={8:0}, state=12292, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0] [L1135] COND TRUE s->state == 12292 [L1238] s->new_session = 1 [L1239] s->state = 4096 [L1240] EXPR s->ctx [L1240] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1240] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1245] s->server = 0 VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=12292, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0] [L1246] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=12292, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0] [L1251] EXPR s->version VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->version=-2, skip=0, SSLv3_client_data={8:0}, state=12292, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0] [L1251] COND FALSE !((s->version & 65280) != 768) [L1257] s->type = 4096 [L1258] EXPR s->init_buf VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->init_buf={13:-12}, skip=0, SSLv3_client_data={8:0}, state=12292, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0] [L1258] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1270] tmp___4 = __VERIFIER_nondet_int() [L1271] COND FALSE !(! tmp___4) [L1277] tmp___5 = __VERIFIER_nondet_int() [L1278] COND FALSE !(! tmp___5) [L1284] s->state = 4368 [L1285] EXPR s->ctx [L1285] EXPR (s->ctx)->stats.sess_connect [L1285] (s->ctx)->stats.sess_connect += 1 [L1286] s->init_num = 0 VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=12292, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.reuse_message VAL [={0:-4294967295}, (s->s3)->tmp.reuse_message=4294967307, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={8:0}, state=12292, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1606] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1635] skip = 0 VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=12292, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1132] COND TRUE 1 VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=12292, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->state=4368, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1135] COND FALSE !(s->state == 12292) [L1138] EXPR s->state VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->state=4368, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1138] COND FALSE !(s->state == 16384) [L1141] EXPR s->state VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->state=4368, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1141] COND FALSE !(s->state == 4096) [L1144] EXPR s->state VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->state=4368, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1144] COND FALSE !(s->state == 20480) [L1147] EXPR s->state VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->state=4368, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1147] COND FALSE !(s->state == 4099) [L1150] EXPR s->state VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->state=4368, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1150] COND TRUE s->state == 4368 [L1290] s->shutdown = 0 [L1291] ret = __VERIFIER_nondet_int() [L1292] COND TRUE blastFlag == 0 [L1293] blastFlag = 1 VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1297] COND FALSE !(ret <= 0) [L1302] s->state = 4384 [L1303] s->init_num = 0 [L1304] EXPR s->bbio [L1304] EXPR s->wbio VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->bbio={17:-14}, s->wbio={-13:15}, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1304] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.reuse_message VAL [={0:-4294967295}, (s->s3)->tmp.reuse_message=4294967307, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1606] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1635] skip = 0 VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1132] COND TRUE 1 VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->state=4384, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1135] COND FALSE !(s->state == 12292) [L1138] EXPR s->state VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->state=4384, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1138] COND FALSE !(s->state == 16384) [L1141] EXPR s->state VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->state=4384, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1141] COND FALSE !(s->state == 4096) [L1144] EXPR s->state VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->state=4384, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1144] COND FALSE !(s->state == 20480) [L1147] EXPR s->state VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->state=4384, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1147] COND FALSE !(s->state == 4099) [L1150] EXPR s->state VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->state=4384, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1150] COND FALSE !(s->state == 4368) [L1153] EXPR s->state VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->state=4384, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1153] COND FALSE !(s->state == 4369) [L1156] EXPR s->state VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->state=4384, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1156] COND TRUE s->state == 4384 [L1312] ret = __VERIFIER_nondet_int() [L1313] COND TRUE blastFlag == 1 [L1314] blastFlag = 2 VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1318] COND FALSE !(ret <= 0) [L1323] s->hit VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->hit=0, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1323] COND FALSE !(s->hit) [L1326] s->state = 4400 VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1328] s->init_num = 0 VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.reuse_message VAL [={0:-4294967295}, (s->s3)->tmp.reuse_message=4294967307, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1606] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1635] skip = 0 VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1132] COND TRUE 1 VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1135] COND FALSE !(s->state == 12292) [L1138] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1138] COND FALSE !(s->state == 16384) [L1141] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1141] COND FALSE !(s->state == 4096) [L1144] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1144] COND FALSE !(s->state == 20480) [L1147] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1147] COND FALSE !(s->state == 4099) [L1150] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1150] COND FALSE !(s->state == 4368) [L1153] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1153] COND FALSE !(s->state == 4369) [L1156] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1156] COND FALSE !(s->state == 4384) [L1159] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1159] COND FALSE !(s->state == 4385) [L1162] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1162] COND TRUE s->state == 4400 [L1332] EXPR s->s3 [L1332] EXPR (s->s3)->tmp.new_cipher [L1332] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:-4294967295}, ((s->s3)->tmp.new_cipher)->algorithms=4294967314, (s->s3)->tmp.new_cipher={4294967354:18}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1332] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1335] ret = __VERIFIER_nondet_int() [L1336] COND TRUE blastFlag == 2 [L1337] blastFlag = 3 VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1341] COND FALSE !(ret <= 0) VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1347] s->state = 4416 [L1348] s->init_num = 0 VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.reuse_message VAL [={0:-4294967295}, (s->s3)->tmp.reuse_message=4294967307, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1606] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1635] skip = 0 VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1132] COND TRUE 1 VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1135] COND FALSE !(s->state == 12292) [L1138] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1138] COND FALSE !(s->state == 16384) [L1141] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1141] COND FALSE !(s->state == 4096) [L1144] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1144] COND FALSE !(s->state == 20480) [L1147] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1147] COND FALSE !(s->state == 4099) [L1150] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1150] COND FALSE !(s->state == 4368) [L1153] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1153] COND FALSE !(s->state == 4369) [L1156] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1156] COND FALSE !(s->state == 4384) [L1159] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1159] COND FALSE !(s->state == 4385) [L1162] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1162] COND FALSE !(s->state == 4400) [L1165] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1165] COND FALSE !(s->state == 4401) [L1168] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1168] COND TRUE s->state == 4416 [L1352] ret = __VERIFIER_nondet_int() [L1353] COND TRUE blastFlag == 3 [L1354] blastFlag = 4 VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1358] COND FALSE !(ret <= 0) [L1363] s->state = 4432 [L1364] s->init_num = 0 [L1365] tmp___6 = __VERIFIER_nondet_int() [L1366] COND FALSE !(! tmp___6) VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.reuse_message VAL [={0:-4294967295}, (s->s3)->tmp.reuse_message=4294967307, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1606] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1635] skip = 0 VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1132] COND TRUE 1 VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1135] COND FALSE !(s->state == 12292) [L1138] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1138] COND FALSE !(s->state == 16384) [L1141] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1141] COND FALSE !(s->state == 4096) [L1144] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1144] COND FALSE !(s->state == 20480) [L1147] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1147] COND FALSE !(s->state == 4099) [L1150] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1150] COND FALSE !(s->state == 4368) [L1153] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1153] COND FALSE !(s->state == 4369) [L1156] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1156] COND FALSE !(s->state == 4384) [L1159] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1159] COND FALSE !(s->state == 4385) [L1162] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1162] COND FALSE !(s->state == 4400) [L1165] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1165] COND FALSE !(s->state == 4401) [L1168] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1168] COND FALSE !(s->state == 4416) [L1171] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1171] COND FALSE !(s->state == 4417) [L1174] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1174] COND TRUE s->state == 4432 [L1375] ret = __VERIFIER_nondet_int() [L1376] COND FALSE !(blastFlag == 5) VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1381] COND FALSE !(ret <= 0) [L1386] s->state = 4448 [L1387] s->init_num = 0 VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.reuse_message VAL [={0:-4294967295}, (s->s3)->tmp.reuse_message=4294967307, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1606] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1635] skip = 0 VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1132] COND TRUE 1 VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1135] COND FALSE !(s->state == 12292) [L1138] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1138] COND FALSE !(s->state == 16384) [L1141] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1141] COND FALSE !(s->state == 4096) [L1144] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1144] COND FALSE !(s->state == 20480) [L1147] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1147] COND FALSE !(s->state == 4099) [L1150] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1150] COND FALSE !(s->state == 4368) [L1153] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1153] COND FALSE !(s->state == 4369) [L1156] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1156] COND FALSE !(s->state == 4384) [L1159] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1159] COND FALSE !(s->state == 4385) [L1162] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1162] COND FALSE !(s->state == 4400) [L1165] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1165] COND FALSE !(s->state == 4401) [L1168] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1168] COND FALSE !(s->state == 4416) [L1171] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1171] COND FALSE !(s->state == 4417) [L1174] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1174] COND FALSE !(s->state == 4432) [L1177] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1177] COND FALSE !(s->state == 4433) [L1180] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1180] COND TRUE s->state == 4448 [L1391] ret = __VERIFIER_nondet_int() [L1392] COND TRUE blastFlag == 4 VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=0, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1647] reach_error() VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=0, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 171 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 19175.9ms, OverallIterations: 35, TraceHistogramMax: 7, EmptinessCheckTime: 47.0ms, AutomataDifference: 15708.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 7619 SDtfs, 2645 SDslu, 9889 SDs, 0 SdLazy, 14293 SolverSat, 272 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11612.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 254 GetRequests, 103 SyntacticMatches, 21 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1248.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1028occurred in iteration=34, InterpolantAutomatonStates: 168, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 355.8ms AutomataMinimizationTime, 34 MinimizatonAttempts, 2600 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 105.0ms SsaConstructionTime, 540.4ms SatisfiabilityAnalysisTime, 2026.5ms InterpolantComputationTime, 3084 NumberOfCodeBlocks, 3084 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2907 ConstructedInterpolants, 0 QuantifiedInterpolants, 8810 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 2666/2666 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...