./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/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 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c900393f-b9b4-434f-80b8-d63e9b52172e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c900393f-b9b4-434f-80b8-d63e9b52172e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c900393f-b9b4-434f-80b8-d63e9b52172e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c900393f-b9b4-434f-80b8-d63e9b52172e/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_2_true-unreach-call_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c900393f-b9b4-434f-80b8-d63e9b52172e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c900393f-b9b4-434f-80b8-d63e9b52172e/bin-2019/uautomizer --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.23-0cd3be1 [2018-11-28 11:27:59,462 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:27:59,463 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:27:59,471 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:27:59,471 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:27:59,472 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:27:59,473 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:27:59,474 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:27:59,476 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:27:59,476 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:27:59,477 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:27:59,477 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:27:59,478 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:27:59,479 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:27:59,479 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:27:59,480 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:27:59,481 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:27:59,482 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:27:59,483 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:27:59,485 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:27:59,485 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:27:59,486 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:27:59,488 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:27:59,488 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:27:59,488 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:27:59,489 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:27:59,490 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:27:59,490 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:27:59,491 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:27:59,492 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:27:59,492 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:27:59,492 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:27:59,492 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:27:59,492 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:27:59,493 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:27:59,494 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:27:59,494 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c900393f-b9b4-434f-80b8-d63e9b52172e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 11:27:59,503 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:27:59,504 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:27:59,504 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 11:27:59,504 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 11:27:59,505 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:27:59,505 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:27:59,505 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:27:59,505 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:27:59,505 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:27:59,506 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:27:59,506 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:27:59,506 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:27:59,506 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 11:27:59,506 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 11:27:59,506 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 11:27:59,506 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:27:59,506 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:27:59,506 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:27:59,507 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 11:27:59,507 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:27:59,507 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:27:59,507 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 11:27:59,507 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 11:27:59,507 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:27:59,507 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:27:59,508 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 11:27:59,508 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 11:27:59,508 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:27:59,508 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 11:27:59,508 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 11:27:59,508 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_c900393f-b9b4-434f-80b8-d63e9b52172e/bin-2019/uautomizer 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 11:27:59,531 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:27:59,541 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:27:59,544 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:27:59,545 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:27:59,546 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:27:59,546 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c900393f-b9b4-434f-80b8-d63e9b52172e/bin-2019/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_clnt_2_true-unreach-call_true-termination.cil.c [2018-11-28 11:27:59,588 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c900393f-b9b4-434f-80b8-d63e9b52172e/bin-2019/uautomizer/data/529a9892a/9939af02f38546f2a110710ff874b07f/FLAG945eaa0e2 [2018-11-28 11:28:00,004 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:28:00,005 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c900393f-b9b4-434f-80b8-d63e9b52172e/sv-benchmarks/c/ssh-simplified/s3_clnt_2_true-unreach-call_true-termination.cil.c [2018-11-28 11:28:00,012 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c900393f-b9b4-434f-80b8-d63e9b52172e/bin-2019/uautomizer/data/529a9892a/9939af02f38546f2a110710ff874b07f/FLAG945eaa0e2 [2018-11-28 11:28:00,024 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c900393f-b9b4-434f-80b8-d63e9b52172e/bin-2019/uautomizer/data/529a9892a/9939af02f38546f2a110710ff874b07f [2018-11-28 11:28:00,027 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:28:00,028 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:28:00,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:28:00,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:28:00,032 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:28:00,033 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:28:00" (1/1) ... [2018-11-28 11:28:00,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@86cb13f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:28:00, skipping insertion in model container [2018-11-28 11:28:00,035 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:28:00" (1/1) ... [2018-11-28 11:28:00,041 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:28:00,066 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:28:00,215 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:28:00,219 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:28:00,259 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:28:00,308 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:28:00,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:28:00 WrapperNode [2018-11-28 11:28:00,308 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:28:00,309 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:28:00,309 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:28:00,309 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:28:00,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:28:00" (1/1) ... [2018-11-28 11:28:00,323 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:28:00" (1/1) ... [2018-11-28 11:28:00,330 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:28:00,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:28:00,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:28:00,330 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:28:00,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:28:00" (1/1) ... [2018-11-28 11:28:00,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:28:00" (1/1) ... [2018-11-28 11:28:00,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:28:00" (1/1) ... [2018-11-28 11:28:00,340 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:28:00" (1/1) ... [2018-11-28 11:28:00,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:28:00" (1/1) ... [2018-11-28 11:28:00,357 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:28:00" (1/1) ... [2018-11-28 11:28:00,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:28:00" (1/1) ... [2018-11-28 11:28:00,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:28:00,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:28:00,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:28:00,363 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:28:00,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:28:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c900393f-b9b4-434f-80b8-d63e9b52172e/bin-2019/uautomizer/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 11:28:00,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 11:28:00,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 11:28:00,410 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-11-28 11:28:00,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-11-28 11:28:00,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:28:00,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:28:00,410 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 11:28:00,410 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 11:28:00,507 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 11:28:00,507 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 11:28:00,867 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:28:00,867 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 11:28:00,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:28:00 BoogieIcfgContainer [2018-11-28 11:28:00,867 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:28:00,868 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 11:28:00,868 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 11:28:00,871 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 11:28:00,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:28:00" (1/3) ... [2018-11-28 11:28:00,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea3dc14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:28:00, skipping insertion in model container [2018-11-28 11:28:00,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:28:00" (2/3) ... [2018-11-28 11:28:00,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea3dc14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:28:00, skipping insertion in model container [2018-11-28 11:28:00,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:28:00" (3/3) ... [2018-11-28 11:28:00,874 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_2_true-unreach-call_true-termination.cil.c [2018-11-28 11:28:00,883 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 11:28:00,890 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 11:28:00,905 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 11:28:00,933 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:28:00,933 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 11:28:00,933 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 11:28:00,933 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 11:28:00,934 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:28:00,934 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:28:00,934 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 11:28:00,934 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:28:00,934 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 11:28:00,952 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2018-11-28 11:28:00,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 11:28:00,958 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:00,959 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 11:28:00,961 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:00,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:00,966 INFO L82 PathProgramCache]: Analyzing trace with hash 173387410, now seen corresponding path program 1 times [2018-11-28 11:28:00,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:00,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:01,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:01,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:01,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:01,139 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 11:28:01,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:28:01,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:28:01,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:28:01,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:28:01,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:28:01,155 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2018-11-28 11:28:01,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:01,217 INFO L93 Difference]: Finished difference Result 377 states and 634 transitions. [2018-11-28 11:28:01,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:28:01,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-28 11:28:01,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:01,229 INFO L225 Difference]: With dead ends: 377 [2018-11-28 11:28:01,230 INFO L226 Difference]: Without dead ends: 220 [2018-11-28 11:28:01,232 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 11:28:01,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-11-28 11:28:01,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-11-28 11:28:01,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-11-28 11:28:01,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 326 transitions. [2018-11-28 11:28:01,272 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 326 transitions. Word has length 29 [2018-11-28 11:28:01,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:01,273 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 326 transitions. [2018-11-28 11:28:01,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:28:01,273 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 326 transitions. [2018-11-28 11:28:01,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-28 11:28:01,274 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:01,275 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 11:28:01,275 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:01,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:01,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1426924635, now seen corresponding path program 1 times [2018-11-28 11:28:01,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:01,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:01,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:01,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:01,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:01,325 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 11:28:01,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:28:01,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:28:01,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:28:01,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:28:01,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:28:01,327 INFO L87 Difference]: Start difference. First operand 220 states and 326 transitions. Second operand 3 states. [2018-11-28 11:28:01,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:01,483 INFO L93 Difference]: Finished difference Result 470 states and 707 transitions. [2018-11-28 11:28:01,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:28:01,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-11-28 11:28:01,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:01,485 INFO L225 Difference]: With dead ends: 470 [2018-11-28 11:28:01,486 INFO L226 Difference]: Without dead ends: 262 [2018-11-28 11:28:01,487 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 11:28:01,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-11-28 11:28:01,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 254. [2018-11-28 11:28:01,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-11-28 11:28:01,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 370 transitions. [2018-11-28 11:28:01,500 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 370 transitions. Word has length 43 [2018-11-28 11:28:01,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:01,500 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 370 transitions. [2018-11-28 11:28:01,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:28:01,500 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 370 transitions. [2018-11-28 11:28:01,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 11:28:01,502 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:01,502 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 11:28:01,502 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:01,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:01,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1669760968, now seen corresponding path program 1 times [2018-11-28 11:28:01,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:01,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:01,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:01,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:01,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:01,554 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 11:28:01,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:28:01,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:28:01,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:28:01,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:28:01,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:28:01,555 INFO L87 Difference]: Start difference. First operand 254 states and 370 transitions. Second operand 3 states. [2018-11-28 11:28:01,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:01,726 INFO L93 Difference]: Finished difference Result 598 states and 902 transitions. [2018-11-28 11:28:01,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:28:01,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-11-28 11:28:01,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:01,728 INFO L225 Difference]: With dead ends: 598 [2018-11-28 11:28:01,728 INFO L226 Difference]: Without dead ends: 354 [2018-11-28 11:28:01,729 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 11:28:01,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-11-28 11:28:01,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 336. [2018-11-28 11:28:01,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-11-28 11:28:01,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 470 transitions. [2018-11-28 11:28:01,745 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 470 transitions. Word has length 60 [2018-11-28 11:28:01,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:01,745 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 470 transitions. [2018-11-28 11:28:01,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:28:01,745 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 470 transitions. [2018-11-28 11:28:01,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 11:28:01,747 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:01,748 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 11:28:01,748 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:01,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:01,748 INFO L82 PathProgramCache]: Analyzing trace with hash 819767994, now seen corresponding path program 1 times [2018-11-28 11:28:01,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:01,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:01,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:01,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:01,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:01,814 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 11:28:01,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:28:01,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:28:01,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:28:01,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:28:01,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:28:01,815 INFO L87 Difference]: Start difference. First operand 336 states and 470 transitions. Second operand 3 states. [2018-11-28 11:28:01,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:01,936 INFO L93 Difference]: Finished difference Result 708 states and 1005 transitions. [2018-11-28 11:28:01,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:28:01,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-11-28 11:28:01,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:01,939 INFO L225 Difference]: With dead ends: 708 [2018-11-28 11:28:01,939 INFO L226 Difference]: Without dead ends: 384 [2018-11-28 11:28:01,940 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 11:28:01,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-11-28 11:28:01,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 374. [2018-11-28 11:28:01,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-11-28 11:28:01,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 518 transitions. [2018-11-28 11:28:01,954 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 518 transitions. Word has length 60 [2018-11-28 11:28:01,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:01,954 INFO L480 AbstractCegarLoop]: Abstraction has 374 states and 518 transitions. [2018-11-28 11:28:01,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:28:01,954 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 518 transitions. [2018-11-28 11:28:01,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-28 11:28:01,956 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:01,956 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 11:28:01,956 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:01,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:01,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1719879938, now seen corresponding path program 1 times [2018-11-28 11:28:01,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:01,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:01,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:01,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:01,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:02,008 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 11:28:02,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:28:02,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:28:02,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:28:02,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:28:02,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:28:02,009 INFO L87 Difference]: Start difference. First operand 374 states and 518 transitions. Second operand 3 states. [2018-11-28 11:28:02,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:02,157 INFO L93 Difference]: Finished difference Result 842 states and 1204 transitions. [2018-11-28 11:28:02,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:28:02,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-11-28 11:28:02,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:02,165 INFO L225 Difference]: With dead ends: 842 [2018-11-28 11:28:02,165 INFO L226 Difference]: Without dead ends: 478 [2018-11-28 11:28:02,166 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 11:28:02,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-11-28 11:28:02,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 452. [2018-11-28 11:28:02,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-11-28 11:28:02,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 652 transitions. [2018-11-28 11:28:02,180 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 652 transitions. Word has length 73 [2018-11-28 11:28:02,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:02,181 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 652 transitions. [2018-11-28 11:28:02,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:28:02,181 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 652 transitions. [2018-11-28 11:28:02,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-28 11:28:02,183 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:02,183 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 11:28:02,183 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:02,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:02,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1093696729, now seen corresponding path program 1 times [2018-11-28 11:28:02,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:02,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:02,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:02,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:02,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:02,236 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 11:28:02,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:28:02,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:28:02,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:28:02,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:28:02,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:28:02,238 INFO L87 Difference]: Start difference. First operand 452 states and 652 transitions. Second operand 3 states. [2018-11-28 11:28:02,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:02,338 INFO L93 Difference]: Finished difference Result 940 states and 1365 transitions. [2018-11-28 11:28:02,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:28:02,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-11-28 11:28:02,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:02,341 INFO L225 Difference]: With dead ends: 940 [2018-11-28 11:28:02,341 INFO L226 Difference]: Without dead ends: 500 [2018-11-28 11:28:02,342 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 11:28:02,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-11-28 11:28:02,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 494. [2018-11-28 11:28:02,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-11-28 11:28:02,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 704 transitions. [2018-11-28 11:28:02,354 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 704 transitions. Word has length 77 [2018-11-28 11:28:02,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:02,355 INFO L480 AbstractCegarLoop]: Abstraction has 494 states and 704 transitions. [2018-11-28 11:28:02,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:28:02,355 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 704 transitions. [2018-11-28 11:28:02,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-28 11:28:02,356 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:02,356 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 11:28:02,357 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:02,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:02,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1180839903, now seen corresponding path program 1 times [2018-11-28 11:28:02,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:02,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:02,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:02,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:02,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:02,403 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 11:28:02,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:28:02,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:28:02,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:28:02,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:28:02,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:28:02,404 INFO L87 Difference]: Start difference. First operand 494 states and 704 transitions. Second operand 3 states. [2018-11-28 11:28:02,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:02,437 INFO L93 Difference]: Finished difference Result 976 states and 1397 transitions. [2018-11-28 11:28:02,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:28:02,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-11-28 11:28:02,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:02,441 INFO L225 Difference]: With dead ends: 976 [2018-11-28 11:28:02,441 INFO L226 Difference]: Without dead ends: 734 [2018-11-28 11:28:02,441 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 11:28:02,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-11-28 11:28:02,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2018-11-28 11:28:02,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-11-28 11:28:02,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1047 transitions. [2018-11-28 11:28:02,458 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1047 transitions. Word has length 97 [2018-11-28 11:28:02,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:02,458 INFO L480 AbstractCegarLoop]: Abstraction has 734 states and 1047 transitions. [2018-11-28 11:28:02,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:28:02,458 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1047 transitions. [2018-11-28 11:28:02,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 11:28:02,460 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:02,460 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 11:28:02,460 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:02,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:02,460 INFO L82 PathProgramCache]: Analyzing trace with hash 866854985, now seen corresponding path program 1 times [2018-11-28 11:28:02,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:02,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:02,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:02,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:02,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:02,495 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 11:28:02,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:28:02,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:28:02,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:28:02,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:28:02,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:28:02,497 INFO L87 Difference]: Start difference. First operand 734 states and 1047 transitions. Second operand 3 states. [2018-11-28 11:28:02,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:02,526 INFO L93 Difference]: Finished difference Result 976 states and 1394 transitions. [2018-11-28 11:28:02,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:28:02,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-11-28 11:28:02,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:02,530 INFO L225 Difference]: With dead ends: 976 [2018-11-28 11:28:02,530 INFO L226 Difference]: Without dead ends: 974 [2018-11-28 11:28:02,531 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 11:28:02,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2018-11-28 11:28:02,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2018-11-28 11:28:02,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2018-11-28 11:28:02,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1392 transitions. [2018-11-28 11:28:02,552 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1392 transitions. Word has length 99 [2018-11-28 11:28:02,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:02,552 INFO L480 AbstractCegarLoop]: Abstraction has 974 states and 1392 transitions. [2018-11-28 11:28:02,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:28:02,552 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1392 transitions. [2018-11-28 11:28:02,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-28 11:28:02,554 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:02,555 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 11:28:02,555 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:02,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:02,555 INFO L82 PathProgramCache]: Analyzing trace with hash -394036509, now seen corresponding path program 1 times [2018-11-28 11:28:02,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:02,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:02,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:02,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:02,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:02,605 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 11:28:02,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:28:02,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:28:02,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:28:02,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:28:02,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:28:02,606 INFO L87 Difference]: Start difference. First operand 974 states and 1392 transitions. Second operand 3 states. [2018-11-28 11:28:02,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:02,763 INFO L93 Difference]: Finished difference Result 2140 states and 3108 transitions. [2018-11-28 11:28:02,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:28:02,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2018-11-28 11:28:02,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:02,767 INFO L225 Difference]: With dead ends: 2140 [2018-11-28 11:28:02,767 INFO L226 Difference]: Without dead ends: 1170 [2018-11-28 11:28:02,769 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 11:28:02,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2018-11-28 11:28:02,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1130. [2018-11-28 11:28:02,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2018-11-28 11:28:02,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1632 transitions. [2018-11-28 11:28:02,795 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1632 transitions. Word has length 168 [2018-11-28 11:28:02,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:02,796 INFO L480 AbstractCegarLoop]: Abstraction has 1130 states and 1632 transitions. [2018-11-28 11:28:02,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:28:02,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1632 transitions. [2018-11-28 11:28:02,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-28 11:28:02,798 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:02,799 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 11:28:02,799 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:02,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:02,799 INFO L82 PathProgramCache]: Analyzing trace with hash 531653490, now seen corresponding path program 1 times [2018-11-28 11:28:02,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:02,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:02,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:02,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:02,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:02,845 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 11:28:02,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:28:02,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:28:02,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:28:02,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:28:02,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:28:02,846 INFO L87 Difference]: Start difference. First operand 1130 states and 1632 transitions. Second operand 3 states. [2018-11-28 11:28:02,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:02,946 INFO L93 Difference]: Finished difference Result 2354 states and 3378 transitions. [2018-11-28 11:28:02,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:28:02,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2018-11-28 11:28:02,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:02,950 INFO L225 Difference]: With dead ends: 2354 [2018-11-28 11:28:02,950 INFO L226 Difference]: Without dead ends: 1236 [2018-11-28 11:28:02,952 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 11:28:02,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2018-11-28 11:28:02,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1222. [2018-11-28 11:28:02,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2018-11-28 11:28:02,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1744 transitions. [2018-11-28 11:28:02,977 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1744 transitions. Word has length 204 [2018-11-28 11:28:02,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:02,978 INFO L480 AbstractCegarLoop]: Abstraction has 1222 states and 1744 transitions. [2018-11-28 11:28:02,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:28:02,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1744 transitions. [2018-11-28 11:28:02,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-11-28 11:28:02,981 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:02,982 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 11:28:02,982 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:02,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:02,982 INFO L82 PathProgramCache]: Analyzing trace with hash -354539531, now seen corresponding path program 1 times [2018-11-28 11:28:02,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:02,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:02,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:02,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:02,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:03,042 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 11:28:03,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:28:03,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:28:03,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:28:03,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:28:03,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:28:03,043 INFO L87 Difference]: Start difference. First operand 1222 states and 1744 transitions. Second operand 3 states. [2018-11-28 11:28:03,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:03,137 INFO L93 Difference]: Finished difference Result 2544 states and 3620 transitions. [2018-11-28 11:28:03,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:28:03,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2018-11-28 11:28:03,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:03,142 INFO L225 Difference]: With dead ends: 2544 [2018-11-28 11:28:03,142 INFO L226 Difference]: Without dead ends: 1334 [2018-11-28 11:28:03,144 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 11:28:03,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2018-11-28 11:28:03,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1322. [2018-11-28 11:28:03,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2018-11-28 11:28:03,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1864 transitions. [2018-11-28 11:28:03,172 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1864 transitions. Word has length 225 [2018-11-28 11:28:03,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:03,173 INFO L480 AbstractCegarLoop]: Abstraction has 1322 states and 1864 transitions. [2018-11-28 11:28:03,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:28:03,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1864 transitions. [2018-11-28 11:28:03,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-28 11:28:03,176 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:03,177 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 11:28:03,177 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:03,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:03,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1874601560, now seen corresponding path program 1 times [2018-11-28 11:28:03,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:03,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:03,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:03,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:03,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:03,236 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 11:28:03,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:28:03,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:28:03,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:28:03,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:28:03,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:28:03,237 INFO L87 Difference]: Start difference. First operand 1322 states and 1864 transitions. Second operand 3 states. [2018-11-28 11:28:03,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:03,339 INFO L93 Difference]: Finished difference Result 2752 states and 3872 transitions. [2018-11-28 11:28:03,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:28:03,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2018-11-28 11:28:03,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:03,343 INFO L225 Difference]: With dead ends: 2752 [2018-11-28 11:28:03,343 INFO L226 Difference]: Without dead ends: 1442 [2018-11-28 11:28:03,345 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 11:28:03,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2018-11-28 11:28:03,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1434. [2018-11-28 11:28:03,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2018-11-28 11:28:03,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1996 transitions. [2018-11-28 11:28:03,373 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1996 transitions. Word has length 249 [2018-11-28 11:28:03,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:03,374 INFO L480 AbstractCegarLoop]: Abstraction has 1434 states and 1996 transitions. [2018-11-28 11:28:03,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:28:03,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1996 transitions. [2018-11-28 11:28:03,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-28 11:28:03,377 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:03,378 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 11:28:03,378 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:03,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:03,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1835594086, now seen corresponding path program 1 times [2018-11-28 11:28:03,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:03,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:03,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:03,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:03,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:03,466 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 11:28:03,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:28:03,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:28:03,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:28:03,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:28:03,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:28:03,467 INFO L87 Difference]: Start difference. First operand 1434 states and 1996 transitions. Second operand 3 states. [2018-11-28 11:28:03,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:03,575 INFO L93 Difference]: Finished difference Result 2992 states and 4172 transitions. [2018-11-28 11:28:03,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:28:03,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2018-11-28 11:28:03,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:03,580 INFO L225 Difference]: With dead ends: 2992 [2018-11-28 11:28:03,580 INFO L226 Difference]: Without dead ends: 1570 [2018-11-28 11:28:03,582 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 11:28:03,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2018-11-28 11:28:03,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1558. [2018-11-28 11:28:03,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-11-28 11:28:03,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2140 transitions. [2018-11-28 11:28:03,613 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2140 transitions. Word has length 249 [2018-11-28 11:28:03,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:03,613 INFO L480 AbstractCegarLoop]: Abstraction has 1558 states and 2140 transitions. [2018-11-28 11:28:03,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:28:03,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2140 transitions. [2018-11-28 11:28:03,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-11-28 11:28:03,617 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:03,618 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 11:28:03,618 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:03,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:03,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1915187928, now seen corresponding path program 1 times [2018-11-28 11:28:03,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:03,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:03,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:03,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:03,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:03,683 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 11:28:03,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:28:03,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:28:03,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:28:03,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:28:03,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:28:03,684 INFO L87 Difference]: Start difference. First operand 1558 states and 2140 transitions. Second operand 3 states. [2018-11-28 11:28:03,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:03,718 INFO L93 Difference]: Finished difference Result 4646 states and 6384 transitions. [2018-11-28 11:28:03,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:28:03,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2018-11-28 11:28:03,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:03,728 INFO L225 Difference]: With dead ends: 4646 [2018-11-28 11:28:03,728 INFO L226 Difference]: Without dead ends: 3100 [2018-11-28 11:28:03,731 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 11:28:03,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2018-11-28 11:28:03,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 3098. [2018-11-28 11:28:03,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3098 states. [2018-11-28 11:28:03,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4255 transitions. [2018-11-28 11:28:03,788 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4255 transitions. Word has length 279 [2018-11-28 11:28:03,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:03,788 INFO L480 AbstractCegarLoop]: Abstraction has 3098 states and 4255 transitions. [2018-11-28 11:28:03,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:28:03,788 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4255 transitions. [2018-11-28 11:28:03,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-11-28 11:28:03,794 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:03,794 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 11:28:03,795 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:03,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:03,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1795007718, now seen corresponding path program 1 times [2018-11-28 11:28:03,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:03,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:03,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:03,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:03,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:03,867 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 11:28:03,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:28:03,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:28:03,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:28:03,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:28:03,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:28:03,869 INFO L87 Difference]: Start difference. First operand 3098 states and 4255 transitions. Second operand 3 states. [2018-11-28 11:28:04,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:04,029 INFO L93 Difference]: Finished difference Result 6484 states and 8938 transitions. [2018-11-28 11:28:04,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:28:04,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2018-11-28 11:28:04,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:04,038 INFO L225 Difference]: With dead ends: 6484 [2018-11-28 11:28:04,039 INFO L226 Difference]: Without dead ends: 3398 [2018-11-28 11:28:04,043 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 11:28:04,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2018-11-28 11:28:04,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3382. [2018-11-28 11:28:04,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3382 states. [2018-11-28 11:28:04,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 4579 transitions. [2018-11-28 11:28:04,102 INFO L78 Accepts]: Start accepts. Automaton has 3382 states and 4579 transitions. Word has length 279 [2018-11-28 11:28:04,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:04,103 INFO L480 AbstractCegarLoop]: Abstraction has 3382 states and 4579 transitions. [2018-11-28 11:28:04,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:28:04,103 INFO L276 IsEmpty]: Start isEmpty. Operand 3382 states and 4579 transitions. [2018-11-28 11:28:04,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-11-28 11:28:04,110 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:04,110 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 11:28:04,111 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:04,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:04,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1052232894, now seen corresponding path program 1 times [2018-11-28 11:28:04,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:04,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:04,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:04,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:04,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:04,183 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 11:28:04,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:28:04,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:28:04,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:28:04,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:28:04,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:28:04,184 INFO L87 Difference]: Start difference. First operand 3382 states and 4579 transitions. Second operand 3 states. [2018-11-28 11:28:04,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:04,325 INFO L93 Difference]: Finished difference Result 6900 states and 9354 transitions. [2018-11-28 11:28:04,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:28:04,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2018-11-28 11:28:04,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:04,337 INFO L225 Difference]: With dead ends: 6900 [2018-11-28 11:28:04,337 INFO L226 Difference]: Without dead ends: 3530 [2018-11-28 11:28:04,342 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 11:28:04,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3530 states. [2018-11-28 11:28:04,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 3514. [2018-11-28 11:28:04,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2018-11-28 11:28:04,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 4731 transitions. [2018-11-28 11:28:04,402 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 4731 transitions. Word has length 303 [2018-11-28 11:28:04,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:04,402 INFO L480 AbstractCegarLoop]: Abstraction has 3514 states and 4731 transitions. [2018-11-28 11:28:04,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:28:04,402 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 4731 transitions. [2018-11-28 11:28:04,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-11-28 11:28:04,409 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:04,409 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 11:28:04,410 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:04,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:04,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1022376132, now seen corresponding path program 1 times [2018-11-28 11:28:04,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:04,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:04,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:04,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:04,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:04,505 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 11:28:04,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:28:04,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:28:04,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:28:04,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:28:04,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:28:04,506 INFO L87 Difference]: Start difference. First operand 3514 states and 4731 transitions. Second operand 3 states. [2018-11-28 11:28:04,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:04,672 INFO L93 Difference]: Finished difference Result 7416 states and 10118 transitions. [2018-11-28 11:28:04,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:28:04,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2018-11-28 11:28:04,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:04,683 INFO L225 Difference]: With dead ends: 7416 [2018-11-28 11:28:04,683 INFO L226 Difference]: Without dead ends: 3914 [2018-11-28 11:28:04,687 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 11:28:04,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3914 states. [2018-11-28 11:28:04,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3914 to 3826. [2018-11-28 11:28:04,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2018-11-28 11:28:04,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 5099 transitions. [2018-11-28 11:28:04,748 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 5099 transitions. Word has length 314 [2018-11-28 11:28:04,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:04,749 INFO L480 AbstractCegarLoop]: Abstraction has 3826 states and 5099 transitions. [2018-11-28 11:28:04,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:28:04,749 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 5099 transitions. [2018-11-28 11:28:04,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-11-28 11:28:04,754 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:04,755 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 11:28:04,755 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:04,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:04,755 INFO L82 PathProgramCache]: Analyzing trace with hash -773017638, now seen corresponding path program 1 times [2018-11-28 11:28:04,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:04,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:04,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:04,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:04,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:04,842 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 11:28:04,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:28:04,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:28:04,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:28:04,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:28:04,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:28:04,843 INFO L87 Difference]: Start difference. First operand 3826 states and 5099 transitions. Second operand 3 states. [2018-11-28 11:28:04,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:04,975 INFO L93 Difference]: Finished difference Result 8048 states and 10662 transitions. [2018-11-28 11:28:04,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:28:04,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2018-11-28 11:28:04,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:04,987 INFO L225 Difference]: With dead ends: 8048 [2018-11-28 11:28:04,988 INFO L226 Difference]: Without dead ends: 4234 [2018-11-28 11:28:04,993 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 11:28:04,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4234 states. [2018-11-28 11:28:05,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4234 to 3946. [2018-11-28 11:28:05,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3946 states. [2018-11-28 11:28:05,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 5243 transitions. [2018-11-28 11:28:05,051 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 5243 transitions. Word has length 328 [2018-11-28 11:28:05,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:05,051 INFO L480 AbstractCegarLoop]: Abstraction has 3946 states and 5243 transitions. [2018-11-28 11:28:05,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:28:05,052 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 5243 transitions. [2018-11-28 11:28:05,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-11-28 11:28:05,057 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:05,057 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 11:28:05,057 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:05,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:05,058 INFO L82 PathProgramCache]: Analyzing trace with hash -815480887, now seen corresponding path program 1 times [2018-11-28 11:28:05,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:05,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:05,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:05,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:05,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:05,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:05,166 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 11:28:05,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:28:05,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:28:05,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:28:05,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:28:05,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:28:05,169 INFO L87 Difference]: Start difference. First operand 3946 states and 5243 transitions. Second operand 3 states. [2018-11-28 11:28:05,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:05,237 INFO L93 Difference]: Finished difference Result 11310 states and 15105 transitions. [2018-11-28 11:28:05,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:28:05,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2018-11-28 11:28:05,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:05,254 INFO L225 Difference]: With dead ends: 11310 [2018-11-28 11:28:05,254 INFO L226 Difference]: Without dead ends: 7376 [2018-11-28 11:28:05,258 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 11:28:05,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7376 states. [2018-11-28 11:28:05,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7376 to 7374. [2018-11-28 11:28:05,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7374 states. [2018-11-28 11:28:05,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7374 states to 7374 states and 9853 transitions. [2018-11-28 11:28:05,323 INFO L78 Accepts]: Start accepts. Automaton has 7374 states and 9853 transitions. Word has length 329 [2018-11-28 11:28:05,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:05,323 INFO L480 AbstractCegarLoop]: Abstraction has 7374 states and 9853 transitions. [2018-11-28 11:28:05,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:28:05,323 INFO L276 IsEmpty]: Start isEmpty. Operand 7374 states and 9853 transitions. [2018-11-28 11:28:05,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-11-28 11:28:05,329 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:05,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, 1] [2018-11-28 11:28:05,329 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:05,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:05,330 INFO L82 PathProgramCache]: Analyzing trace with hash 415461791, now seen corresponding path program 1 times [2018-11-28 11:28:05,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:05,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:05,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:05,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:05,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:05,389 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 11:28:05,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:28:05,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:28:05,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:28:05,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:28:05,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:28:05,391 INFO L87 Difference]: Start difference. First operand 7374 states and 9853 transitions. Second operand 3 states. [2018-11-28 11:28:05,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:05,514 INFO L93 Difference]: Finished difference Result 14744 states and 19682 transitions. [2018-11-28 11:28:05,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:28:05,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2018-11-28 11:28:05,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:05,523 INFO L225 Difference]: With dead ends: 14744 [2018-11-28 11:28:05,523 INFO L226 Difference]: Without dead ends: 7382 [2018-11-28 11:28:05,529 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 11:28:05,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2018-11-28 11:28:05,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7350. [2018-11-28 11:28:05,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7350 states. [2018-11-28 11:28:05,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7350 states to 7350 states and 9573 transitions. [2018-11-28 11:28:05,600 INFO L78 Accepts]: Start accepts. Automaton has 7350 states and 9573 transitions. Word has length 330 [2018-11-28 11:28:05,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:05,600 INFO L480 AbstractCegarLoop]: Abstraction has 7350 states and 9573 transitions. [2018-11-28 11:28:05,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:28:05,601 INFO L276 IsEmpty]: Start isEmpty. Operand 7350 states and 9573 transitions. [2018-11-28 11:28:05,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-11-28 11:28:05,606 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:05,606 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 11:28:05,606 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:05,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:05,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1238161908, now seen corresponding path program 1 times [2018-11-28 11:28:05,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:05,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:05,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:05,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:05,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:05,697 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 11:28:05,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:28:05,697 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c900393f-b9b4-434f-80b8-d63e9b52172e/bin-2019/uautomizer/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 11:28:05,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:05,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:05,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:28:05,951 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 11:28:05,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:28:05,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2018-11-28 11:28:05,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:28:05,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:28:05,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:28:05,968 INFO L87 Difference]: Start difference. First operand 7350 states and 9573 transitions. Second operand 7 states. [2018-11-28 11:28:06,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:06,472 INFO L93 Difference]: Finished difference Result 18408 states and 23982 transitions. [2018-11-28 11:28:06,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 11:28:06,473 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 353 [2018-11-28 11:28:06,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:06,489 INFO L225 Difference]: With dead ends: 18408 [2018-11-28 11:28:06,489 INFO L226 Difference]: Without dead ends: 11034 [2018-11-28 11:28:06,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:28:06,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11034 states. [2018-11-28 11:28:06,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11034 to 8460. [2018-11-28 11:28:06,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8460 states. [2018-11-28 11:28:06,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8460 states to 8460 states and 11077 transitions. [2018-11-28 11:28:06,687 INFO L78 Accepts]: Start accepts. Automaton has 8460 states and 11077 transitions. Word has length 353 [2018-11-28 11:28:06,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:06,688 INFO L480 AbstractCegarLoop]: Abstraction has 8460 states and 11077 transitions. [2018-11-28 11:28:06,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:28:06,688 INFO L276 IsEmpty]: Start isEmpty. Operand 8460 states and 11077 transitions. [2018-11-28 11:28:06,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-11-28 11:28:06,698 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:06,698 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 11:28:06,698 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:06,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:06,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1345653892, now seen corresponding path program 1 times [2018-11-28 11:28:06,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:06,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:06,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:06,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:06,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:06,812 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 11:28:06,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:28:06,812 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c900393f-b9b4-434f-80b8-d63e9b52172e/bin-2019/uautomizer/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 11:28:06,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:06,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:28:07,001 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 11:28:07,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:28:07,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-28 11:28:07,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:28:07,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:28:07,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:28:07,031 INFO L87 Difference]: Start difference. First operand 8460 states and 11077 transitions. Second operand 4 states. [2018-11-28 11:28:07,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:07,436 INFO L93 Difference]: Finished difference Result 19118 states and 24882 transitions. [2018-11-28 11:28:07,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:28:07,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 379 [2018-11-28 11:28:07,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:07,453 INFO L225 Difference]: With dead ends: 19118 [2018-11-28 11:28:07,454 INFO L226 Difference]: Without dead ends: 10668 [2018-11-28 11:28:07,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:28:07,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10668 states. [2018-11-28 11:28:07,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10668 to 8518. [2018-11-28 11:28:07,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8518 states. [2018-11-28 11:28:07,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8518 states to 8518 states and 10888 transitions. [2018-11-28 11:28:07,623 INFO L78 Accepts]: Start accepts. Automaton has 8518 states and 10888 transitions. Word has length 379 [2018-11-28 11:28:07,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:07,623 INFO L480 AbstractCegarLoop]: Abstraction has 8518 states and 10888 transitions. [2018-11-28 11:28:07,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:28:07,623 INFO L276 IsEmpty]: Start isEmpty. Operand 8518 states and 10888 transitions. [2018-11-28 11:28:07,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-11-28 11:28:07,634 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:07,634 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 11:28:07,634 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:07,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:07,635 INFO L82 PathProgramCache]: Analyzing trace with hash -391768364, now seen corresponding path program 1 times [2018-11-28 11:28:07,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:07,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:07,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:07,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:07,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:07,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:07,757 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 11:28:07,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:28:07,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:28:07,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:28:07,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:28:07,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:28:07,759 INFO L87 Difference]: Start difference. First operand 8518 states and 10888 transitions. Second operand 3 states. [2018-11-28 11:28:07,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:07,937 INFO L93 Difference]: Finished difference Result 15876 states and 19733 transitions. [2018-11-28 11:28:07,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:28:07,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 418 [2018-11-28 11:28:07,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:07,943 INFO L225 Difference]: With dead ends: 15876 [2018-11-28 11:28:07,944 INFO L226 Difference]: Without dead ends: 3820 [2018-11-28 11:28:07,956 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 11:28:07,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3820 states. [2018-11-28 11:28:08,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3820 to 3610. [2018-11-28 11:28:08,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3610 states. [2018-11-28 11:28:08,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3610 states to 3610 states and 4508 transitions. [2018-11-28 11:28:08,015 INFO L78 Accepts]: Start accepts. Automaton has 3610 states and 4508 transitions. Word has length 418 [2018-11-28 11:28:08,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:08,015 INFO L480 AbstractCegarLoop]: Abstraction has 3610 states and 4508 transitions. [2018-11-28 11:28:08,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:28:08,015 INFO L276 IsEmpty]: Start isEmpty. Operand 3610 states and 4508 transitions. [2018-11-28 11:28:08,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2018-11-28 11:28:08,023 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:08,024 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 11:28:08,024 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:08,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:08,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1077932443, now seen corresponding path program 1 times [2018-11-28 11:28:08,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:08,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:08,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:08,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:08,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:08,252 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 11:28:08,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:28:08,252 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c900393f-b9b4-434f-80b8-d63e9b52172e/bin-2019/uautomizer/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 11:28:08,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:08,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:08,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:28:08,569 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 11:28:08,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:28:08,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-28 11:28:08,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:28:08,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:28:08,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:28:08,595 INFO L87 Difference]: Start difference. First operand 3610 states and 4508 transitions. Second operand 5 states. [2018-11-28 11:28:08,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:08,798 INFO L93 Difference]: Finished difference Result 4555 states and 5673 transitions. [2018-11-28 11:28:08,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:28:08,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 516 [2018-11-28 11:28:08,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:08,800 INFO L225 Difference]: With dead ends: 4555 [2018-11-28 11:28:08,800 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 11:28:08,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 518 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:28:08,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 11:28:08,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 11:28:08,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 11:28:08,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 11:28:08,807 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 516 [2018-11-28 11:28:08,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:08,807 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:28:08,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:28:08,807 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 11:28:08,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 11:28:08,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 11:28:08,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:08,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,191 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 429 DAG size of output: 102 [2018-11-28 11:28:09,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:28:09,936 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2018-11-28 11:28:09,967 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 11:28:09,967 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 11:28:09,967 INFO L448 ceAbstractionStarter]: For program point L432(lines 432 434) no Hoare annotation was computed. [2018-11-28 11:28:09,967 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 335) no Hoare annotation was computed. [2018-11-28 11:28:09,967 INFO L451 ceAbstractionStarter]: At program point L201(lines 200 488) the Hoare annotation is: true [2018-11-28 11:28:09,967 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 498) no Hoare annotation was computed. [2018-11-28 11:28:09,967 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 509) no Hoare annotation was computed. [2018-11-28 11:28:09,967 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 520) no Hoare annotation was computed. [2018-11-28 11:28:09,967 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 11:28:09,967 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 11:28:09,968 INFO L448 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 549) no Hoare annotation was computed. [2018-11-28 11:28:09,968 INFO L448 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2018-11-28 11:28:09,968 INFO L448 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2018-11-28 11:28:09,968 INFO L448 ceAbstractionStarter]: For program point L435(lines 435 439) no Hoare annotation was computed. [2018-11-28 11:28:09,968 INFO L448 ceAbstractionStarter]: For program point L435-2(lines 435 439) no Hoare annotation was computed. [2018-11-28 11:28:09,968 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 340) no Hoare annotation was computed. [2018-11-28 11:28:09,968 INFO L448 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2018-11-28 11:28:09,968 INFO L448 ceAbstractionStarter]: For program point L336-2(lines 336 340) no Hoare annotation was computed. [2018-11-28 11:28:09,968 INFO L448 ceAbstractionStarter]: For program point L270-2(lines 202 485) no Hoare annotation was computed. [2018-11-28 11:28:09,968 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 497) no Hoare annotation was computed. [2018-11-28 11:28:09,968 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 508) no Hoare annotation was computed. [2018-11-28 11:28:09,968 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 519) no Hoare annotation was computed. [2018-11-28 11:28:09,968 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 11:28:09,968 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 307) no Hoare annotation was computed. [2018-11-28 11:28:09,968 INFO L448 ceAbstractionStarter]: For program point L239(lines 239 242) no Hoare annotation was computed. [2018-11-28 11:28:09,968 INFO L448 ceAbstractionStarter]: For program point L305-2(lines 202 485) no Hoare annotation was computed. [2018-11-28 11:28:09,968 INFO L448 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2018-11-28 11:28:09,969 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 374) no Hoare annotation was computed. [2018-11-28 11:28:09,969 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 11:28:09,969 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 496) no Hoare annotation was computed. [2018-11-28 11:28:09,969 INFO L448 ceAbstractionStarter]: For program point L141(lines 141 507) no Hoare annotation was computed. [2018-11-28 11:28:09,969 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 518) no Hoare annotation was computed. [2018-11-28 11:28:09,969 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 11:28:09,969 INFO L448 ceAbstractionStarter]: For program point L473(lines 473 475) no Hoare annotation was computed. [2018-11-28 11:28:09,969 INFO L448 ceAbstractionStarter]: For program point L473-2(lines 473 475) no Hoare annotation was computed. [2018-11-28 11:28:09,969 INFO L451 ceAbstractionStarter]: At program point L540(lines 98 541) the Hoare annotation is: true [2018-11-28 11:28:09,969 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 280) no Hoare annotation was computed. [2018-11-28 11:28:09,969 INFO L448 ceAbstractionStarter]: For program point L276-2(lines 276 280) no Hoare annotation was computed. [2018-11-28 11:28:09,969 INFO L448 ceAbstractionStarter]: For program point L177(lines 177 495) no Hoare annotation was computed. [2018-11-28 11:28:09,970 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 506) no Hoare annotation was computed. [2018-11-28 11:28:09,970 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 517) no Hoare annotation was computed. [2018-11-28 11:28:09,970 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 11:28:09,970 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 214) no Hoare annotation was computed. [2018-11-28 11:28:09,970 INFO L448 ceAbstractionStarter]: For program point L212-2(lines 212 214) no Hoare annotation was computed. [2018-11-28 11:28:09,970 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 494) no Hoare annotation was computed. [2018-11-28 11:28:09,970 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 505) no Hoare annotation was computed. [2018-11-28 11:28:09,970 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 516) no Hoare annotation was computed. [2018-11-28 11:28:09,970 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 480) no Hoare annotation was computed. [2018-11-28 11:28:09,970 INFO L448 ceAbstractionStarter]: For program point L445(lines 445 456) no Hoare annotation was computed. [2018-11-28 11:28:09,970 INFO L448 ceAbstractionStarter]: For program point L412(lines 412 426) no Hoare annotation was computed. [2018-11-28 11:28:09,970 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 412 426) no Hoare annotation was computed. [2018-11-28 11:28:09,970 INFO L448 ceAbstractionStarter]: For program point L445-2(lines 445 456) no Hoare annotation was computed. [2018-11-28 11:28:09,971 INFO L448 ceAbstractionStarter]: For program point L313(lines 313 316) no Hoare annotation was computed. [2018-11-28 11:28:09,971 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 11:28:09,971 INFO L448 ceAbstractionStarter]: For program point L545(lines 545 547) no Hoare annotation was computed. [2018-11-28 11:28:09,971 INFO L448 ceAbstractionStarter]: For program point L545-2(lines 545 547) no Hoare annotation was computed. [2018-11-28 11:28:09,971 INFO L448 ceAbstractionStarter]: For program point L348(lines 348 350) no Hoare annotation was computed. [2018-11-28 11:28:09,971 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 493) no Hoare annotation was computed. [2018-11-28 11:28:09,971 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 504) no Hoare annotation was computed. [2018-11-28 11:28:09,971 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 515) no Hoare annotation was computed. [2018-11-28 11:28:09,971 INFO L451 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 552) the Hoare annotation is: true [2018-11-28 11:28:09,971 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2018-11-28 11:28:09,971 INFO L448 ceAbstractionStarter]: For program point L217(lines 217 220) no Hoare annotation was computed. [2018-11-28 11:28:09,972 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 11:28:09,972 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 91) no Hoare annotation was computed. [2018-11-28 11:28:09,972 INFO L448 ceAbstractionStarter]: For program point L416(lines 416 422) no Hoare annotation was computed. [2018-11-28 11:28:09,972 INFO L448 ceAbstractionStarter]: For program point L251(lines 251 257) no Hoare annotation was computed. [2018-11-28 11:28:09,972 INFO L448 ceAbstractionStarter]: For program point L450(lines 450 453) no Hoare annotation was computed. [2018-11-28 11:28:09,972 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 492) no Hoare annotation was computed. [2018-11-28 11:28:09,972 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 503) no Hoare annotation was computed. [2018-11-28 11:28:09,972 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 514) no Hoare annotation was computed. [2018-11-28 11:28:09,972 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 11:28:09,972 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 11:28:09,972 INFO L448 ceAbstractionStarter]: For program point L88(lines 88 90) no Hoare annotation was computed. [2018-11-28 11:28:09,972 INFO L448 ceAbstractionStarter]: For program point L88-2(lines 85 91) no Hoare annotation was computed. [2018-11-28 11:28:09,972 INFO L448 ceAbstractionStarter]: For program point $Ultimate##85(lines 202 487) no Hoare annotation was computed. [2018-11-28 11:28:09,972 INFO L448 ceAbstractionStarter]: For program point $Ultimate##84(lines 202 487) no Hoare annotation was computed. [2018-11-28 11:28:09,972 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 297) no Hoare annotation was computed. [2018-11-28 11:28:09,972 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 256) no Hoare annotation was computed. [2018-11-28 11:28:09,972 INFO L448 ceAbstractionStarter]: For program point L287-2(lines 287 297) no Hoare annotation was computed. [2018-11-28 11:28:09,972 INFO L448 ceAbstractionStarter]: For program point L254-2(lines 202 485) no Hoare annotation was computed. [2018-11-28 11:28:09,972 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 11:28:09,973 INFO L448 ceAbstractionStarter]: For program point L321(lines 321 323) no Hoare annotation was computed. [2018-11-28 11:28:09,973 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 491) no Hoare annotation was computed. [2018-11-28 11:28:09,973 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 502) no Hoare annotation was computed. [2018-11-28 11:28:09,973 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 513) no Hoare annotation was computed. [2018-11-28 11:28:09,973 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 392) no Hoare annotation was computed. [2018-11-28 11:28:09,973 INFO L444 ceAbstractionStarter]: At program point L322(lines 76 551) the Hoare annotation is: (< |ssl3_connect_#in~initial_state| 12292) [2018-11-28 11:28:09,973 INFO L448 ceAbstractionStarter]: For program point L388-2(lines 202 485) no Hoare annotation was computed. [2018-11-28 11:28:09,973 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 234) no Hoare annotation was computed. [2018-11-28 11:28:09,973 INFO L448 ceAbstractionStarter]: For program point L223-2(lines 202 485) no Hoare annotation was computed. [2018-11-28 11:28:09,973 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 537) no Hoare annotation was computed. [2018-11-28 11:28:09,973 INFO L448 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 552) no Hoare annotation was computed. [2018-11-28 11:28:09,973 INFO L448 ceAbstractionStarter]: For program point L522(lines 522 536) no Hoare annotation was computed. [2018-11-28 11:28:09,973 INFO L448 ceAbstractionStarter]: For program point L357(lines 357 359) no Hoare annotation was computed. [2018-11-28 11:28:09,974 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2018-11-28 11:28:09,974 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 293) no Hoare annotation was computed. [2018-11-28 11:28:09,974 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 228) no Hoare annotation was computed. [2018-11-28 11:28:09,974 INFO L448 ceAbstractionStarter]: For program point L291-2(lines 289 297) no Hoare annotation was computed. [2018-11-28 11:28:09,974 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 490) no Hoare annotation was computed. [2018-11-28 11:28:09,974 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 501) no Hoare annotation was computed. [2018-11-28 11:28:09,974 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 512) no Hoare annotation was computed. [2018-11-28 11:28:09,974 INFO L448 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2018-11-28 11:28:09,974 INFO L448 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 552) no Hoare annotation was computed. [2018-11-28 11:28:09,974 INFO L448 ceAbstractionStarter]: For program point L523(lines 523 528) no Hoare annotation was computed. [2018-11-28 11:28:09,974 INFO L448 ceAbstractionStarter]: For program point L523-2(lines 522 536) no Hoare annotation was computed. [2018-11-28 11:28:09,974 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 11:28:09,975 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 11:28:09,975 INFO L448 ceAbstractionStarter]: For program point L94(lines 94 96) no Hoare annotation was computed. [2018-11-28 11:28:09,975 INFO L448 ceAbstractionStarter]: For program point L525(lines 525 527) no Hoare annotation was computed. [2018-11-28 11:28:09,975 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 489) no Hoare annotation was computed. [2018-11-28 11:28:09,975 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 500) no Hoare annotation was computed. [2018-11-28 11:28:09,975 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 511) no Hoare annotation was computed. [2018-11-28 11:28:09,975 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 366) no Hoare annotation was computed. [2018-11-28 11:28:09,975 INFO L448 ceAbstractionStarter]: For program point L361-2(lines 361 366) no Hoare annotation was computed. [2018-11-28 11:28:09,975 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 232) no Hoare annotation was computed. [2018-11-28 11:28:09,975 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 11:28:09,975 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 11:28:09,975 INFO L448 ceAbstractionStarter]: For program point L461-1(lines 461 463) no Hoare annotation was computed. [2018-11-28 11:28:09,976 INFO L448 ceAbstractionStarter]: For program point L263(lines 263 265) no Hoare annotation was computed. [2018-11-28 11:28:09,976 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 488) no Hoare annotation was computed. [2018-11-28 11:28:09,976 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 499) no Hoare annotation was computed. [2018-11-28 11:28:09,976 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 510) no Hoare annotation was computed. [2018-11-28 11:28:09,976 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 76 551) no Hoare annotation was computed. [2018-11-28 11:28:09,976 INFO L448 ceAbstractionStarter]: For program point L397(lines 397 400) no Hoare annotation was computed. [2018-11-28 11:28:09,976 INFO L451 ceAbstractionStarter]: At program point L199(lines 198 488) the Hoare annotation is: true [2018-11-28 11:28:09,976 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 11:28:09,976 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-28 11:28:09,976 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 534) no Hoare annotation was computed. [2018-11-28 11:28:09,976 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 11:28:09,976 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 11:28:09,976 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 11:28:09,977 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 11:28:09,977 INFO L444 ceAbstractionStarter]: At program point L559(line 559) the Hoare annotation is: (<= 12292 main_~s~0) [2018-11-28 11:28:09,977 INFO L448 ceAbstractionStarter]: For program point L559-1(line 559) no Hoare annotation was computed. [2018-11-28 11:28:09,977 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 553 563) the Hoare annotation is: true [2018-11-28 11:28:09,977 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 553 563) no Hoare annotation was computed. [2018-11-28 11:28:09,977 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 553 563) no Hoare annotation was computed. [2018-11-28 11:28:10,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:28:10 BoogieIcfgContainer [2018-11-28 11:28:10,013 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 11:28:10,018 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:28:10,018 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:28:10,018 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:28:10,018 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:28:00" (3/4) ... [2018-11-28 11:28:10,024 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 11:28:10,029 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 11:28:10,030 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_connect [2018-11-28 11:28:10,030 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 11:28:10,037 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-11-28 11:28:10,038 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-28 11:28:10,038 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 11:28:10,060 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state) [2018-11-28 11:28:10,060 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || blastFlag <= 0 [2018-11-28 11:28:10,060 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 11:28:10,060 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 11:28:10,061 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 11:28:10,061 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 11:28:10,061 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 11:28:10,061 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 11:28:10,062 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 11:28:10,062 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 [2018-11-28 11:28:10,062 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 11:28:10,062 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 11:28:10,062 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 11:28:10,063 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 11:28:10,063 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 11:28:10,063 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 11:28:10,063 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 11:28:10,112 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c900393f-b9b4-434f-80b8-d63e9b52172e/bin-2019/uautomizer/witness.graphml [2018-11-28 11:28:10,112 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:28:10,113 INFO L168 Benchmark]: Toolchain (without parser) took 10085.71 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 842.0 MB). Free memory was 956.6 MB in the beginning and 1.4 GB in the end (delta: -483.0 MB). Peak memory consumption was 359.0 MB. Max. memory is 11.5 GB. [2018-11-28 11:28:10,113 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:28:10,114 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -152.2 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2018-11-28 11:28:10,114 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.93 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:28:10,114 INFO L168 Benchmark]: Boogie Preprocessor took 32.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:28:10,114 INFO L168 Benchmark]: RCFGBuilder took 504.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. [2018-11-28 11:28:10,114 INFO L168 Benchmark]: TraceAbstraction took 9149.64 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 730.3 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -384.1 MB). Peak memory consumption was 766.2 MB. Max. memory is 11.5 GB. [2018-11-28 11:28:10,114 INFO L168 Benchmark]: Witness Printer took 94.68 ms. Allocated memory is still 1.9 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:28:10,116 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 279.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -152.2 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.93 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 504.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9149.64 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 730.3 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -384.1 MB). Peak memory consumption was 766.2 MB. Max. memory is 11.5 GB. * Witness Printer took 94.68 ms. Allocated memory is still 1.9 GB. Free memory is still 1.4 GB. 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, 9.0s OverallTime, 24 OverallIterations, 20 TraceHistogramMax, 3.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 4971 SDtfs, 1932 SDslu, 3379 SDs, 0 SdLazy, 2650 SolverSat, 478 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1335 GetRequests, 1296 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s 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.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 5532 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 269 NumberOfFragments, 774 HoareAnnotationTreeSize, 26 FomulaSimplifications, 17828 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 26 FomulaSimplificationsInter, 1764 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s 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...