./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_clnt_3_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ssh-simplified/s3_clnt_3_true-unreach-call_true-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 429b7772bb057004ca0c11ab7cd7751d4a0d846f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 16:09:48,441 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 16:09:48,442 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 16:09:48,454 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 16:09:48,455 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 16:09:48,456 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 16:09:48,457 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 16:09:48,460 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 16:09:48,461 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 16:09:48,463 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 16:09:48,463 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 16:09:48,464 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 16:09:48,465 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 16:09:48,466 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 16:09:48,467 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 16:09:48,468 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 16:09:48,469 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 16:09:48,471 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 16:09:48,474 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 16:09:48,475 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 16:09:48,476 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 16:09:48,478 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 16:09:48,481 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 16:09:48,481 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 16:09:48,481 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 16:09:48,483 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 16:09:48,484 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 16:09:48,485 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 16:09:48,486 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 16:09:48,487 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 16:09:48,488 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 16:09:48,488 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 16:09:48,489 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 16:09:48,489 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 16:09:48,491 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 16:09:48,491 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 16:09:48,492 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 16:09:48,508 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 16:09:48,508 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 16:09:48,509 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 16:09:48,510 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 16:09:48,510 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 16:09:48,511 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 16:09:48,511 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 16:09:48,512 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 16:09:48,512 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 16:09:48,512 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 16:09:48,513 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 16:09:48,513 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 16:09:48,513 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 16:09:48,513 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 16:09:48,513 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 16:09:48,515 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 16:09:48,515 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 16:09:48,515 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 16:09:48,515 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 16:09:48,516 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 16:09:48,516 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 16:09:48,517 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 16:09:48,517 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 16:09:48,517 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 16:09:48,517 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 16:09:48,517 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 16:09:48,518 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 16:09:48,519 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 16:09:48,519 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 16:09:48,519 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 16:09:48,519 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 429b7772bb057004ca0c11ab7cd7751d4a0d846f [2018-11-28 16:09:48,558 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 16:09:48,573 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 16:09:48,579 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 16:09:48,581 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 16:09:48,581 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 16:09:48,582 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_clnt_3_true-unreach-call_true-termination.cil.c [2018-11-28 16:09:48,649 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23d7d98b3/d72957de1040454ba7ab46fa15adb0f4/FLAG0d4c972d3 [2018-11-28 16:09:49,132 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 16:09:49,136 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_clnt_3_true-unreach-call_true-termination.cil.c [2018-11-28 16:09:49,152 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23d7d98b3/d72957de1040454ba7ab46fa15adb0f4/FLAG0d4c972d3 [2018-11-28 16:09:49,461 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23d7d98b3/d72957de1040454ba7ab46fa15adb0f4 [2018-11-28 16:09:49,465 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 16:09:49,467 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 16:09:49,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 16:09:49,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 16:09:49,474 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 16:09:49,475 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:09:49" (1/1) ... [2018-11-28 16:09:49,478 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d80e72b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:09:49, skipping insertion in model container [2018-11-28 16:09:49,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:09:49" (1/1) ... [2018-11-28 16:09:49,487 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 16:09:49,545 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 16:09:49,877 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 16:09:49,881 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 16:09:49,958 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 16:09:49,974 INFO L195 MainTranslator]: Completed translation [2018-11-28 16:09:49,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:09:49 WrapperNode [2018-11-28 16:09:49,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 16:09:49,975 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 16:09:49,975 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 16:09:49,976 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 16:09:49,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:09:49" (1/1) ... [2018-11-28 16:09:49,994 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:09:49" (1/1) ... [2018-11-28 16:09:50,002 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 16:09:50,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 16:09:50,003 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 16:09:50,003 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 16:09:50,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:09:49" (1/1) ... [2018-11-28 16:09:50,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:09:49" (1/1) ... [2018-11-28 16:09:50,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:09:49" (1/1) ... [2018-11-28 16:09:50,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:09:49" (1/1) ... [2018-11-28 16:09:50,099 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:09:49" (1/1) ... [2018-11-28 16:09:50,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:09:49" (1/1) ... [2018-11-28 16:09:50,125 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:09:49" (1/1) ... [2018-11-28 16:09:50,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 16:09:50,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 16:09:50,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 16:09:50,130 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 16:09:50,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:09:49" (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 [2018-11-28 16:09:50,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 16:09:50,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 16:09:50,189 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-11-28 16:09:50,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-11-28 16:09:50,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 16:09:50,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 16:09:50,190 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 16:09:50,191 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 16:09:50,378 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 16:09:50,379 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 16:09:51,326 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 16:09:51,326 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 16:09:51,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:09:51 BoogieIcfgContainer [2018-11-28 16:09:51,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 16:09:51,328 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 16:09:51,328 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 16:09:51,331 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 16:09:51,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:09:49" (1/3) ... [2018-11-28 16:09:51,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c8fe25a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:09:51, skipping insertion in model container [2018-11-28 16:09:51,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:09:49" (2/3) ... [2018-11-28 16:09:51,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c8fe25a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:09:51, skipping insertion in model container [2018-11-28 16:09:51,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:09:51" (3/3) ... [2018-11-28 16:09:51,335 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3_true-unreach-call_true-termination.cil.c [2018-11-28 16:09:51,345 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 16:09:51,353 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 16:09:51,372 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 16:09:51,407 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 16:09:51,408 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 16:09:51,408 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 16:09:51,408 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 16:09:51,408 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 16:09:51,408 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 16:09:51,409 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 16:09:51,409 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 16:09:51,409 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 16:09:51,435 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2018-11-28 16:09:51,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 16:09:51,446 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:51,447 INFO L402 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] [2018-11-28 16:09:51,449 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:51,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:51,455 INFO L82 PathProgramCache]: Analyzing trace with hash 173387410, now seen corresponding path program 1 times [2018-11-28 16:09:51,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:51,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:51,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:51,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:51,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:51,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:09:51,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:51,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:51,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:51,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:51,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:51,783 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2018-11-28 16:09:51,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:51,952 INFO L93 Difference]: Finished difference Result 377 states and 634 transitions. [2018-11-28 16:09:51,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:51,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-28 16:09:51,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:51,983 INFO L225 Difference]: With dead ends: 377 [2018-11-28 16:09:51,983 INFO L226 Difference]: Without dead ends: 220 [2018-11-28 16:09:51,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:52,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-11-28 16:09:52,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-11-28 16:09:52,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-11-28 16:09:52,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 326 transitions. [2018-11-28 16:09:52,060 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 326 transitions. Word has length 29 [2018-11-28 16:09:52,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:52,060 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 326 transitions. [2018-11-28 16:09:52,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:52,061 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 326 transitions. [2018-11-28 16:09:52,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-28 16:09:52,065 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:52,069 INFO L402 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] [2018-11-28 16:09:52,069 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:52,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:52,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1098416379, now seen corresponding path program 1 times [2018-11-28 16:09:52,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:52,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:52,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:52,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:52,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:52,206 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:09:52,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:52,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:52,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:52,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:52,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:52,210 INFO L87 Difference]: Start difference. First operand 220 states and 326 transitions. Second operand 3 states. [2018-11-28 16:09:52,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:52,832 INFO L93 Difference]: Finished difference Result 472 states and 710 transitions. [2018-11-28 16:09:52,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:52,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-11-28 16:09:52,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:52,838 INFO L225 Difference]: With dead ends: 472 [2018-11-28 16:09:52,839 INFO L226 Difference]: Without dead ends: 264 [2018-11-28 16:09:52,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:52,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-11-28 16:09:52,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 254. [2018-11-28 16:09:52,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-11-28 16:09:52,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 370 transitions. [2018-11-28 16:09:52,864 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 370 transitions. Word has length 43 [2018-11-28 16:09:52,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:52,865 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 370 transitions. [2018-11-28 16:09:52,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:52,865 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 370 transitions. [2018-11-28 16:09:52,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 16:09:52,868 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:52,869 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:09:52,869 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:52,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:52,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1571737336, now seen corresponding path program 1 times [2018-11-28 16:09:52,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:52,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:52,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:52,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:52,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:52,964 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 16:09:52,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:52,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:52,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:52,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:52,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:52,966 INFO L87 Difference]: Start difference. First operand 254 states and 370 transitions. Second operand 3 states. [2018-11-28 16:09:53,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:53,440 INFO L93 Difference]: Finished difference Result 598 states and 902 transitions. [2018-11-28 16:09:53,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:53,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-11-28 16:09:53,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:53,448 INFO L225 Difference]: With dead ends: 598 [2018-11-28 16:09:53,448 INFO L226 Difference]: Without dead ends: 354 [2018-11-28 16:09:53,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:53,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-11-28 16:09:53,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 336. [2018-11-28 16:09:53,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-11-28 16:09:53,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 470 transitions. [2018-11-28 16:09:53,480 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 470 transitions. Word has length 60 [2018-11-28 16:09:53,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:53,482 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 470 transitions. [2018-11-28 16:09:53,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:53,482 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 470 transitions. [2018-11-28 16:09:53,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 16:09:53,486 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:53,486 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:09:53,487 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:53,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:53,488 INFO L82 PathProgramCache]: Analyzing trace with hash -233700998, now seen corresponding path program 1 times [2018-11-28 16:09:53,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:53,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:53,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:53,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:53,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:53,610 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 16:09:53,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:53,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:53,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:53,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:53,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:53,613 INFO L87 Difference]: Start difference. First operand 336 states and 470 transitions. Second operand 3 states. [2018-11-28 16:09:53,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:53,891 INFO L93 Difference]: Finished difference Result 708 states and 1005 transitions. [2018-11-28 16:09:53,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:53,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-11-28 16:09:53,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:53,894 INFO L225 Difference]: With dead ends: 708 [2018-11-28 16:09:53,894 INFO L226 Difference]: Without dead ends: 384 [2018-11-28 16:09:53,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:53,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-11-28 16:09:53,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 374. [2018-11-28 16:09:53,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-11-28 16:09:53,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 518 transitions. [2018-11-28 16:09:53,914 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 518 transitions. Word has length 60 [2018-11-28 16:09:53,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:53,915 INFO L480 AbstractCegarLoop]: Abstraction has 374 states and 518 transitions. [2018-11-28 16:09:53,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:53,915 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 518 transitions. [2018-11-28 16:09:53,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-28 16:09:53,919 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:53,920 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:09:53,920 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:53,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:53,920 INFO L82 PathProgramCache]: Analyzing trace with hash -343872958, now seen corresponding path program 1 times [2018-11-28 16:09:53,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:53,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:53,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:53,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:53,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:53,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:54,088 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 16:09:54,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:54,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:54,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:54,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:54,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:54,093 INFO L87 Difference]: Start difference. First operand 374 states and 518 transitions. Second operand 3 states. [2018-11-28 16:09:54,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:54,399 INFO L93 Difference]: Finished difference Result 842 states and 1204 transitions. [2018-11-28 16:09:54,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:54,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-11-28 16:09:54,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:54,405 INFO L225 Difference]: With dead ends: 842 [2018-11-28 16:09:54,405 INFO L226 Difference]: Without dead ends: 478 [2018-11-28 16:09:54,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:54,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-11-28 16:09:54,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 452. [2018-11-28 16:09:54,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-11-28 16:09:54,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 652 transitions. [2018-11-28 16:09:54,427 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 652 transitions. Word has length 73 [2018-11-28 16:09:54,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:54,427 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 652 transitions. [2018-11-28 16:09:54,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:54,428 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 652 transitions. [2018-11-28 16:09:54,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-28 16:09:54,431 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:54,431 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:09:54,431 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:54,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:54,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1570407527, now seen corresponding path program 1 times [2018-11-28 16:09:54,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:54,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:54,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:54,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:54,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:54,513 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-28 16:09:54,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:54,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:54,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:54,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:54,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:54,515 INFO L87 Difference]: Start difference. First operand 452 states and 652 transitions. Second operand 3 states. [2018-11-28 16:09:54,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:54,973 INFO L93 Difference]: Finished difference Result 940 states and 1365 transitions. [2018-11-28 16:09:54,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:54,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-11-28 16:09:54,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:54,980 INFO L225 Difference]: With dead ends: 940 [2018-11-28 16:09:54,980 INFO L226 Difference]: Without dead ends: 500 [2018-11-28 16:09:54,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:54,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-11-28 16:09:54,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 494. [2018-11-28 16:09:54,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-11-28 16:09:55,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 704 transitions. [2018-11-28 16:09:55,001 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 704 transitions. Word has length 77 [2018-11-28 16:09:55,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:55,002 INFO L480 AbstractCegarLoop]: Abstraction has 494 states and 704 transitions. [2018-11-28 16:09:55,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:55,002 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 704 transitions. [2018-11-28 16:09:55,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-28 16:09:55,004 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:55,005 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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] [2018-11-28 16:09:55,005 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:55,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:55,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1356861727, now seen corresponding path program 1 times [2018-11-28 16:09:55,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:55,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:55,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:55,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:55,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:55,133 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-28 16:09:55,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:55,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:55,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:55,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:55,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:55,142 INFO L87 Difference]: Start difference. First operand 494 states and 704 transitions. Second operand 3 states. [2018-11-28 16:09:55,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:55,376 INFO L93 Difference]: Finished difference Result 976 states and 1397 transitions. [2018-11-28 16:09:55,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:55,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-11-28 16:09:55,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:55,383 INFO L225 Difference]: With dead ends: 976 [2018-11-28 16:09:55,383 INFO L226 Difference]: Without dead ends: 734 [2018-11-28 16:09:55,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:55,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-11-28 16:09:55,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2018-11-28 16:09:55,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-11-28 16:09:55,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1047 transitions. [2018-11-28 16:09:55,412 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1047 transitions. Word has length 97 [2018-11-28 16:09:55,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:55,413 INFO L480 AbstractCegarLoop]: Abstraction has 734 states and 1047 transitions. [2018-11-28 16:09:55,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:55,450 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1047 transitions. [2018-11-28 16:09:55,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 16:09:55,454 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:55,454 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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] [2018-11-28 16:09:55,455 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:55,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:55,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1774863991, now seen corresponding path program 1 times [2018-11-28 16:09:55,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:55,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:55,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:55,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:55,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:55,608 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-28 16:09:55,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:55,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:55,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:55,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:55,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:55,610 INFO L87 Difference]: Start difference. First operand 734 states and 1047 transitions. Second operand 3 states. [2018-11-28 16:09:55,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:55,966 INFO L93 Difference]: Finished difference Result 976 states and 1394 transitions. [2018-11-28 16:09:55,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:55,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-11-28 16:09:55,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:55,973 INFO L225 Difference]: With dead ends: 976 [2018-11-28 16:09:55,974 INFO L226 Difference]: Without dead ends: 974 [2018-11-28 16:09:55,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:55,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2018-11-28 16:09:55,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2018-11-28 16:09:55,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2018-11-28 16:09:56,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1392 transitions. [2018-11-28 16:09:56,003 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1392 transitions. Word has length 99 [2018-11-28 16:09:56,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:56,004 INFO L480 AbstractCegarLoop]: Abstraction has 974 states and 1392 transitions. [2018-11-28 16:09:56,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:56,004 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1392 transitions. [2018-11-28 16:09:56,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-28 16:09:56,007 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:56,007 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:09:56,008 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:56,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:56,008 INFO L82 PathProgramCache]: Analyzing trace with hash 600728947, now seen corresponding path program 1 times [2018-11-28 16:09:56,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:56,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:56,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:56,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:56,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:56,144 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-11-28 16:09:56,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:56,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:56,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:56,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:56,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:56,146 INFO L87 Difference]: Start difference. First operand 974 states and 1392 transitions. Second operand 3 states. [2018-11-28 16:09:56,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:56,953 INFO L93 Difference]: Finished difference Result 2140 states and 3108 transitions. [2018-11-28 16:09:56,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:56,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2018-11-28 16:09:56,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:56,962 INFO L225 Difference]: With dead ends: 2140 [2018-11-28 16:09:56,962 INFO L226 Difference]: Without dead ends: 1170 [2018-11-28 16:09:56,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:56,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2018-11-28 16:09:56,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1130. [2018-11-28 16:09:56,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2018-11-28 16:09:57,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1632 transitions. [2018-11-28 16:09:57,001 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1632 transitions. Word has length 154 [2018-11-28 16:09:57,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:57,002 INFO L480 AbstractCegarLoop]: Abstraction has 1130 states and 1632 transitions. [2018-11-28 16:09:57,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:57,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1632 transitions. [2018-11-28 16:09:57,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-28 16:09:57,006 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:57,006 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:09:57,007 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:57,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:57,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1176011842, now seen corresponding path program 1 times [2018-11-28 16:09:57,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:57,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:57,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:57,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:57,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:57,136 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-11-28 16:09:57,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:57,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:57,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:57,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:57,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:57,138 INFO L87 Difference]: Start difference. First operand 1130 states and 1632 transitions. Second operand 3 states. [2018-11-28 16:09:57,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:57,532 INFO L93 Difference]: Finished difference Result 2354 states and 3378 transitions. [2018-11-28 16:09:57,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:57,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2018-11-28 16:09:57,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:57,540 INFO L225 Difference]: With dead ends: 2354 [2018-11-28 16:09:57,540 INFO L226 Difference]: Without dead ends: 1236 [2018-11-28 16:09:57,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:57,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2018-11-28 16:09:57,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1222. [2018-11-28 16:09:57,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2018-11-28 16:09:57,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1744 transitions. [2018-11-28 16:09:57,577 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1744 transitions. Word has length 190 [2018-11-28 16:09:57,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:57,578 INFO L480 AbstractCegarLoop]: Abstraction has 1222 states and 1744 transitions. [2018-11-28 16:09:57,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:57,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1744 transitions. [2018-11-28 16:09:57,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-28 16:09:57,582 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:57,583 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:09:57,583 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:57,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:57,583 INFO L82 PathProgramCache]: Analyzing trace with hash -717257595, now seen corresponding path program 1 times [2018-11-28 16:09:57,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:57,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:57,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:57,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:57,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:57,672 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 394 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-11-28 16:09:57,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:57,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:57,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:57,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:57,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:57,674 INFO L87 Difference]: Start difference. First operand 1222 states and 1744 transitions. Second operand 3 states. [2018-11-28 16:09:58,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:58,221 INFO L93 Difference]: Finished difference Result 2544 states and 3620 transitions. [2018-11-28 16:09:58,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:58,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-11-28 16:09:58,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:58,232 INFO L225 Difference]: With dead ends: 2544 [2018-11-28 16:09:58,233 INFO L226 Difference]: Without dead ends: 1334 [2018-11-28 16:09:58,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:58,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2018-11-28 16:09:58,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1322. [2018-11-28 16:09:58,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2018-11-28 16:09:58,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1864 transitions. [2018-11-28 16:09:58,278 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1864 transitions. Word has length 211 [2018-11-28 16:09:58,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:58,279 INFO L480 AbstractCegarLoop]: Abstraction has 1322 states and 1864 transitions. [2018-11-28 16:09:58,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:58,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1864 transitions. [2018-11-28 16:09:58,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-11-28 16:09:58,285 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:58,286 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:09:58,287 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:58,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:58,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1079909240, now seen corresponding path program 1 times [2018-11-28 16:09:58,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:58,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:58,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:58,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:58,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:58,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:58,469 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-28 16:09:58,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:58,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:58,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:58,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:58,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:58,473 INFO L87 Difference]: Start difference. First operand 1322 states and 1864 transitions. Second operand 3 states. [2018-11-28 16:09:59,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:59,016 INFO L93 Difference]: Finished difference Result 2752 states and 3872 transitions. [2018-11-28 16:09:59,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:59,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2018-11-28 16:09:59,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:59,025 INFO L225 Difference]: With dead ends: 2752 [2018-11-28 16:09:59,026 INFO L226 Difference]: Without dead ends: 1442 [2018-11-28 16:09:59,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:59,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2018-11-28 16:09:59,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1434. [2018-11-28 16:09:59,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2018-11-28 16:09:59,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1996 transitions. [2018-11-28 16:09:59,068 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1996 transitions. Word has length 235 [2018-11-28 16:09:59,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:59,068 INFO L480 AbstractCegarLoop]: Abstraction has 1434 states and 1996 transitions. [2018-11-28 16:09:59,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:59,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1996 transitions. [2018-11-28 16:09:59,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-11-28 16:09:59,074 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:59,074 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:09:59,074 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:59,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:59,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1213171786, now seen corresponding path program 1 times [2018-11-28 16:09:59,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:59,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:59,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:59,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:59,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:59,218 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-28 16:09:59,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:59,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:59,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:59,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:59,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:59,219 INFO L87 Difference]: Start difference. First operand 1434 states and 1996 transitions. Second operand 3 states. [2018-11-28 16:10:00,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:00,276 INFO L93 Difference]: Finished difference Result 2992 states and 4172 transitions. [2018-11-28 16:10:00,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:00,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2018-11-28 16:10:00,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:00,286 INFO L225 Difference]: With dead ends: 2992 [2018-11-28 16:10:00,286 INFO L226 Difference]: Without dead ends: 1570 [2018-11-28 16:10:00,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:00,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2018-11-28 16:10:00,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1558. [2018-11-28 16:10:00,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-11-28 16:10:00,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2140 transitions. [2018-11-28 16:10:00,327 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2140 transitions. Word has length 235 [2018-11-28 16:10:00,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:00,327 INFO L480 AbstractCegarLoop]: Abstraction has 1558 states and 2140 transitions. [2018-11-28 16:10:00,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:00,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2140 transitions. [2018-11-28 16:10:00,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-11-28 16:10:00,333 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:00,333 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:00,333 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:00,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:00,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1569112328, now seen corresponding path program 1 times [2018-11-28 16:10:00,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:00,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:00,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:00,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:00,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:00,442 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 588 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-11-28 16:10:00,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:00,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:00,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:00,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:00,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:00,444 INFO L87 Difference]: Start difference. First operand 1558 states and 2140 transitions. Second operand 3 states. [2018-11-28 16:10:00,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:00,497 INFO L93 Difference]: Finished difference Result 4646 states and 6384 transitions. [2018-11-28 16:10:00,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:00,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2018-11-28 16:10:00,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:00,515 INFO L225 Difference]: With dead ends: 4646 [2018-11-28 16:10:00,516 INFO L226 Difference]: Without dead ends: 3100 [2018-11-28 16:10:00,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:00,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2018-11-28 16:10:00,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 3098. [2018-11-28 16:10:00,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3098 states. [2018-11-28 16:10:00,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4255 transitions. [2018-11-28 16:10:00,596 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4255 transitions. Word has length 265 [2018-11-28 16:10:00,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:00,597 INFO L480 AbstractCegarLoop]: Abstraction has 3098 states and 4255 transitions. [2018-11-28 16:10:00,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:00,597 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4255 transitions. [2018-11-28 16:10:00,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-11-28 16:10:00,607 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:00,607 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:00,607 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:00,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:00,608 INFO L82 PathProgramCache]: Analyzing trace with hash 432773942, now seen corresponding path program 1 times [2018-11-28 16:10:00,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:00,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:00,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:00,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:00,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:00,761 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 560 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2018-11-28 16:10:00,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:00,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:00,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:00,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:00,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:00,765 INFO L87 Difference]: Start difference. First operand 3098 states and 4255 transitions. Second operand 3 states. [2018-11-28 16:10:01,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:01,279 INFO L93 Difference]: Finished difference Result 6484 states and 8938 transitions. [2018-11-28 16:10:01,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:01,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2018-11-28 16:10:01,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:01,301 INFO L225 Difference]: With dead ends: 6484 [2018-11-28 16:10:01,301 INFO L226 Difference]: Without dead ends: 3398 [2018-11-28 16:10:01,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:01,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2018-11-28 16:10:01,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3382. [2018-11-28 16:10:01,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3382 states. [2018-11-28 16:10:01,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 4579 transitions. [2018-11-28 16:10:01,399 INFO L78 Accepts]: Start accepts. Automaton has 3382 states and 4579 transitions. Word has length 265 [2018-11-28 16:10:01,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:01,400 INFO L480 AbstractCegarLoop]: Abstraction has 3382 states and 4579 transitions. [2018-11-28 16:10:01,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:01,402 INFO L276 IsEmpty]: Start isEmpty. Operand 3382 states and 4579 transitions. [2018-11-28 16:10:01,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-11-28 16:10:01,415 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:01,416 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:01,417 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:01,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:01,417 INFO L82 PathProgramCache]: Analyzing trace with hash -764797682, now seen corresponding path program 1 times [2018-11-28 16:10:01,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:01,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:01,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:01,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:01,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:01,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1100 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2018-11-28 16:10:01,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:01,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:01,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:01,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:01,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:01,627 INFO L87 Difference]: Start difference. First operand 3382 states and 4579 transitions. Second operand 3 states. [2018-11-28 16:10:02,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:02,172 INFO L93 Difference]: Finished difference Result 6900 states and 9354 transitions. [2018-11-28 16:10:02,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:02,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 289 [2018-11-28 16:10:02,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:02,192 INFO L225 Difference]: With dead ends: 6900 [2018-11-28 16:10:02,192 INFO L226 Difference]: Without dead ends: 3530 [2018-11-28 16:10:02,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:02,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3530 states. [2018-11-28 16:10:02,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 3514. [2018-11-28 16:10:02,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2018-11-28 16:10:02,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 4731 transitions. [2018-11-28 16:10:02,275 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 4731 transitions. Word has length 289 [2018-11-28 16:10:02,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:02,276 INFO L480 AbstractCegarLoop]: Abstraction has 3514 states and 4731 transitions. [2018-11-28 16:10:02,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:02,276 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 4731 transitions. [2018-11-28 16:10:02,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-11-28 16:10:02,286 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:02,287 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:02,287 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:02,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:02,287 INFO L82 PathProgramCache]: Analyzing trace with hash 2053251468, now seen corresponding path program 1 times [2018-11-28 16:10:02,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:02,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:02,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:02,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:02,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:02,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1112 backedges. 542 proven. 0 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2018-11-28 16:10:02,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:02,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:02,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:02,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:02,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:02,438 INFO L87 Difference]: Start difference. First operand 3514 states and 4731 transitions. Second operand 3 states. [2018-11-28 16:10:03,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:03,118 INFO L93 Difference]: Finished difference Result 7416 states and 10118 transitions. [2018-11-28 16:10:03,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:03,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2018-11-28 16:10:03,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:03,141 INFO L225 Difference]: With dead ends: 7416 [2018-11-28 16:10:03,141 INFO L226 Difference]: Without dead ends: 3914 [2018-11-28 16:10:03,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:03,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3914 states. [2018-11-28 16:10:03,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3914 to 3826. [2018-11-28 16:10:03,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2018-11-28 16:10:03,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 5099 transitions. [2018-11-28 16:10:03,225 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 5099 transitions. Word has length 300 [2018-11-28 16:10:03,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:03,226 INFO L480 AbstractCegarLoop]: Abstraction has 3826 states and 5099 transitions. [2018-11-28 16:10:03,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:03,226 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 5099 transitions. [2018-11-28 16:10:03,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-11-28 16:10:03,239 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:03,240 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:03,240 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:03,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:03,240 INFO L82 PathProgramCache]: Analyzing trace with hash 816481962, now seen corresponding path program 1 times [2018-11-28 16:10:03,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:03,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:03,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:03,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:03,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:03,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 595 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2018-11-28 16:10:03,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:03,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:03,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:03,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:03,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:03,398 INFO L87 Difference]: Start difference. First operand 3826 states and 5099 transitions. Second operand 3 states. [2018-11-28 16:10:04,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:04,474 INFO L93 Difference]: Finished difference Result 8048 states and 10662 transitions. [2018-11-28 16:10:04,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:04,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2018-11-28 16:10:04,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:04,514 INFO L225 Difference]: With dead ends: 8048 [2018-11-28 16:10:04,516 INFO L226 Difference]: Without dead ends: 4234 [2018-11-28 16:10:04,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:04,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4234 states. [2018-11-28 16:10:04,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4234 to 3946. [2018-11-28 16:10:04,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3946 states. [2018-11-28 16:10:04,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 5243 transitions. [2018-11-28 16:10:04,607 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 5243 transitions. Word has length 314 [2018-11-28 16:10:04,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:04,608 INFO L480 AbstractCegarLoop]: Abstraction has 3946 states and 5243 transitions. [2018-11-28 16:10:04,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:04,608 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 5243 transitions. [2018-11-28 16:10:04,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-11-28 16:10:04,616 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:04,616 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:04,617 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:04,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:04,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1006853977, now seen corresponding path program 1 times [2018-11-28 16:10:04,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:04,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:04,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:04,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:04,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:04,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 707 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2018-11-28 16:10:04,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:04,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:04,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:04,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:04,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:04,813 INFO L87 Difference]: Start difference. First operand 3946 states and 5243 transitions. Second operand 3 states. [2018-11-28 16:10:05,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:05,004 INFO L93 Difference]: Finished difference Result 11310 states and 15105 transitions. [2018-11-28 16:10:05,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:05,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2018-11-28 16:10:05,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:05,027 INFO L225 Difference]: With dead ends: 11310 [2018-11-28 16:10:05,028 INFO L226 Difference]: Without dead ends: 7376 [2018-11-28 16:10:05,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:05,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7376 states. [2018-11-28 16:10:05,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7376 to 7374. [2018-11-28 16:10:05,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7374 states. [2018-11-28 16:10:05,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7374 states to 7374 states and 9853 transitions. [2018-11-28 16:10:05,156 INFO L78 Accepts]: Start accepts. Automaton has 7374 states and 9853 transitions. Word has length 315 [2018-11-28 16:10:05,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:05,157 INFO L480 AbstractCegarLoop]: Abstraction has 7374 states and 9853 transitions. [2018-11-28 16:10:05,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:05,157 INFO L276 IsEmpty]: Start isEmpty. Operand 7374 states and 9853 transitions. [2018-11-28 16:10:05,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-11-28 16:10:05,169 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:05,169 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:05,170 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:05,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:05,170 INFO L82 PathProgramCache]: Analyzing trace with hash 999089455, now seen corresponding path program 1 times [2018-11-28 16:10:05,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:05,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:05,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:05,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:05,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:05,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 711 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-11-28 16:10:05,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:05,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:05,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:05,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:05,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:05,320 INFO L87 Difference]: Start difference. First operand 7374 states and 9853 transitions. Second operand 3 states. [2018-11-28 16:10:06,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:06,138 INFO L93 Difference]: Finished difference Result 14744 states and 19682 transitions. [2018-11-28 16:10:06,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:06,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2018-11-28 16:10:06,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:06,158 INFO L225 Difference]: With dead ends: 14744 [2018-11-28 16:10:06,158 INFO L226 Difference]: Without dead ends: 7382 [2018-11-28 16:10:06,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:06,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2018-11-28 16:10:06,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7350. [2018-11-28 16:10:06,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7350 states. [2018-11-28 16:10:06,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7350 states to 7350 states and 9573 transitions. [2018-11-28 16:10:06,344 INFO L78 Accepts]: Start accepts. Automaton has 7350 states and 9573 transitions. Word has length 316 [2018-11-28 16:10:06,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:06,345 INFO L480 AbstractCegarLoop]: Abstraction has 7350 states and 9573 transitions. [2018-11-28 16:10:06,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:06,345 INFO L276 IsEmpty]: Start isEmpty. Operand 7350 states and 9573 transitions. [2018-11-28 16:10:06,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-11-28 16:10:06,363 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:06,363 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:06,364 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:06,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:06,364 INFO L82 PathProgramCache]: Analyzing trace with hash -901585188, now seen corresponding path program 1 times [2018-11-28 16:10:06,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:06,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:06,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:06,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:06,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:06,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1348 backedges. 766 proven. 12 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2018-11-28 16:10:06,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:10:06,705 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:10:06,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:06,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:10:07,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1348 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 1244 trivial. 0 not checked. [2018-11-28 16:10:07,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 16:10:07,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2018-11-28 16:10:07,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 16:10:07,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 16:10:07,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 16:10:07,278 INFO L87 Difference]: Start difference. First operand 7350 states and 9573 transitions. Second operand 7 states. [2018-11-28 16:10:09,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:09,878 INFO L93 Difference]: Finished difference Result 18408 states and 23982 transitions. [2018-11-28 16:10:09,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 16:10:09,880 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 339 [2018-11-28 16:10:09,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:09,903 INFO L225 Difference]: With dead ends: 18408 [2018-11-28 16:10:09,903 INFO L226 Difference]: Without dead ends: 11034 [2018-11-28 16:10:09,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-28 16:10:09,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11034 states. [2018-11-28 16:10:10,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11034 to 8460. [2018-11-28 16:10:10,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8460 states. [2018-11-28 16:10:10,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8460 states to 8460 states and 11077 transitions. [2018-11-28 16:10:10,172 INFO L78 Accepts]: Start accepts. Automaton has 8460 states and 11077 transitions. Word has length 339 [2018-11-28 16:10:10,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:10,173 INFO L480 AbstractCegarLoop]: Abstraction has 8460 states and 11077 transitions. [2018-11-28 16:10:10,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 16:10:10,173 INFO L276 IsEmpty]: Start isEmpty. Operand 8460 states and 11077 transitions. [2018-11-28 16:10:10,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-11-28 16:10:10,188 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:10,188 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:10,189 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:10,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:10,189 INFO L82 PathProgramCache]: Analyzing trace with hash -2002133556, now seen corresponding path program 1 times [2018-11-28 16:10:10,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:10,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:10,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:10,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:10,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:10,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 843 proven. 5 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2018-11-28 16:10:10,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:10:10,571 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:10:10,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:10,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:10:10,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 636 proven. 0 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2018-11-28 16:10:10,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 16:10:10,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-28 16:10:10,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 16:10:10,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 16:10:10,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 16:10:10,930 INFO L87 Difference]: Start difference. First operand 8460 states and 11077 transitions. Second operand 5 states. [2018-11-28 16:10:12,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:12,262 INFO L93 Difference]: Finished difference Result 18174 states and 23220 transitions. [2018-11-28 16:10:12,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 16:10:12,267 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 365 [2018-11-28 16:10:12,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:12,287 INFO L225 Difference]: With dead ends: 18174 [2018-11-28 16:10:12,287 INFO L226 Difference]: Without dead ends: 9724 [2018-11-28 16:10:12,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 16:10:12,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9724 states. [2018-11-28 16:10:12,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9724 to 7985. [2018-11-28 16:10:12,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7985 states. [2018-11-28 16:10:12,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7985 states to 7985 states and 9973 transitions. [2018-11-28 16:10:12,480 INFO L78 Accepts]: Start accepts. Automaton has 7985 states and 9973 transitions. Word has length 365 [2018-11-28 16:10:12,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:12,481 INFO L480 AbstractCegarLoop]: Abstraction has 7985 states and 9973 transitions. [2018-11-28 16:10:12,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 16:10:12,481 INFO L276 IsEmpty]: Start isEmpty. Operand 7985 states and 9973 transitions. [2018-11-28 16:10:12,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-11-28 16:10:12,495 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:12,495 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:12,495 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:12,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:12,496 INFO L82 PathProgramCache]: Analyzing trace with hash -885260259, now seen corresponding path program 1 times [2018-11-28 16:10:12,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:12,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:12,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:12,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:12,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:12,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2018-11-28 16:10:12,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:12,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:12,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:12,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:12,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:12,766 INFO L87 Difference]: Start difference. First operand 7985 states and 9973 transitions. Second operand 3 states. [2018-11-28 16:10:13,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:13,747 INFO L93 Difference]: Finished difference Result 15351 states and 18826 transitions. [2018-11-28 16:10:13,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:13,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 418 [2018-11-28 16:10:13,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:13,755 INFO L225 Difference]: With dead ends: 15351 [2018-11-28 16:10:13,755 INFO L226 Difference]: Without dead ends: 3759 [2018-11-28 16:10:13,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:13,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3759 states. [2018-11-28 16:10:13,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3759 to 3524. [2018-11-28 16:10:13,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3524 states. [2018-11-28 16:10:13,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3524 states to 3524 states and 4353 transitions. [2018-11-28 16:10:13,834 INFO L78 Accepts]: Start accepts. Automaton has 3524 states and 4353 transitions. Word has length 418 [2018-11-28 16:10:13,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:13,835 INFO L480 AbstractCegarLoop]: Abstraction has 3524 states and 4353 transitions. [2018-11-28 16:10:13,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:13,835 INFO L276 IsEmpty]: Start isEmpty. Operand 3524 states and 4353 transitions. [2018-11-28 16:10:13,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2018-11-28 16:10:13,844 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:13,845 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:13,845 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:13,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:13,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1596843861, now seen corresponding path program 1 times [2018-11-28 16:10:13,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:13,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:13,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:13,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:13,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:14,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1571 proven. 14 refuted. 0 times theorem prover too weak. 1126 trivial. 0 not checked. [2018-11-28 16:10:14,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:10:14,164 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:10:14,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:14,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:10:14,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1018 proven. 0 refuted. 0 times theorem prover too weak. 1693 trivial. 0 not checked. [2018-11-28 16:10:14,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 16:10:14,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-28 16:10:14,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 16:10:14,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 16:10:14,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 16:10:14,674 INFO L87 Difference]: Start difference. First operand 3524 states and 4353 transitions. Second operand 5 states. [2018-11-28 16:10:14,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:14,926 INFO L93 Difference]: Finished difference Result 4022 states and 4980 transitions. [2018-11-28 16:10:14,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 16:10:14,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 502 [2018-11-28 16:10:14,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:14,927 INFO L225 Difference]: With dead ends: 4022 [2018-11-28 16:10:14,928 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 16:10:14,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 504 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 16:10:14,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 16:10:14,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 16:10:14,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 16:10:14,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 16:10:14,936 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 502 [2018-11-28 16:10:14,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:14,937 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 16:10:14,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 16:10:14,937 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 16:10:14,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 16:10:14,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 16:10:14,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:14,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:14,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:14,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:14,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:15,714 WARN L180 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 411 DAG size of output: 104 [2018-11-28 16:10:16,485 WARN L180 SmtUtils]: Spent 768.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 21 [2018-11-28 16:10:16,710 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2018-11-28 16:10:18,119 WARN L180 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2018-11-28 16:10:18,124 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 16:10:18,125 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 16:10:18,125 INFO L451 ceAbstractionStarter]: At program point L564(lines 107 565) the Hoare annotation is: true [2018-11-28 16:10:18,125 INFO L448 ceAbstractionStarter]: For program point L201(lines 201 514) no Hoare annotation was computed. [2018-11-28 16:10:18,125 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 525) no Hoare annotation was computed. [2018-11-28 16:10:18,125 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 536) no Hoare annotation was computed. [2018-11-28 16:10:18,125 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 106) no Hoare annotation was computed. [2018-11-28 16:10:18,126 INFO L444 ceAbstractionStarter]: At program point L202(lines 198 515) the Hoare annotation is: (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (= ssl3_connect_~s__hit~0 0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse2 (not .cse1)))) [2018-11-28 16:10:18,126 INFO L444 ceAbstractionStarter]: At program point L136(lines 132 537) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560))) [2018-11-28 16:10:18,126 INFO L448 ceAbstractionStarter]: For program point L103(lines 103 105) no Hoare annotation was computed. [2018-11-28 16:10:18,126 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 252) no Hoare annotation was computed. [2018-11-28 16:10:18,126 INFO L448 ceAbstractionStarter]: For program point L236-2(lines 211 509) no Hoare annotation was computed. [2018-11-28 16:10:18,126 INFO L448 ceAbstractionStarter]: For program point L468(lines 468 480) no Hoare annotation was computed. [2018-11-28 16:10:18,126 INFO L448 ceAbstractionStarter]: For program point L435(lines 435 449) no Hoare annotation was computed. [2018-11-28 16:10:18,126 INFO L448 ceAbstractionStarter]: For program point L435-1(lines 435 449) no Hoare annotation was computed. [2018-11-28 16:10:18,126 INFO L448 ceAbstractionStarter]: For program point L468-2(lines 468 480) no Hoare annotation was computed. [2018-11-28 16:10:18,127 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 339) no Hoare annotation was computed. [2018-11-28 16:10:18,127 INFO L448 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2018-11-28 16:10:18,127 INFO L448 ceAbstractionStarter]: For program point L204(lines 204 513) no Hoare annotation was computed. [2018-11-28 16:10:18,127 INFO L448 ceAbstractionStarter]: For program point L270-2(lines 211 509) no Hoare annotation was computed. [2018-11-28 16:10:18,127 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 524) no Hoare annotation was computed. [2018-11-28 16:10:18,127 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 535) no Hoare annotation was computed. [2018-11-28 16:10:18,127 INFO L448 ceAbstractionStarter]: For program point L502(lines 502 504) no Hoare annotation was computed. [2018-11-28 16:10:18,127 INFO L444 ceAbstractionStarter]: At program point L205(lines 204 513) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 2) (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1 (not .cse2)))) [2018-11-28 16:10:18,127 INFO L444 ceAbstractionStarter]: At program point L172(lines 162 527) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and (and .cse0 .cse1 (<= ssl3_connect_~blastFlag~0 4)) .cse2))) [2018-11-28 16:10:18,128 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 571) no Hoare annotation was computed. [2018-11-28 16:10:18,128 INFO L448 ceAbstractionStarter]: For program point L569-2(lines 569 571) no Hoare annotation was computed. [2018-11-28 16:10:18,128 INFO L448 ceAbstractionStarter]: For program point L371(lines 371 373) no Hoare annotation was computed. [2018-11-28 16:10:18,128 INFO L448 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 573) no Hoare annotation was computed. [2018-11-28 16:10:18,128 INFO L448 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2018-11-28 16:10:18,128 INFO L448 ceAbstractionStarter]: For program point L207(lines 207 512) no Hoare annotation was computed. [2018-11-28 16:10:18,128 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 523) no Hoare annotation was computed. [2018-11-28 16:10:18,128 INFO L448 ceAbstractionStarter]: For program point L141(lines 141 534) no Hoare annotation was computed. [2018-11-28 16:10:18,128 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 85 575) no Hoare annotation was computed. [2018-11-28 16:10:18,128 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 445) no Hoare annotation was computed. [2018-11-28 16:10:18,129 INFO L451 ceAbstractionStarter]: At program point L208(lines 207 512) the Hoare annotation is: true [2018-11-28 16:10:18,129 INFO L444 ceAbstractionStarter]: At program point L142(lines 138 535) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2018-11-28 16:10:18,129 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-28 16:10:18,129 INFO L448 ceAbstractionStarter]: For program point L242(lines 242 245) no Hoare annotation was computed. [2018-11-28 16:10:18,129 INFO L448 ceAbstractionStarter]: For program point L474(lines 474 477) no Hoare annotation was computed. [2018-11-28 16:10:18,129 INFO L451 ceAbstractionStarter]: At program point L210(lines 209 512) the Hoare annotation is: true [2018-11-28 16:10:18,129 INFO L448 ceAbstractionStarter]: For program point L177(lines 177 522) no Hoare annotation was computed. [2018-11-28 16:10:18,129 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 533) no Hoare annotation was computed. [2018-11-28 16:10:18,130 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 544) no Hoare annotation was computed. [2018-11-28 16:10:18,130 INFO L448 ceAbstractionStarter]: For program point L310(lines 310 320) no Hoare annotation was computed. [2018-11-28 16:10:18,130 INFO L448 ceAbstractionStarter]: For program point L310-2(lines 310 320) no Hoare annotation was computed. [2018-11-28 16:10:18,130 INFO L444 ceAbstractionStarter]: At program point L178(lines 174 523) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2))) [2018-11-28 16:10:18,130 INFO L444 ceAbstractionStarter]: At program point L112(lines 111 544) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 0) (<= 12292 ssl3_connect_~s__state~0))) [2018-11-28 16:10:18,130 INFO L448 ceAbstractionStarter]: For program point L344(lines 344 346) no Hoare annotation was computed. [2018-11-28 16:10:18,131 INFO L444 ceAbstractionStarter]: At program point L510(lines 108 563) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0))) (let ((.cse6 (= ssl3_connect_~s__state~0 4448)) (.cse10 (not .cse1)) (.cse5 (= ssl3_connect_~s__state~0 4512)) (.cse8 (<= 4560 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4560)) (.cse13 (<= ssl3_connect_~s__state~0 3)) (.cse2 (= ssl3_connect_~s__state~0 4480)) (.cse14 (= ssl3_connect_~s__state~0 4464)) (.cse16 (= ssl3_connect_~s__state~0 4528)) (.cse3 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse11 (<= ssl3_connect_~s__state~0 4352)) (.cse12 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse4 (= ssl3_connect_~s__state~0 4496)) (.cse0 (<= ssl3_connect_~blastFlag~0 4)) (.cse7 (<= ssl3_connect_~blastFlag~0 2)) (.cse15 (= ssl3_connect_~s__state~0 4400))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse1) (and .cse3 .cse5 .cse1) (and .cse6 .cse0 .cse1) (and .cse3 .cse6 .cse1) (and .cse7 .cse8 .cse9 .cse10) (and .cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse11 .cse12 .cse10) (and .cse5 .cse0 .cse1) (and .cse13 .cse7 .cse1) (and .cse14 .cse0 .cse1) (and .cse3 .cse15 .cse0 .cse1) (and .cse7 .cse5) (and .cse3 .cse16 .cse1) (and .cse3 .cse8 .cse1 .cse9 .cse17) (and (<= ssl3_connect_~blastFlag~0 0) (= ssl3_connect_~s__state~0 4368)) (and .cse13 .cse3) (and .cse3 .cse1 .cse2) (and .cse7 .cse16) (and .cse14 .cse3 .cse1) (and (= ssl3_connect_~s__state~0 4432) .cse0 .cse1) (and .cse7 (= ssl3_connect_~s__state~0 4384)) (and (= ssl3_connect_~s__state~0 4416) .cse0 .cse1) (and .cse16 .cse0 .cse1) (< |ssl3_connect_#in~initial_state| 12292) (and .cse3 .cse11 .cse12 .cse1 .cse17) (and .cse4 .cse0 .cse1) (and .cse7 .cse15 .cse1)))) [2018-11-28 16:10:18,131 INFO L448 ceAbstractionStarter]: For program point L411(lines 411 415) no Hoare annotation was computed. [2018-11-28 16:10:18,131 INFO L444 ceAbstractionStarter]: At program point L345(lines 85 575) the Hoare annotation is: (< |ssl3_connect_#in~initial_state| 12292) [2018-11-28 16:10:18,131 INFO L448 ceAbstractionStarter]: For program point L411-2(lines 211 509) no Hoare annotation was computed. [2018-11-28 16:10:18,131 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 521) no Hoare annotation was computed. [2018-11-28 16:10:18,131 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 532) no Hoare annotation was computed. [2018-11-28 16:10:18,131 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 543) no Hoare annotation was computed. [2018-11-28 16:10:18,131 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 250) no Hoare annotation was computed. [2018-11-28 16:10:18,131 INFO L444 ceAbstractionStarter]: At program point L148(lines 144 533) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560)) (< |ssl3_connect_#in~initial_state| 12292)) [2018-11-28 16:10:18,131 INFO L448 ceAbstractionStarter]: For program point L545(lines 545 561) no Hoare annotation was computed. [2018-11-28 16:10:18,131 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 382) no Hoare annotation was computed. [2018-11-28 16:10:18,132 INFO L448 ceAbstractionStarter]: For program point L347(lines 347 349) no Hoare annotation was computed. [2018-11-28 16:10:18,132 INFO L448 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2018-11-28 16:10:18,132 INFO L448 ceAbstractionStarter]: For program point L281(lines 281 283) no Hoare annotation was computed. [2018-11-28 16:10:18,132 INFO L448 ceAbstractionStarter]: For program point L314-2(lines 312 320) no Hoare annotation was computed. [2018-11-28 16:10:18,132 INFO L448 ceAbstractionStarter]: For program point L546(lines 546 560) no Hoare annotation was computed. [2018-11-28 16:10:18,132 INFO L444 ceAbstractionStarter]: At program point L216(lines 114 543) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (<= ssl3_connect_~blastFlag~0 0)) [2018-11-28 16:10:18,132 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 520) no Hoare annotation was computed. [2018-11-28 16:10:18,132 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 531) no Hoare annotation was computed. [2018-11-28 16:10:18,132 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 542) no Hoare annotation was computed. [2018-11-28 16:10:18,132 INFO L451 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 576) the Hoare annotation is: true [2018-11-28 16:10:18,132 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 552) no Hoare annotation was computed. [2018-11-28 16:10:18,133 INFO L448 ceAbstractionStarter]: For program point L547-2(lines 546 560) no Hoare annotation was computed. [2018-11-28 16:10:18,133 INFO L444 ceAbstractionStarter]: At program point L184(lines 180 521) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2))) [2018-11-28 16:10:18,133 INFO L448 ceAbstractionStarter]: For program point L549(lines 549 551) no Hoare annotation was computed. [2018-11-28 16:10:18,133 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 389) no Hoare annotation was computed. [2018-11-28 16:10:18,133 INFO L448 ceAbstractionStarter]: For program point L384-2(lines 384 389) no Hoare annotation was computed. [2018-11-28 16:10:18,133 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 519) no Hoare annotation was computed. [2018-11-28 16:10:18,133 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 530) no Hoare annotation was computed. [2018-11-28 16:10:18,133 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 541) no Hoare annotation was computed. [2018-11-28 16:10:18,133 INFO L444 ceAbstractionStarter]: At program point L154(lines 150 531) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (<= ssl3_connect_~s__state~0 4560) (= ssl3_connect_~s__hit~0 0))) [2018-11-28 16:10:18,134 INFO L448 ceAbstractionStarter]: For program point $Ultimate##85(lines 211 511) no Hoare annotation was computed. [2018-11-28 16:10:18,134 INFO L448 ceAbstractionStarter]: For program point $Ultimate##84(lines 211 511) no Hoare annotation was computed. [2018-11-28 16:10:18,134 INFO L448 ceAbstractionStarter]: For program point L485-1(lines 485 487) no Hoare annotation was computed. [2018-11-28 16:10:18,134 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2018-11-28 16:10:18,134 INFO L448 ceAbstractionStarter]: For program point L221-2(lines 221 223) no Hoare annotation was computed. [2018-11-28 16:10:18,134 INFO L448 ceAbstractionStarter]: For program point L420(lines 420 423) no Hoare annotation was computed. [2018-11-28 16:10:18,134 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 518) no Hoare annotation was computed. [2018-11-28 16:10:18,134 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 529) no Hoare annotation was computed. [2018-11-28 16:10:18,134 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 540) no Hoare annotation was computed. [2018-11-28 16:10:18,134 INFO L448 ceAbstractionStarter]: For program point L289(lines 289 295) no Hoare annotation was computed. [2018-11-28 16:10:18,135 INFO L444 ceAbstractionStarter]: At program point L190(lines 186 519) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1))) [2018-11-28 16:10:18,135 INFO L448 ceAbstractionStarter]: For program point L554(lines 554 558) no Hoare annotation was computed. [2018-11-28 16:10:18,135 INFO L448 ceAbstractionStarter]: For program point L455(lines 455 457) no Hoare annotation was computed. [2018-11-28 16:10:18,135 INFO L448 ceAbstractionStarter]: For program point L356(lines 356 358) no Hoare annotation was computed. [2018-11-28 16:10:18,135 INFO L448 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 576) no Hoare annotation was computed. [2018-11-28 16:10:18,135 INFO L448 ceAbstractionStarter]: For program point L258(lines 258 261) no Hoare annotation was computed. [2018-11-28 16:10:18,135 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 517) no Hoare annotation was computed. [2018-11-28 16:10:18,135 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 528) no Hoare annotation was computed. [2018-11-28 16:10:18,135 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 539) no Hoare annotation was computed. [2018-11-28 16:10:18,135 INFO L448 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 576) no Hoare annotation was computed. [2018-11-28 16:10:18,136 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 294) no Hoare annotation was computed. [2018-11-28 16:10:18,136 INFO L448 ceAbstractionStarter]: For program point L226(lines 226 229) no Hoare annotation was computed. [2018-11-28 16:10:18,136 INFO L448 ceAbstractionStarter]: For program point L292-2(lines 211 509) no Hoare annotation was computed. [2018-11-28 16:10:18,136 INFO L444 ceAbstractionStarter]: At program point L160(lines 156 529) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2))) [2018-11-28 16:10:18,136 INFO L448 ceAbstractionStarter]: For program point L94(lines 94 100) no Hoare annotation was computed. [2018-11-28 16:10:18,136 INFO L448 ceAbstractionStarter]: For program point L491(lines 491 493) no Hoare annotation was computed. [2018-11-28 16:10:18,136 INFO L448 ceAbstractionStarter]: For program point L458(lines 458 462) no Hoare annotation was computed. [2018-11-28 16:10:18,136 INFO L448 ceAbstractionStarter]: For program point L491-2(lines 491 493) no Hoare annotation was computed. [2018-11-28 16:10:18,136 INFO L448 ceAbstractionStarter]: For program point L458-2(lines 458 462) no Hoare annotation was computed. [2018-11-28 16:10:18,136 INFO L448 ceAbstractionStarter]: For program point L359(lines 359 363) no Hoare annotation was computed. [2018-11-28 16:10:18,137 INFO L448 ceAbstractionStarter]: For program point L359-2(lines 359 363) no Hoare annotation was computed. [2018-11-28 16:10:18,137 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 516) no Hoare annotation was computed. [2018-11-28 16:10:18,137 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 527) no Hoare annotation was computed. [2018-11-28 16:10:18,137 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 538) no Hoare annotation was computed. [2018-11-28 16:10:18,137 INFO L448 ceAbstractionStarter]: For program point L328(lines 328 330) no Hoare annotation was computed. [2018-11-28 16:10:18,137 INFO L448 ceAbstractionStarter]: For program point L328-2(lines 211 509) no Hoare annotation was computed. [2018-11-28 16:10:18,137 INFO L444 ceAbstractionStarter]: At program point L196(lines 192 517) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1))) [2018-11-28 16:10:18,137 INFO L444 ceAbstractionStarter]: At program point L130(lines 126 539) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~blastFlag~0 0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (= ssl3_connect_~s__state~0 4368)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560)))) [2018-11-28 16:10:18,138 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 99) no Hoare annotation was computed. [2018-11-28 16:10:18,138 INFO L448 ceAbstractionStarter]: For program point L97-2(lines 94 100) no Hoare annotation was computed. [2018-11-28 16:10:18,138 INFO L448 ceAbstractionStarter]: For program point L428(lines 428 430) no Hoare annotation was computed. [2018-11-28 16:10:18,138 INFO L448 ceAbstractionStarter]: For program point L395(lines 395 397) no Hoare annotation was computed. [2018-11-28 16:10:18,138 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 515) no Hoare annotation was computed. [2018-11-28 16:10:18,138 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 526) no Hoare annotation was computed. [2018-11-28 16:10:18,138 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 537) no Hoare annotation was computed. [2018-11-28 16:10:18,138 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 499) no Hoare annotation was computed. [2018-11-28 16:10:18,138 INFO L448 ceAbstractionStarter]: For program point L497-2(lines 497 499) no Hoare annotation was computed. [2018-11-28 16:10:18,138 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 303) no Hoare annotation was computed. [2018-11-28 16:10:18,138 INFO L448 ceAbstractionStarter]: For program point L299-2(lines 299 303) no Hoare annotation was computed. [2018-11-28 16:10:18,139 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 16:10:18,139 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 16:10:18,139 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 16:10:18,139 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 16:10:18,139 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 577 587) the Hoare annotation is: true [2018-11-28 16:10:18,139 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 577 587) no Hoare annotation was computed. [2018-11-28 16:10:18,139 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 577 587) no Hoare annotation was computed. [2018-11-28 16:10:18,139 INFO L444 ceAbstractionStarter]: At program point L583(line 583) the Hoare annotation is: (<= 12292 main_~s~0) [2018-11-28 16:10:18,139 INFO L448 ceAbstractionStarter]: For program point L583-1(line 583) no Hoare annotation was computed. [2018-11-28 16:10:18,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:10:18 BoogieIcfgContainer [2018-11-28 16:10:18,181 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 16:10:18,181 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 16:10:18,181 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 16:10:18,181 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 16:10:18,188 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:09:51" (3/4) ... [2018-11-28 16:10:18,195 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 16:10:18,209 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 16:10:18,214 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_connect [2018-11-28 16:10:18,214 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 16:10:18,237 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-11-28 16:10:18,238 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-28 16:10:18,240 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 16:10:18,275 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state) [2018-11-28 16:10:18,275 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || blastFlag <= 0 [2018-11-28 16:10:18,275 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (blastFlag <= 0 && s__state == 4368)) || (((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 0) && 4352 <= s__state) && s__state <= 4560) [2018-11-28 16:10:18,277 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) [2018-11-28 16:10:18,277 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((((s__s3__tmp__next_state___0 <= 4560 && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) [2018-11-28 16:10:18,278 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292 [2018-11-28 16:10:18,278 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) [2018-11-28 16:10:18,278 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((blastFlag <= 4 && s__hit == 0) && s__state == 4480) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4496) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4512) && s__hit == 0)) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4448) && s__hit == 0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0))) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || ((s__state <= 3 && blastFlag <= 2) && s__hit == 0)) || ((s__state == 4464 && blastFlag <= 4) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 4560 && s__state == 4400) && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4512)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4528) && s__hit == 0)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (blastFlag <= 0 && s__state == 4368)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4480)) || (blastFlag <= 2 && s__state == 4528)) || ((s__state == 4464 && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0)) || ((s__state == 4432 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4384)) || ((s__state == 4416 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || \old(initial_state) < 12292) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || ((blastFlag <= 2 && s__state == 4400) && s__hit == 0) [2018-11-28 16:10:18,279 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) [2018-11-28 16:10:18,279 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 [2018-11-28 16:10:18,279 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560) [2018-11-28 16:10:18,285 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-11-28 16:10:18,285 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-11-28 16:10:18,285 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-11-28 16:10:18,286 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-11-28 16:10:18,286 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0)) [2018-11-28 16:10:18,286 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0)) [2018-11-28 16:10:18,390 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 16:10:18,390 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 16:10:18,391 INFO L168 Benchmark]: Toolchain (without parser) took 28925.12 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 777.5 MB). Free memory was 940.6 MB in the beginning and 1.2 GB in the end (delta: -288.0 MB). Peak memory consumption was 489.5 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:18,391 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:10:18,393 INFO L168 Benchmark]: CACSL2BoogieTranslator took 506.00 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 924.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:18,394 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.10 ms. Allocated memory is still 1.0 GB. Free memory is still 924.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:10:18,394 INFO L168 Benchmark]: Boogie Preprocessor took 126.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -198.1 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:18,394 INFO L168 Benchmark]: RCFGBuilder took 1197.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:18,397 INFO L168 Benchmark]: TraceAbstraction took 26852.95 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 641.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -169.2 MB). Peak memory consumption was 472.6 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:18,397 INFO L168 Benchmark]: Witness Printer took 208.81 ms. Allocated memory is still 1.8 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:18,401 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 506.00 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 924.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.10 ms. Allocated memory is still 1.0 GB. Free memory is still 924.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 126.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -198.1 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1197.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26852.95 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 641.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -169.2 MB). Peak memory consumption was 472.6 MB. Max. memory is 11.5 GB. * Witness Printer took 208.81 ms. Allocated memory is still 1.8 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 573]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0)) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((((s__s3__tmp__next_state___0 <= 4560 && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((\old(initial_state) < 12292 || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0)) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (blastFlag <= 0 && s__state == 4368)) || (((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 0) && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || blastFlag <= 0 - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state) - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 144]: Loop Invariant Derived loop invariant: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292 - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((blastFlag <= 4 && s__hit == 0) && s__state == 4480) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4496) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4512) && s__hit == 0)) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4448) && s__hit == 0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0))) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || ((s__state <= 3 && blastFlag <= 2) && s__hit == 0)) || ((s__state == 4464 && blastFlag <= 4) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 4560 && s__state == 4400) && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4512)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4528) && s__hit == 0)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (blastFlag <= 0 && s__state == 4368)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4480)) || (blastFlag <= 2 && s__state == 4528)) || ((s__state == 4464 && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0)) || ((s__state == 4432 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4384)) || ((s__state == 4416 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || \old(initial_state) < 12292) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || ((blastFlag <= 2 && s__state == 4400) && s__hit == 0) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((\old(initial_state) < 12292 || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 138 locations, 1 error locations. SAFE Result, 26.7s OverallTime, 24 OverallIterations, 19 TraceHistogramMax, 15.8s AutomataDifference, 0.0s DeadEndRemovalTime, 3.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 4900 SDtfs, 1943 SDslu, 3317 SDs, 0 SdLazy, 2728 SolverSat, 478 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1295 GetRequests, 1254 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8460occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 5148 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 240 NumberOfFragments, 701 HoareAnnotationTreeSize, 26 FomulaSimplifications, 16624 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 26 FomulaSimplificationsInter, 1670 FormulaSimplificationTreeSizeReductionInter, 2.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 6457 NumberOfCodeBlocks, 6457 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 6430 ConstructedInterpolants, 0 QuantifiedInterpolants, 3029160 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2261 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 27 InterpolantComputations, 24 PerfectInterpolantSequences, 23929/23960 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...