./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_clnt_2_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_2_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 1236ee922960b2737aa65707c3f9d27b28eaa4fc ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:45,219 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 16:09:45,221 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 16:09:45,234 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 16:09:45,234 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 16:09:45,235 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 16:09:45,237 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 16:09:45,239 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 16:09:45,241 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 16:09:45,242 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 16:09:45,243 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 16:09:45,243 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 16:09:45,244 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 16:09:45,246 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 16:09:45,247 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 16:09:45,248 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 16:09:45,249 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 16:09:45,251 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 16:09:45,254 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 16:09:45,256 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 16:09:45,258 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 16:09:45,259 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 16:09:45,263 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 16:09:45,263 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 16:09:45,263 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 16:09:45,265 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 16:09:45,266 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 16:09:45,267 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 16:09:45,268 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 16:09:45,270 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 16:09:45,270 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 16:09:45,271 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 16:09:45,272 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 16:09:45,272 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 16:09:45,273 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 16:09:45,275 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 16:09:45,275 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:45,291 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 16:09:45,292 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 16:09:45,293 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 16:09:45,293 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 16:09:45,294 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 16:09:45,294 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 16:09:45,294 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 16:09:45,295 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 16:09:45,296 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 16:09:45,296 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 16:09:45,296 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 16:09:45,297 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 16:09:45,297 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 16:09:45,297 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 16:09:45,297 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 16:09:45,298 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 16:09:45,299 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 16:09:45,299 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 16:09:45,299 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 16:09:45,299 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 16:09:45,300 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 16:09:45,300 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 16:09:45,301 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 16:09:45,301 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 16:09:45,301 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 16:09:45,301 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 16:09:45,302 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 16:09:45,302 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 16:09:45,302 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 16:09:45,302 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 16:09:45,302 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 -> 1236ee922960b2737aa65707c3f9d27b28eaa4fc [2018-11-28 16:09:45,341 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 16:09:45,354 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 16:09:45,358 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 16:09:45,360 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 16:09:45,361 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 16:09:45,361 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_clnt_2_true-unreach-call_true-termination.cil.c [2018-11-28 16:09:45,426 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b1b1281c/bc90caad4cef464db88e174c316c3fe8/FLAGd95ad76c9 [2018-11-28 16:09:45,937 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 16:09:45,939 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_clnt_2_true-unreach-call_true-termination.cil.c [2018-11-28 16:09:45,957 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b1b1281c/bc90caad4cef464db88e174c316c3fe8/FLAGd95ad76c9 [2018-11-28 16:09:46,240 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b1b1281c/bc90caad4cef464db88e174c316c3fe8 [2018-11-28 16:09:46,243 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 16:09:46,245 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 16:09:46,246 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 16:09:46,246 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 16:09:46,250 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 16:09:46,251 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:09:46" (1/1) ... [2018-11-28 16:09:46,254 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@985e771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:09:46, skipping insertion in model container [2018-11-28 16:09:46,255 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:09:46" (1/1) ... [2018-11-28 16:09:46,263 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 16:09:46,315 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 16:09:46,692 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 16:09:46,700 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 16:09:46,757 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 16:09:46,784 INFO L195 MainTranslator]: Completed translation [2018-11-28 16:09:46,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:09:46 WrapperNode [2018-11-28 16:09:46,784 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 16:09:46,785 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 16:09:46,785 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 16:09:46,786 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 16:09:46,795 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:46" (1/1) ... [2018-11-28 16:09:46,805 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:46" (1/1) ... [2018-11-28 16:09:46,813 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 16:09:46,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 16:09:46,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 16:09:46,814 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 16:09:46,824 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:46" (1/1) ... [2018-11-28 16:09:46,824 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:46" (1/1) ... [2018-11-28 16:09:46,828 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:46" (1/1) ... [2018-11-28 16:09:46,829 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:46" (1/1) ... [2018-11-28 16:09:46,914 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:46" (1/1) ... [2018-11-28 16:09:46,932 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:46" (1/1) ... [2018-11-28 16:09:46,935 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:46" (1/1) ... [2018-11-28 16:09:46,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 16:09:46,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 16:09:46,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 16:09:46,942 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 16:09:46,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:09:46" (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:47,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 16:09:47,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 16:09:47,008 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-11-28 16:09:47,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-11-28 16:09:47,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 16:09:47,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 16:09:47,009 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 16:09:47,009 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 16:09:47,227 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 16:09:47,228 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 16:09:48,205 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 16:09:48,206 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 16:09:48,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:09:48 BoogieIcfgContainer [2018-11-28 16:09:48,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 16:09:48,207 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 16:09:48,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 16:09:48,211 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 16:09:48,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:09:46" (1/3) ... [2018-11-28 16:09:48,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7506ee8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:09:48, skipping insertion in model container [2018-11-28 16:09:48,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:09:46" (2/3) ... [2018-11-28 16:09:48,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7506ee8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:09:48, skipping insertion in model container [2018-11-28 16:09:48,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:09:48" (3/3) ... [2018-11-28 16:09:48,219 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_2_true-unreach-call_true-termination.cil.c [2018-11-28 16:09:48,229 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 16:09:48,238 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 16:09:48,252 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 16:09:48,288 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 16:09:48,289 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 16:09:48,289 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 16:09:48,289 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 16:09:48,290 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 16:09:48,290 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 16:09:48,290 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 16:09:48,290 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 16:09:48,290 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 16:09:48,315 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2018-11-28 16:09:48,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 16:09:48,324 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:48,325 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:48,327 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:48,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:48,334 INFO L82 PathProgramCache]: Analyzing trace with hash 173387410, now seen corresponding path program 1 times [2018-11-28 16:09:48,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:48,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:48,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:48,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:48,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:48,610 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:48,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:48,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:48,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:48,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:48,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:48,637 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2018-11-28 16:09:48,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:48,893 INFO L93 Difference]: Finished difference Result 377 states and 634 transitions. [2018-11-28 16:09:48,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:48,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-28 16:09:48,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:48,911 INFO L225 Difference]: With dead ends: 377 [2018-11-28 16:09:48,912 INFO L226 Difference]: Without dead ends: 220 [2018-11-28 16:09:48,916 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:48,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-11-28 16:09:48,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-11-28 16:09:48,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-11-28 16:09:48,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 326 transitions. [2018-11-28 16:09:48,982 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 326 transitions. Word has length 29 [2018-11-28 16:09:48,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:48,983 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 326 transitions. [2018-11-28 16:09:48,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:48,983 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 326 transitions. [2018-11-28 16:09:48,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-28 16:09:48,986 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:48,987 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:48,987 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:48,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:48,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1426924635, now seen corresponding path program 1 times [2018-11-28 16:09:48,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:48,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:48,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:48,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:48,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:49,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:49,104 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:49,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:49,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:49,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:49,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:49,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:49,107 INFO L87 Difference]: Start difference. First operand 220 states and 326 transitions. Second operand 3 states. [2018-11-28 16:09:49,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:49,717 INFO L93 Difference]: Finished difference Result 470 states and 707 transitions. [2018-11-28 16:09:49,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:49,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-11-28 16:09:49,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:49,722 INFO L225 Difference]: With dead ends: 470 [2018-11-28 16:09:49,722 INFO L226 Difference]: Without dead ends: 262 [2018-11-28 16:09:49,726 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:49,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-11-28 16:09:49,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 254. [2018-11-28 16:09:49,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-11-28 16:09:49,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 370 transitions. [2018-11-28 16:09:49,757 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 370 transitions. Word has length 43 [2018-11-28 16:09:49,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:49,759 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 370 transitions. [2018-11-28 16:09:49,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:49,759 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 370 transitions. [2018-11-28 16:09:49,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 16:09:49,762 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:49,762 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:49,766 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:49,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:49,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1669760968, now seen corresponding path program 1 times [2018-11-28 16:09:49,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:49,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:49,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:49,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:49,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:49,930 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:49,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:49,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:49,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:49,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:49,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:49,933 INFO L87 Difference]: Start difference. First operand 254 states and 370 transitions. Second operand 3 states. [2018-11-28 16:09:50,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:50,352 INFO L93 Difference]: Finished difference Result 598 states and 902 transitions. [2018-11-28 16:09:50,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:50,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-11-28 16:09:50,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:50,363 INFO L225 Difference]: With dead ends: 598 [2018-11-28 16:09:50,364 INFO L226 Difference]: Without dead ends: 354 [2018-11-28 16:09:50,366 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:50,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-11-28 16:09:50,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 336. [2018-11-28 16:09:50,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-11-28 16:09:50,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 470 transitions. [2018-11-28 16:09:50,392 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 470 transitions. Word has length 60 [2018-11-28 16:09:50,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:50,393 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 470 transitions. [2018-11-28 16:09:50,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:50,393 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 470 transitions. [2018-11-28 16:09:50,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 16:09:50,398 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:50,398 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:50,399 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:50,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:50,399 INFO L82 PathProgramCache]: Analyzing trace with hash 819767994, now seen corresponding path program 1 times [2018-11-28 16:09:50,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:50,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:50,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:50,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:50,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:50,527 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:50,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:50,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:50,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:50,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:50,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:50,530 INFO L87 Difference]: Start difference. First operand 336 states and 470 transitions. Second operand 3 states. [2018-11-28 16:09:50,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:50,917 INFO L93 Difference]: Finished difference Result 708 states and 1005 transitions. [2018-11-28 16:09:50,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:50,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-11-28 16:09:50,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:50,924 INFO L225 Difference]: With dead ends: 708 [2018-11-28 16:09:50,924 INFO L226 Difference]: Without dead ends: 384 [2018-11-28 16:09:50,926 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:50,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-11-28 16:09:50,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 374. [2018-11-28 16:09:50,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-11-28 16:09:50,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 518 transitions. [2018-11-28 16:09:50,969 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 518 transitions. Word has length 60 [2018-11-28 16:09:50,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:50,969 INFO L480 AbstractCegarLoop]: Abstraction has 374 states and 518 transitions. [2018-11-28 16:09:50,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:50,970 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 518 transitions. [2018-11-28 16:09:50,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-28 16:09:50,975 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:50,978 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:50,978 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:50,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:50,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1719879938, now seen corresponding path program 1 times [2018-11-28 16:09:50,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:50,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:50,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:50,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:50,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:51,074 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:51,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:51,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:51,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:51,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:51,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:51,076 INFO L87 Difference]: Start difference. First operand 374 states and 518 transitions. Second operand 3 states. [2018-11-28 16:09:51,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:51,468 INFO L93 Difference]: Finished difference Result 842 states and 1204 transitions. [2018-11-28 16:09:51,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:51,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-11-28 16:09:51,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:51,476 INFO L225 Difference]: With dead ends: 842 [2018-11-28 16:09:51,476 INFO L226 Difference]: Without dead ends: 478 [2018-11-28 16:09:51,479 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:51,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-11-28 16:09:51,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 452. [2018-11-28 16:09:51,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-11-28 16:09:51,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 652 transitions. [2018-11-28 16:09:51,514 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 652 transitions. Word has length 73 [2018-11-28 16:09:51,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:51,517 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 652 transitions. [2018-11-28 16:09:51,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:51,517 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 652 transitions. [2018-11-28 16:09:51,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-28 16:09:51,524 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:51,524 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:51,524 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:51,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:51,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1093696729, now seen corresponding path program 1 times [2018-11-28 16:09:51,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:51,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:51,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:51,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:51,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:51,605 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:51,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:51,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:51,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:51,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:51,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:51,607 INFO L87 Difference]: Start difference. First operand 452 states and 652 transitions. Second operand 3 states. [2018-11-28 16:09:52,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:52,080 INFO L93 Difference]: Finished difference Result 940 states and 1365 transitions. [2018-11-28 16:09:52,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:52,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-11-28 16:09:52,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:52,087 INFO L225 Difference]: With dead ends: 940 [2018-11-28 16:09:52,087 INFO L226 Difference]: Without dead ends: 500 [2018-11-28 16:09:52,088 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,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-11-28 16:09:52,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 494. [2018-11-28 16:09:52,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-11-28 16:09:52,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 704 transitions. [2018-11-28 16:09:52,110 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 704 transitions. Word has length 77 [2018-11-28 16:09:52,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:52,110 INFO L480 AbstractCegarLoop]: Abstraction has 494 states and 704 transitions. [2018-11-28 16:09:52,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:52,111 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 704 transitions. [2018-11-28 16:09:52,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-28 16:09:52,114 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:52,114 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:52,115 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:52,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:52,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1180839903, now seen corresponding path program 1 times [2018-11-28 16:09:52,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:52,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:52,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:52,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:52,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:52,246 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:52,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:52,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:52,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:52,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:52,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:52,256 INFO L87 Difference]: Start difference. First operand 494 states and 704 transitions. Second operand 3 states. [2018-11-28 16:09:52,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:52,586 INFO L93 Difference]: Finished difference Result 976 states and 1397 transitions. [2018-11-28 16:09:52,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:52,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-11-28 16:09:52,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:52,592 INFO L225 Difference]: With dead ends: 976 [2018-11-28 16:09:52,593 INFO L226 Difference]: Without dead ends: 734 [2018-11-28 16:09:52,594 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,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-11-28 16:09:52,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2018-11-28 16:09:52,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-11-28 16:09:52,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1047 transitions. [2018-11-28 16:09:52,623 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1047 transitions. Word has length 97 [2018-11-28 16:09:52,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:52,623 INFO L480 AbstractCegarLoop]: Abstraction has 734 states and 1047 transitions. [2018-11-28 16:09:52,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:52,624 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1047 transitions. [2018-11-28 16:09:52,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 16:09:52,627 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:52,627 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:52,628 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:52,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:52,629 INFO L82 PathProgramCache]: Analyzing trace with hash 866854985, now seen corresponding path program 1 times [2018-11-28 16:09:52,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:52,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:52,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:52,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:52,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:52,785 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:52,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:52,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:52,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:52,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:52,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:52,787 INFO L87 Difference]: Start difference. First operand 734 states and 1047 transitions. Second operand 3 states. [2018-11-28 16:09:53,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:53,063 INFO L93 Difference]: Finished difference Result 976 states and 1394 transitions. [2018-11-28 16:09:53,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:53,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-11-28 16:09:53,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:53,071 INFO L225 Difference]: With dead ends: 976 [2018-11-28 16:09:53,072 INFO L226 Difference]: Without dead ends: 974 [2018-11-28 16:09:53,073 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,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2018-11-28 16:09:53,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2018-11-28 16:09:53,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2018-11-28 16:09:53,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1392 transitions. [2018-11-28 16:09:53,104 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1392 transitions. Word has length 99 [2018-11-28 16:09:53,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:53,104 INFO L480 AbstractCegarLoop]: Abstraction has 974 states and 1392 transitions. [2018-11-28 16:09:53,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:53,104 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1392 transitions. [2018-11-28 16:09:53,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-28 16:09:53,108 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:53,108 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 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] [2018-11-28 16:09:53,108 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:53,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:53,109 INFO L82 PathProgramCache]: Analyzing trace with hash -394036509, now seen corresponding path program 1 times [2018-11-28 16:09:53,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:53,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:53,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:53,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:53,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:53,261 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-11-28 16:09:53,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:53,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:53,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:53,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:53,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:53,265 INFO L87 Difference]: Start difference. First operand 974 states and 1392 transitions. Second operand 3 states. [2018-11-28 16:09:54,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:54,252 INFO L93 Difference]: Finished difference Result 2140 states and 3108 transitions. [2018-11-28 16:09:54,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:54,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2018-11-28 16:09:54,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:54,258 INFO L225 Difference]: With dead ends: 2140 [2018-11-28 16:09:54,258 INFO L226 Difference]: Without dead ends: 1170 [2018-11-28 16:09:54,260 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,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2018-11-28 16:09:54,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1130. [2018-11-28 16:09:54,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2018-11-28 16:09:54,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1632 transitions. [2018-11-28 16:09:54,293 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1632 transitions. Word has length 168 [2018-11-28 16:09:54,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:54,294 INFO L480 AbstractCegarLoop]: Abstraction has 1130 states and 1632 transitions. [2018-11-28 16:09:54,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:54,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1632 transitions. [2018-11-28 16:09:54,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-28 16:09:54,298 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:54,298 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 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] [2018-11-28 16:09:54,298 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:54,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:54,299 INFO L82 PathProgramCache]: Analyzing trace with hash 531653490, now seen corresponding path program 1 times [2018-11-28 16:09:54,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:54,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:54,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:54,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:54,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:54,421 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 366 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-11-28 16:09:54,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:54,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:54,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:54,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:54,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:54,422 INFO L87 Difference]: Start difference. First operand 1130 states and 1632 transitions. Second operand 3 states. [2018-11-28 16:09:54,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:54,651 INFO L93 Difference]: Finished difference Result 2354 states and 3378 transitions. [2018-11-28 16:09:54,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:54,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2018-11-28 16:09:54,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:54,659 INFO L225 Difference]: With dead ends: 2354 [2018-11-28 16:09:54,659 INFO L226 Difference]: Without dead ends: 1236 [2018-11-28 16:09:54,664 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,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2018-11-28 16:09:54,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1222. [2018-11-28 16:09:54,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2018-11-28 16:09:54,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1744 transitions. [2018-11-28 16:09:54,699 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1744 transitions. Word has length 204 [2018-11-28 16:09:54,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:54,699 INFO L480 AbstractCegarLoop]: Abstraction has 1222 states and 1744 transitions. [2018-11-28 16:09:54,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:54,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1744 transitions. [2018-11-28 16:09:54,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-11-28 16:09:54,705 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:54,705 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,705 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:54,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:54,706 INFO L82 PathProgramCache]: Analyzing trace with hash -354539531, now seen corresponding path program 1 times [2018-11-28 16:09:54,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:54,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:54,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:54,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:54,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:54,821 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2018-11-28 16:09:54,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:54,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:54,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:54,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:54,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:54,823 INFO L87 Difference]: Start difference. First operand 1222 states and 1744 transitions. Second operand 3 states. [2018-11-28 16:09:55,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:55,091 INFO L93 Difference]: Finished difference Result 2544 states and 3620 transitions. [2018-11-28 16:09:55,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:55,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2018-11-28 16:09:55,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:55,102 INFO L225 Difference]: With dead ends: 2544 [2018-11-28 16:09:55,102 INFO L226 Difference]: Without dead ends: 1334 [2018-11-28 16:09:55,105 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,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2018-11-28 16:09:55,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1322. [2018-11-28 16:09:55,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2018-11-28 16:09:55,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1864 transitions. [2018-11-28 16:09:55,147 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1864 transitions. Word has length 225 [2018-11-28 16:09:55,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:55,147 INFO L480 AbstractCegarLoop]: Abstraction has 1322 states and 1864 transitions. [2018-11-28 16:09:55,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:55,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1864 transitions. [2018-11-28 16:09:55,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-28 16:09:55,154 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:55,155 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 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] [2018-11-28 16:09:55,155 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:55,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:55,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1874601560, now seen corresponding path program 1 times [2018-11-28 16:09:55,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:55,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:55,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:55,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:55,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:55,301 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 546 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-11-28 16:09:55,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:55,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:55,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:55,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:55,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:55,303 INFO L87 Difference]: Start difference. First operand 1322 states and 1864 transitions. Second operand 3 states. [2018-11-28 16:09:55,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:55,639 INFO L93 Difference]: Finished difference Result 2752 states and 3872 transitions. [2018-11-28 16:09:55,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:55,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2018-11-28 16:09:55,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:55,651 INFO L225 Difference]: With dead ends: 2752 [2018-11-28 16:09:55,651 INFO L226 Difference]: Without dead ends: 1442 [2018-11-28 16:09:55,655 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,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2018-11-28 16:09:55,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1434. [2018-11-28 16:09:55,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2018-11-28 16:09:55,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1996 transitions. [2018-11-28 16:09:55,694 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1996 transitions. Word has length 249 [2018-11-28 16:09:55,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:55,695 INFO L480 AbstractCegarLoop]: Abstraction has 1434 states and 1996 transitions. [2018-11-28 16:09:55,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:55,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1996 transitions. [2018-11-28 16:09:55,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-28 16:09:55,701 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:55,702 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 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] [2018-11-28 16:09:55,702 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:55,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:55,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1835594086, now seen corresponding path program 1 times [2018-11-28 16:09:55,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:55,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:55,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:55,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:55,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:55,836 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 546 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-11-28 16:09:55,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:55,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:55,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:55,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:55,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:55,838 INFO L87 Difference]: Start difference. First operand 1434 states and 1996 transitions. Second operand 3 states. [2018-11-28 16:09:56,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:56,663 INFO L93 Difference]: Finished difference Result 2992 states and 4172 transitions. [2018-11-28 16:09:56,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:56,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2018-11-28 16:09:56,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:56,673 INFO L225 Difference]: With dead ends: 2992 [2018-11-28 16:09:56,673 INFO L226 Difference]: Without dead ends: 1570 [2018-11-28 16:09:56,676 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,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2018-11-28 16:09:56,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1558. [2018-11-28 16:09:56,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-11-28 16:09:56,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2140 transitions. [2018-11-28 16:09:56,715 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2140 transitions. Word has length 249 [2018-11-28 16:09:56,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:56,716 INFO L480 AbstractCegarLoop]: Abstraction has 1558 states and 2140 transitions. [2018-11-28 16:09:56,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:56,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2140 transitions. [2018-11-28 16:09:56,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-11-28 16:09:56,722 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:56,722 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 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, 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] [2018-11-28 16:09:56,722 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:56,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:56,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1915187928, now seen corresponding path program 1 times [2018-11-28 16:09:56,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:56,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:56,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:56,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:56,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:56,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 660 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2018-11-28 16:09:56,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:56,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:56,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:56,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:56,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:56,865 INFO L87 Difference]: Start difference. First operand 1558 states and 2140 transitions. Second operand 3 states. [2018-11-28 16:09:56,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:56,985 INFO L93 Difference]: Finished difference Result 4646 states and 6384 transitions. [2018-11-28 16:09:56,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:56,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2018-11-28 16:09:56,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:57,001 INFO L225 Difference]: With dead ends: 4646 [2018-11-28 16:09:57,001 INFO L226 Difference]: Without dead ends: 3100 [2018-11-28 16:09:57,005 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,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2018-11-28 16:09:57,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 3098. [2018-11-28 16:09:57,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3098 states. [2018-11-28 16:09:57,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4255 transitions. [2018-11-28 16:09:57,077 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4255 transitions. Word has length 279 [2018-11-28 16:09:57,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:57,078 INFO L480 AbstractCegarLoop]: Abstraction has 3098 states and 4255 transitions. [2018-11-28 16:09:57,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:57,078 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4255 transitions. [2018-11-28 16:09:57,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-11-28 16:09:57,086 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:57,086 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 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, 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] [2018-11-28 16:09:57,087 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:57,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:57,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1795007718, now seen corresponding path program 1 times [2018-11-28 16:09:57,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:57,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:57,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:57,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:57,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:57,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2018-11-28 16:09:57,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:57,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:57,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:57,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:57,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:57,255 INFO L87 Difference]: Start difference. First operand 3098 states and 4255 transitions. Second operand 3 states. [2018-11-28 16:09:57,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:57,766 INFO L93 Difference]: Finished difference Result 6484 states and 8938 transitions. [2018-11-28 16:09:57,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:57,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2018-11-28 16:09:57,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:57,782 INFO L225 Difference]: With dead ends: 6484 [2018-11-28 16:09:57,782 INFO L226 Difference]: Without dead ends: 3398 [2018-11-28 16:09:57,788 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,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2018-11-28 16:09:57,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3382. [2018-11-28 16:09:57,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3382 states. [2018-11-28 16:09:57,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 4579 transitions. [2018-11-28 16:09:57,857 INFO L78 Accepts]: Start accepts. Automaton has 3382 states and 4579 transitions. Word has length 279 [2018-11-28 16:09:57,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:57,857 INFO L480 AbstractCegarLoop]: Abstraction has 3382 states and 4579 transitions. [2018-11-28 16:09:57,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:57,858 INFO L276 IsEmpty]: Start isEmpty. Operand 3382 states and 4579 transitions. [2018-11-28 16:09:57,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-11-28 16:09:57,867 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:57,867 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 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, 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:09:57,868 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:57,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:57,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1052232894, now seen corresponding path program 1 times [2018-11-28 16:09:57,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:57,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:57,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:57,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:57,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:58,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2018-11-28 16:09:58,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:58,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:58,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:58,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:58,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:58,011 INFO L87 Difference]: Start difference. First operand 3382 states and 4579 transitions. Second operand 3 states. [2018-11-28 16:09:58,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:58,592 INFO L93 Difference]: Finished difference Result 6900 states and 9354 transitions. [2018-11-28 16:09:58,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:58,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2018-11-28 16:09:58,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:58,611 INFO L225 Difference]: With dead ends: 6900 [2018-11-28 16:09:58,611 INFO L226 Difference]: Without dead ends: 3530 [2018-11-28 16:09:58,618 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,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3530 states. [2018-11-28 16:09:58,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 3514. [2018-11-28 16:09:58,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2018-11-28 16:09:58,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 4731 transitions. [2018-11-28 16:09:58,689 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 4731 transitions. Word has length 303 [2018-11-28 16:09:58,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:58,689 INFO L480 AbstractCegarLoop]: Abstraction has 3514 states and 4731 transitions. [2018-11-28 16:09:58,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:58,689 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 4731 transitions. [2018-11-28 16:09:58,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-11-28 16:09:58,700 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:58,700 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 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, 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] [2018-11-28 16:09:58,700 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:58,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:58,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1022376132, now seen corresponding path program 1 times [2018-11-28 16:09:58,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:58,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:58,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:58,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:58,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:58,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1244 backedges. 638 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2018-11-28 16:09:58,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:58,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:58,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:58,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:58,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:58,833 INFO L87 Difference]: Start difference. First operand 3514 states and 4731 transitions. Second operand 3 states. [2018-11-28 16:09:59,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:09:59,174 INFO L93 Difference]: Finished difference Result 7416 states and 10118 transitions. [2018-11-28 16:09:59,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:09:59,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2018-11-28 16:09:59,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:09:59,197 INFO L225 Difference]: With dead ends: 7416 [2018-11-28 16:09:59,197 INFO L226 Difference]: Without dead ends: 3914 [2018-11-28 16:09:59,206 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,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3914 states. [2018-11-28 16:09:59,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3914 to 3826. [2018-11-28 16:09:59,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2018-11-28 16:09:59,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 5099 transitions. [2018-11-28 16:09:59,283 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 5099 transitions. Word has length 314 [2018-11-28 16:09:59,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:09:59,283 INFO L480 AbstractCegarLoop]: Abstraction has 3826 states and 5099 transitions. [2018-11-28 16:09:59,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:09:59,283 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 5099 transitions. [2018-11-28 16:09:59,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-11-28 16:09:59,292 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:09:59,292 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 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, 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] [2018-11-28 16:09:59,293 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:09:59,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:09:59,293 INFO L82 PathProgramCache]: Analyzing trace with hash -773017638, now seen corresponding path program 1 times [2018-11-28 16:09:59,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:09:59,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:09:59,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:59,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:09:59,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:09:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:09:59,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 694 proven. 0 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2018-11-28 16:09:59,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:09:59,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:09:59,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:09:59,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:09:59,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:09:59,470 INFO L87 Difference]: Start difference. First operand 3826 states and 5099 transitions. Second operand 3 states. [2018-11-28 16:10:00,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:00,214 INFO L93 Difference]: Finished difference Result 8048 states and 10662 transitions. [2018-11-28 16:10:00,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:00,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2018-11-28 16:10:00,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:00,236 INFO L225 Difference]: With dead ends: 8048 [2018-11-28 16:10:00,236 INFO L226 Difference]: Without dead ends: 4234 [2018-11-28 16:10:00,244 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,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4234 states. [2018-11-28 16:10:00,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4234 to 3946. [2018-11-28 16:10:00,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3946 states. [2018-11-28 16:10:00,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 5243 transitions. [2018-11-28 16:10:00,317 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 5243 transitions. Word has length 328 [2018-11-28 16:10:00,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:00,318 INFO L480 AbstractCegarLoop]: Abstraction has 3946 states and 5243 transitions. [2018-11-28 16:10:00,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:00,318 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 5243 transitions. [2018-11-28 16:10:00,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-11-28 16:10:00,328 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:00,329 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 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, 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:00,329 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:00,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:00,329 INFO L82 PathProgramCache]: Analyzing trace with hash -815480887, now seen corresponding path program 1 times [2018-11-28 16:10:00,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:00,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:00,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:00,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:00,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:00,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 799 proven. 0 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2018-11-28 16:10:00,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:00,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:00,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:00,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:00,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:00,532 INFO L87 Difference]: Start difference. First operand 3946 states and 5243 transitions. Second operand 3 states. [2018-11-28 16:10:00,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:00,743 INFO L93 Difference]: Finished difference Result 11310 states and 15105 transitions. [2018-11-28 16:10:00,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:00,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2018-11-28 16:10:00,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:00,786 INFO L225 Difference]: With dead ends: 11310 [2018-11-28 16:10:00,787 INFO L226 Difference]: Without dead ends: 7376 [2018-11-28 16:10:00,799 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,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7376 states. [2018-11-28 16:10:00,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7376 to 7374. [2018-11-28 16:10:00,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7374 states. [2018-11-28 16:10:00,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7374 states to 7374 states and 9853 transitions. [2018-11-28 16:10:00,926 INFO L78 Accepts]: Start accepts. Automaton has 7374 states and 9853 transitions. Word has length 329 [2018-11-28 16:10:00,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:00,927 INFO L480 AbstractCegarLoop]: Abstraction has 7374 states and 9853 transitions. [2018-11-28 16:10:00,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:00,927 INFO L276 IsEmpty]: Start isEmpty. Operand 7374 states and 9853 transitions. [2018-11-28 16:10:00,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-11-28 16:10:00,942 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:00,942 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 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, 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] [2018-11-28 16:10:00,942 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:00,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:00,943 INFO L82 PathProgramCache]: Analyzing trace with hash 415461791, now seen corresponding path program 1 times [2018-11-28 16:10:00,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:00,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:00,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:00,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:00,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:01,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 803 proven. 0 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2018-11-28 16:10:01,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:01,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:01,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:01,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:01,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:01,187 INFO L87 Difference]: Start difference. First operand 7374 states and 9853 transitions. Second operand 3 states. [2018-11-28 16:10:02,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:02,095 INFO L93 Difference]: Finished difference Result 14744 states and 19682 transitions. [2018-11-28 16:10:02,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:02,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2018-11-28 16:10:02,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:02,111 INFO L225 Difference]: With dead ends: 14744 [2018-11-28 16:10:02,111 INFO L226 Difference]: Without dead ends: 7382 [2018-11-28 16:10:02,124 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,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2018-11-28 16:10:02,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7350. [2018-11-28 16:10:02,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7350 states. [2018-11-28 16:10:02,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7350 states to 7350 states and 9573 transitions. [2018-11-28 16:10:02,252 INFO L78 Accepts]: Start accepts. Automaton has 7350 states and 9573 transitions. Word has length 330 [2018-11-28 16:10:02,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:02,253 INFO L480 AbstractCegarLoop]: Abstraction has 7350 states and 9573 transitions. [2018-11-28 16:10:02,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:02,253 INFO L276 IsEmpty]: Start isEmpty. Operand 7350 states and 9573 transitions. [2018-11-28 16:10:02,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-11-28 16:10:02,264 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:02,265 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,265 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:02,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:02,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1238161908, now seen corresponding path program 1 times [2018-11-28 16:10:02,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:02,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:02,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:02,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:02,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:02,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 874 proven. 10 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2018-11-28 16:10:02,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:10:02,535 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:02,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:02,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:10:03,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-11-28 16:10:03,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 16:10:03,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2018-11-28 16:10:03,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 16:10:03,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 16:10:03,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 16:10:03,190 INFO L87 Difference]: Start difference. First operand 7350 states and 9573 transitions. Second operand 7 states. [2018-11-28 16:10:06,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:06,022 INFO L93 Difference]: Finished difference Result 18408 states and 23982 transitions. [2018-11-28 16:10:06,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 16:10:06,025 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 353 [2018-11-28 16:10:06,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:06,046 INFO L225 Difference]: With dead ends: 18408 [2018-11-28 16:10:06,047 INFO L226 Difference]: Without dead ends: 11034 [2018-11-28 16:10:06,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-28 16:10:06,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11034 states. [2018-11-28 16:10:06,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11034 to 8460. [2018-11-28 16:10:06,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8460 states. [2018-11-28 16:10:06,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8460 states to 8460 states and 11077 transitions. [2018-11-28 16:10:06,282 INFO L78 Accepts]: Start accepts. Automaton has 8460 states and 11077 transitions. Word has length 353 [2018-11-28 16:10:06,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:06,282 INFO L480 AbstractCegarLoop]: Abstraction has 8460 states and 11077 transitions. [2018-11-28 16:10:06,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 16:10:06,284 INFO L276 IsEmpty]: Start isEmpty. Operand 8460 states and 11077 transitions. [2018-11-28 16:10:06,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-11-28 16:10:06,301 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:06,302 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 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, 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:06,302 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:06,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:06,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1345653892, now seen corresponding path program 1 times [2018-11-28 16:10:06,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:06,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:06,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:06,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:06,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:06,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2018-11-28 16:10:06,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:10:06,565 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:06,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:06,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:10:06,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2018-11-28 16:10:06,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:10:06,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-28 16:10:06,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 16:10:06,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 16:10:06,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 16:10:06,820 INFO L87 Difference]: Start difference. First operand 8460 states and 11077 transitions. Second operand 4 states. [2018-11-28 16:10:07,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:07,569 INFO L93 Difference]: Finished difference Result 19118 states and 24882 transitions. [2018-11-28 16:10:07,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 16:10:07,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 379 [2018-11-28 16:10:07,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:07,596 INFO L225 Difference]: With dead ends: 19118 [2018-11-28 16:10:07,597 INFO L226 Difference]: Without dead ends: 10668 [2018-11-28 16:10:07,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 16:10:07,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10668 states. [2018-11-28 16:10:07,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10668 to 8518. [2018-11-28 16:10:07,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8518 states. [2018-11-28 16:10:07,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8518 states to 8518 states and 10888 transitions. [2018-11-28 16:10:07,893 INFO L78 Accepts]: Start accepts. Automaton has 8518 states and 10888 transitions. Word has length 379 [2018-11-28 16:10:07,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:07,894 INFO L480 AbstractCegarLoop]: Abstraction has 8518 states and 10888 transitions. [2018-11-28 16:10:07,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 16:10:07,894 INFO L276 IsEmpty]: Start isEmpty. Operand 8518 states and 10888 transitions. [2018-11-28 16:10:08,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-11-28 16:10:08,023 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:08,024 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:08,024 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:08,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:08,025 INFO L82 PathProgramCache]: Analyzing trace with hash -391768364, now seen corresponding path program 1 times [2018-11-28 16:10:08,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:08,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:08,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:08,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:08,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:08,243 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:08,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:08,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:08,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:08,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:08,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:08,246 INFO L87 Difference]: Start difference. First operand 8518 states and 10888 transitions. Second operand 3 states. [2018-11-28 16:10:09,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:09,455 INFO L93 Difference]: Finished difference Result 15876 states and 19733 transitions. [2018-11-28 16:10:09,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:09,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 418 [2018-11-28 16:10:09,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:09,464 INFO L225 Difference]: With dead ends: 15876 [2018-11-28 16:10:09,464 INFO L226 Difference]: Without dead ends: 3820 [2018-11-28 16:10:09,479 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:09,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3820 states. [2018-11-28 16:10:09,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3820 to 3610. [2018-11-28 16:10:09,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3610 states. [2018-11-28 16:10:09,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3610 states to 3610 states and 4508 transitions. [2018-11-28 16:10:09,544 INFO L78 Accepts]: Start accepts. Automaton has 3610 states and 4508 transitions. Word has length 418 [2018-11-28 16:10:09,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:09,544 INFO L480 AbstractCegarLoop]: Abstraction has 3610 states and 4508 transitions. [2018-11-28 16:10:09,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:09,545 INFO L276 IsEmpty]: Start isEmpty. Operand 3610 states and 4508 transitions. [2018-11-28 16:10:09,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2018-11-28 16:10:09,556 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:09,556 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 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, 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:09,556 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:09,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:09,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1077932443, now seen corresponding path program 1 times [2018-11-28 16:10:09,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:09,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:09,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:09,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:09,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:09,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1648 proven. 14 refuted. 0 times theorem prover too weak. 1236 trivial. 0 not checked. [2018-11-28 16:10:09,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:10:09,891 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:09,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:10,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:10:10,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1075 proven. 0 refuted. 0 times theorem prover too weak. 1823 trivial. 0 not checked. [2018-11-28 16:10:10,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 16:10:10,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-28 16:10:10,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 16:10:10,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 16:10:10,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 16:10:10,524 INFO L87 Difference]: Start difference. First operand 3610 states and 4508 transitions. Second operand 5 states. [2018-11-28 16:10:11,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:11,300 INFO L93 Difference]: Finished difference Result 4555 states and 5673 transitions. [2018-11-28 16:10:11,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 16:10:11,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 516 [2018-11-28 16:10:11,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:11,302 INFO L225 Difference]: With dead ends: 4555 [2018-11-28 16:10:11,302 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 16:10:11,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 518 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:11,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 16:10:11,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 16:10:11,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 16:10:11,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 16:10:11,309 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 516 [2018-11-28 16:10:11,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:11,309 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 16:10:11,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 16:10:11,309 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 16:10:11,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 16:10:11,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 16:10:11,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:11,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:12,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:12,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:12,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:12,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:12,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:12,076 WARN L180 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 429 DAG size of output: 102 [2018-11-28 16:10:12,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:12,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:12,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 16:10:13,081 WARN L180 SmtUtils]: Spent 989.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2018-11-28 16:10:13,198 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2018-11-28 16:10:13,584 WARN L180 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2018-11-28 16:10:13,807 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 19 [2018-11-28 16:10:13,916 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2018-11-28 16:10:14,262 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 22 [2018-11-28 16:10:14,943 WARN L180 SmtUtils]: Spent 678.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2018-11-28 16:10:15,024 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 16:10:15,024 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 16:10:15,024 INFO L448 ceAbstractionStarter]: For program point L432(lines 432 434) no Hoare annotation was computed. [2018-11-28 16:10:15,025 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 335) no Hoare annotation was computed. [2018-11-28 16:10:15,025 INFO L448 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 549) no Hoare annotation was computed. [2018-11-28 16:10:15,025 INFO L451 ceAbstractionStarter]: At program point L201(lines 200 488) the Hoare annotation is: true [2018-11-28 16:10:15,025 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 498) no Hoare annotation was computed. [2018-11-28 16:10:15,027 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 509) no Hoare annotation was computed. [2018-11-28 16:10:15,027 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 520) no Hoare annotation was computed. [2018-11-28 16:10:15,027 INFO L444 ceAbstractionStarter]: At program point L169(lines 165 499) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~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) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse2))) [2018-11-28 16:10:15,028 INFO L444 ceAbstractionStarter]: At program point L103(lines 102 520) 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:15,028 INFO L448 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2018-11-28 16:10:15,028 INFO L448 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2018-11-28 16:10:15,028 INFO L448 ceAbstractionStarter]: For program point L435(lines 435 439) no Hoare annotation was computed. [2018-11-28 16:10:15,028 INFO L448 ceAbstractionStarter]: For program point L435-2(lines 435 439) no Hoare annotation was computed. [2018-11-28 16:10:15,028 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 340) no Hoare annotation was computed. [2018-11-28 16:10:15,028 INFO L448 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2018-11-28 16:10:15,028 INFO L448 ceAbstractionStarter]: For program point L336-2(lines 336 340) no Hoare annotation was computed. [2018-11-28 16:10:15,028 INFO L448 ceAbstractionStarter]: For program point L270-2(lines 202 485) no Hoare annotation was computed. [2018-11-28 16:10:15,029 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 497) no Hoare annotation was computed. [2018-11-28 16:10:15,031 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 508) no Hoare annotation was computed. [2018-11-28 16:10:15,032 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 519) no Hoare annotation was computed. [2018-11-28 16:10:15,032 INFO L444 ceAbstractionStarter]: At program point L139(lines 135 509) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) .cse1) (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1))) [2018-11-28 16:10:15,032 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 307) no Hoare annotation was computed. [2018-11-28 16:10:15,032 INFO L448 ceAbstractionStarter]: For program point L239(lines 239 242) no Hoare annotation was computed. [2018-11-28 16:10:15,032 INFO L448 ceAbstractionStarter]: For program point L305-2(lines 202 485) no Hoare annotation was computed. [2018-11-28 16:10:15,032 INFO L448 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2018-11-28 16:10:15,032 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 374) no Hoare annotation was computed. [2018-11-28 16:10:15,035 INFO L444 ceAbstractionStarter]: At program point L207(lines 105 519) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (<= ssl3_connect_~blastFlag~0 0)) [2018-11-28 16:10:15,035 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 496) no Hoare annotation was computed. [2018-11-28 16:10:15,035 INFO L448 ceAbstractionStarter]: For program point L141(lines 141 507) no Hoare annotation was computed. [2018-11-28 16:10:15,036 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 518) no Hoare annotation was computed. [2018-11-28 16:10:15,036 INFO L444 ceAbstractionStarter]: At program point L175(lines 171 497) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~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) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse2))) [2018-11-28 16:10:15,036 INFO L448 ceAbstractionStarter]: For program point L473(lines 473 475) no Hoare annotation was computed. [2018-11-28 16:10:15,036 INFO L448 ceAbstractionStarter]: For program point L473-2(lines 473 475) no Hoare annotation was computed. [2018-11-28 16:10:15,036 INFO L451 ceAbstractionStarter]: At program point L540(lines 98 541) the Hoare annotation is: true [2018-11-28 16:10:15,036 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 280) no Hoare annotation was computed. [2018-11-28 16:10:15,036 INFO L448 ceAbstractionStarter]: For program point L276-2(lines 276 280) no Hoare annotation was computed. [2018-11-28 16:10:15,036 INFO L448 ceAbstractionStarter]: For program point L177(lines 177 495) no Hoare annotation was computed. [2018-11-28 16:10:15,037 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 506) no Hoare annotation was computed. [2018-11-28 16:10:15,037 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 517) no Hoare annotation was computed. [2018-11-28 16:10:15,037 INFO L444 ceAbstractionStarter]: At program point L145(lines 141 507) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 (= ssl3_connect_~s__hit~0 0)) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1))) [2018-11-28 16:10:15,037 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 214) no Hoare annotation was computed. [2018-11-28 16:10:15,037 INFO L448 ceAbstractionStarter]: For program point L212-2(lines 212 214) no Hoare annotation was computed. [2018-11-28 16:10:15,037 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 494) no Hoare annotation was computed. [2018-11-28 16:10:15,037 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 505) no Hoare annotation was computed. [2018-11-28 16:10:15,037 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 516) no Hoare annotation was computed. [2018-11-28 16:10:15,037 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 480) no Hoare annotation was computed. [2018-11-28 16:10:15,038 INFO L448 ceAbstractionStarter]: For program point L445(lines 445 456) no Hoare annotation was computed. [2018-11-28 16:10:15,038 INFO L448 ceAbstractionStarter]: For program point L412(lines 412 426) no Hoare annotation was computed. [2018-11-28 16:10:15,038 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 412 426) no Hoare annotation was computed. [2018-11-28 16:10:15,038 INFO L448 ceAbstractionStarter]: For program point L445-2(lines 445 456) no Hoare annotation was computed. [2018-11-28 16:10:15,038 INFO L448 ceAbstractionStarter]: For program point L313(lines 313 316) no Hoare annotation was computed. [2018-11-28 16:10:15,038 INFO L444 ceAbstractionStarter]: At program point L181(lines 177 495) 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:15,038 INFO L448 ceAbstractionStarter]: For program point L545(lines 545 547) no Hoare annotation was computed. [2018-11-28 16:10:15,038 INFO L448 ceAbstractionStarter]: For program point L545-2(lines 545 547) no Hoare annotation was computed. [2018-11-28 16:10:15,039 INFO L448 ceAbstractionStarter]: For program point L348(lines 348 350) no Hoare annotation was computed. [2018-11-28 16:10:15,045 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 493) no Hoare annotation was computed. [2018-11-28 16:10:15,046 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 504) no Hoare annotation was computed. [2018-11-28 16:10:15,046 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 515) no Hoare annotation was computed. [2018-11-28 16:10:15,046 INFO L451 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 552) the Hoare annotation is: true [2018-11-28 16:10:15,046 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2018-11-28 16:10:15,046 INFO L448 ceAbstractionStarter]: For program point L217(lines 217 220) no Hoare annotation was computed. [2018-11-28 16:10:15,046 INFO L444 ceAbstractionStarter]: At program point L151(lines 147 505) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= 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) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1))) [2018-11-28 16:10:15,046 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 91) no Hoare annotation was computed. [2018-11-28 16:10:15,046 INFO L448 ceAbstractionStarter]: For program point L416(lines 416 422) no Hoare annotation was computed. [2018-11-28 16:10:15,047 INFO L448 ceAbstractionStarter]: For program point L251(lines 251 257) no Hoare annotation was computed. [2018-11-28 16:10:15,047 INFO L448 ceAbstractionStarter]: For program point L450(lines 450 453) no Hoare annotation was computed. [2018-11-28 16:10:15,047 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 492) no Hoare annotation was computed. [2018-11-28 16:10:15,047 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 503) no Hoare annotation was computed. [2018-11-28 16:10:15,047 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 514) no Hoare annotation was computed. [2018-11-28 16:10:15,047 INFO L444 ceAbstractionStarter]: At program point L187(lines 183 493) 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:15,047 INFO L444 ceAbstractionStarter]: At program point L121(lines 117 515) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 0) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560))) [2018-11-28 16:10:15,049 INFO L448 ceAbstractionStarter]: For program point L88(lines 88 90) no Hoare annotation was computed. [2018-11-28 16:10:15,049 INFO L448 ceAbstractionStarter]: For program point L88-2(lines 85 91) no Hoare annotation was computed. [2018-11-28 16:10:15,049 INFO L448 ceAbstractionStarter]: For program point $Ultimate##85(lines 202 487) no Hoare annotation was computed. [2018-11-28 16:10:15,049 INFO L448 ceAbstractionStarter]: For program point $Ultimate##84(lines 202 487) no Hoare annotation was computed. [2018-11-28 16:10:15,049 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 297) no Hoare annotation was computed. [2018-11-28 16:10:15,049 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 256) no Hoare annotation was computed. [2018-11-28 16:10:15,049 INFO L448 ceAbstractionStarter]: For program point L287-2(lines 287 297) no Hoare annotation was computed. [2018-11-28 16:10:15,050 INFO L448 ceAbstractionStarter]: For program point L254-2(lines 202 485) no Hoare annotation was computed. [2018-11-28 16:10:15,050 INFO L444 ceAbstractionStarter]: At program point L486(lines 99 539) 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 .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) (<= ssl3_connect_~blastFlag~0 0) (and .cse7 .cse15 .cse1)))) [2018-11-28 16:10:15,050 INFO L448 ceAbstractionStarter]: For program point L321(lines 321 323) no Hoare annotation was computed. [2018-11-28 16:10:15,050 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 491) no Hoare annotation was computed. [2018-11-28 16:10:15,050 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 502) no Hoare annotation was computed. [2018-11-28 16:10:15,050 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 513) no Hoare annotation was computed. [2018-11-28 16:10:15,051 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 392) no Hoare annotation was computed. [2018-11-28 16:10:15,051 INFO L444 ceAbstractionStarter]: At program point L322(lines 76 551) the Hoare annotation is: (< |ssl3_connect_#in~initial_state| 12292) [2018-11-28 16:10:15,051 INFO L448 ceAbstractionStarter]: For program point L388-2(lines 202 485) no Hoare annotation was computed. [2018-11-28 16:10:15,051 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 234) no Hoare annotation was computed. [2018-11-28 16:10:15,051 INFO L448 ceAbstractionStarter]: For program point L223-2(lines 202 485) no Hoare annotation was computed. [2018-11-28 16:10:15,051 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 537) no Hoare annotation was computed. [2018-11-28 16:10:15,051 INFO L448 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 552) no Hoare annotation was computed. [2018-11-28 16:10:15,051 INFO L448 ceAbstractionStarter]: For program point L522(lines 522 536) no Hoare annotation was computed. [2018-11-28 16:10:15,051 INFO L448 ceAbstractionStarter]: For program point L357(lines 357 359) no Hoare annotation was computed. [2018-11-28 16:10:15,052 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2018-11-28 16:10:15,052 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 293) no Hoare annotation was computed. [2018-11-28 16:10:15,052 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 228) no Hoare annotation was computed. [2018-11-28 16:10:15,052 INFO L448 ceAbstractionStarter]: For program point L291-2(lines 289 297) no Hoare annotation was computed. [2018-11-28 16:10:15,052 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 490) no Hoare annotation was computed. [2018-11-28 16:10:15,052 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 501) no Hoare annotation was computed. [2018-11-28 16:10:15,052 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 512) no Hoare annotation was computed. [2018-11-28 16:10:15,052 INFO L448 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2018-11-28 16:10:15,052 INFO L448 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 552) no Hoare annotation was computed. [2018-11-28 16:10:15,053 INFO L448 ceAbstractionStarter]: For program point L523(lines 523 528) no Hoare annotation was computed. [2018-11-28 16:10:15,053 INFO L448 ceAbstractionStarter]: For program point L523-2(lines 522 536) no Hoare annotation was computed. [2018-11-28 16:10:15,053 INFO L444 ceAbstractionStarter]: At program point L193(lines 189 491) 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_~blastFlag~0 0) .cse0) (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:15,053 INFO L444 ceAbstractionStarter]: At program point L127(lines 123 513) 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:15,053 INFO L448 ceAbstractionStarter]: For program point L94(lines 94 96) no Hoare annotation was computed. [2018-11-28 16:10:15,053 INFO L448 ceAbstractionStarter]: For program point L525(lines 525 527) no Hoare annotation was computed. [2018-11-28 16:10:15,053 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 489) no Hoare annotation was computed. [2018-11-28 16:10:15,054 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 500) no Hoare annotation was computed. [2018-11-28 16:10:15,054 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 511) no Hoare annotation was computed. [2018-11-28 16:10:15,054 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 366) no Hoare annotation was computed. [2018-11-28 16:10:15,054 INFO L448 ceAbstractionStarter]: For program point L361-2(lines 361 366) no Hoare annotation was computed. [2018-11-28 16:10:15,054 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 232) no Hoare annotation was computed. [2018-11-28 16:10:15,054 INFO L444 ceAbstractionStarter]: At program point L196(lines 195 489) 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 0) .cse0 .cse1) (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:15,054 INFO L444 ceAbstractionStarter]: At program point L163(lines 153 503) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~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) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse2))) [2018-11-28 16:10:15,062 INFO L448 ceAbstractionStarter]: For program point L461-1(lines 461 463) no Hoare annotation was computed. [2018-11-28 16:10:15,062 INFO L448 ceAbstractionStarter]: For program point L263(lines 263 265) no Hoare annotation was computed. [2018-11-28 16:10:15,062 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 488) no Hoare annotation was computed. [2018-11-28 16:10:15,062 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 499) no Hoare annotation was computed. [2018-11-28 16:10:15,062 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 510) no Hoare annotation was computed. [2018-11-28 16:10:15,062 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 76 551) no Hoare annotation was computed. [2018-11-28 16:10:15,062 INFO L448 ceAbstractionStarter]: For program point L397(lines 397 400) no Hoare annotation was computed. [2018-11-28 16:10:15,063 INFO L451 ceAbstractionStarter]: At program point L199(lines 198 488) the Hoare annotation is: true [2018-11-28 16:10:15,063 INFO L444 ceAbstractionStarter]: At program point L133(lines 129 511) the Hoare annotation is: (let ((.cse0 (<= 4352 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 (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse2 .cse1))) [2018-11-28 16:10:15,063 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-28 16:10:15,063 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 534) no Hoare annotation was computed. [2018-11-28 16:10:15,063 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 16:10:15,063 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 16:10:15,063 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 16:10:15,063 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 16:10:15,064 INFO L444 ceAbstractionStarter]: At program point L559(line 559) the Hoare annotation is: (<= 12292 main_~s~0) [2018-11-28 16:10:15,067 INFO L448 ceAbstractionStarter]: For program point L559-1(line 559) no Hoare annotation was computed. [2018-11-28 16:10:15,067 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 553 563) the Hoare annotation is: true [2018-11-28 16:10:15,067 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 553 563) no Hoare annotation was computed. [2018-11-28 16:10:15,067 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 553 563) no Hoare annotation was computed. [2018-11-28 16:10:15,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:10:15 BoogieIcfgContainer [2018-11-28 16:10:15,105 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 16:10:15,105 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 16:10:15,105 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 16:10:15,105 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 16:10:15,108 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:48" (3/4) ... [2018-11-28 16:10:15,115 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 16:10:15,128 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 16:10:15,128 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_connect [2018-11-28 16:10:15,129 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 16:10:15,147 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-11-28 16:10:15,148 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-28 16:10:15,149 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 16:10:15,181 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state) [2018-11-28 16:10:15,181 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || blastFlag <= 0 [2018-11-28 16:10:15,182 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) [2018-11-28 16:10:15,182 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:15,183 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560)) || ((((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:15,185 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) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) [2018-11-28 16:10:15,185 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)) || (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 <= 0) || ((blastFlag <= 2 && s__state == 4400) && s__hit == 0) [2018-11-28 16:10:15,188 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)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) [2018-11-28 16:10:15,189 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)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) [2018-11-28 16:10:15,190 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 [2018-11-28 16:10:15,190 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)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) [2018-11-28 16:10:15,190 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)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) [2018-11-28 16:10:15,191 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)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) [2018-11-28 16:10:15,191 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:15,191 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:15,191 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || (blastFlag <= 0 && 4560 <= s__state)) || ((((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:15,195 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 <= 0 && s__state <= 4352) && 4352 <= s__state)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0)) [2018-11-28 16:10:15,293 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 16:10:15,293 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 16:10:15,295 INFO L168 Benchmark]: Toolchain (without parser) took 29050.94 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 769.1 MB). Free memory was 954.0 MB in the beginning and 871.2 MB in the end (delta: 82.9 MB). Peak memory consumption was 852.0 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:15,296 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:10:15,296 INFO L168 Benchmark]: CACSL2BoogieTranslator took 538.68 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 937.9 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:15,296 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.19 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:10:15,297 INFO L168 Benchmark]: Boogie Preprocessor took 127.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -183.5 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:15,297 INFO L168 Benchmark]: RCFGBuilder took 1264.40 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: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:15,298 INFO L168 Benchmark]: TraceAbstraction took 26897.47 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 634.4 MB). Free memory was 1.1 GB in the beginning and 871.2 MB in the end (delta: 205.1 MB). Peak memory consumption was 839.5 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:15,298 INFO L168 Benchmark]: Witness Printer took 188.28 ms. Allocated memory is still 1.8 GB. Free memory is still 871.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:10:15,304 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 538.68 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 937.9 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 28.19 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 127.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -183.5 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1264.40 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: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26897.47 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 634.4 MB). Free memory was 1.1 GB in the beginning and 871.2 MB in the end (delta: 205.1 MB). Peak memory consumption was 839.5 MB. Max. memory is 11.5 GB. * Witness Printer took 188.28 ms. Allocated memory is still 1.8 GB. Free memory is still 871.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 549]: 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: 189]: Loop Invariant Derived loop invariant: ((\old(initial_state) < 12292 || (blastFlag <= 0 && 4560 <= s__state)) || ((((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: 147]: 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)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 177]: 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: 135]: Loop Invariant Derived loop invariant: ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || blastFlag <= 0 - InvariantResult [Line: 171]: 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)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 195]: 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 <= 0 && s__state <= 4352) && 4352 <= s__state)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0)) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 - InvariantResult [Line: 153]: 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)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state) - InvariantResult [Line: 99]: 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)) || (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 <= 0) || ((blastFlag <= 2 && s__state == 4400) && s__hit == 0) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 183]: 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: 129]: Loop Invariant Derived loop invariant: ((\old(initial_state) < 12292 || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560)) || ((((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: 165]: 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)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 138 locations, 1 error locations. SAFE Result, 26.7s OverallTime, 24 OverallIterations, 20 TraceHistogramMax, 15.3s AutomataDifference, 0.0s DeadEndRemovalTime, 3.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 4971 SDtfs, 1932 SDslu, 3379 SDs, 0 SdLazy, 2650 SolverSat, 478 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1335 GetRequests, 1296 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8518occurred in iteration=22, 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.6s AutomataMinimizationTime, 24 MinimizatonAttempts, 5532 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 269 NumberOfFragments, 774 HoareAnnotationTreeSize, 26 FomulaSimplifications, 17828 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 26 FomulaSimplificationsInter, 1764 FormulaSimplificationTreeSizeReductionInter, 2.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 6709 NumberOfCodeBlocks, 6709 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 6682 ConstructedInterpolants, 0 QuantifiedInterpolants, 3264518 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2303 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 27 InterpolantComputations, 23 PerfectInterpolantSequences, 26313/26347 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...