./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/bitvector/s3_clnt_3_true-unreach-call_true-no-overflow.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_dfa56819-0896-46cc-b2c3-ae109b68c335/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_dfa56819-0896-46cc-b2c3-ae109b68c335/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_dfa56819-0896-46cc-b2c3-ae109b68c335/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_dfa56819-0896-46cc-b2c3-ae109b68c335/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/s3_clnt_3_true-unreach-call_true-no-overflow.BV.c.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_dfa56819-0896-46cc-b2c3-ae109b68c335/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_dfa56819-0896-46cc-b2c3-ae109b68c335/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c53759a150934ef20fe7ff264c4326cfaaab3702 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 00:55:28,971 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 00:55:28,973 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 00:55:28,984 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 00:55:28,985 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 00:55:28,986 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 00:55:28,987 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 00:55:28,989 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 00:55:28,991 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 00:55:28,992 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 00:55:28,993 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 00:55:28,993 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 00:55:28,995 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 00:55:28,995 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 00:55:28,996 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 00:55:28,998 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 00:55:28,999 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 00:55:29,000 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 00:55:29,002 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 00:55:29,004 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 00:55:29,005 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 00:55:29,007 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 00:55:29,009 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 00:55:29,009 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 00:55:29,010 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 00:55:29,011 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 00:55:29,014 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 00:55:29,015 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 00:55:29,016 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 00:55:29,017 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 00:55:29,017 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 00:55:29,021 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 00:55:29,021 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 00:55:29,021 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 00:55:29,022 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 00:55:29,023 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 00:55:29,023 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_dfa56819-0896-46cc-b2c3-ae109b68c335/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-27 00:55:29,046 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 00:55:29,047 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 00:55:29,048 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 00:55:29,049 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 00:55:29,049 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 00:55:29,049 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 00:55:29,049 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 00:55:29,051 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 00:55:29,051 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 00:55:29,051 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 00:55:29,051 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 00:55:29,052 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 00:55:29,054 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 00:55:29,054 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 00:55:29,054 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 00:55:29,055 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 00:55:29,055 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 00:55:29,055 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 00:55:29,055 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 00:55:29,055 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 00:55:29,056 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 00:55:29,056 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 00:55:29,056 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 00:55:29,056 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 00:55:29,056 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 00:55:29,056 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 00:55:29,057 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 00:55:29,057 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 00:55:29,057 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 00:55:29,060 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 00:55:29,061 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 00:55:29,061 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 00:55:29,061 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 00:55:29,061 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 00:55:29,062 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_dfa56819-0896-46cc-b2c3-ae109b68c335/bin-2019/utaipan 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 -> Taipan 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 -> c53759a150934ef20fe7ff264c4326cfaaab3702 [2018-10-27 00:55:29,114 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 00:55:29,131 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 00:55:29,136 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 00:55:29,137 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 00:55:29,138 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 00:55:29,138 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_dfa56819-0896-46cc-b2c3-ae109b68c335/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/s3_clnt_3_true-unreach-call_true-no-overflow.BV.c.cil.c [2018-10-27 00:55:29,195 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dfa56819-0896-46cc-b2c3-ae109b68c335/bin-2019/utaipan/data/7c5526fa3/6da09ba72c5b499f97fc836839f407b7/FLAG6aef5c118 [2018-10-27 00:55:29,610 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 00:55:29,611 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_dfa56819-0896-46cc-b2c3-ae109b68c335/sv-benchmarks/c/bitvector/s3_clnt_3_true-unreach-call_true-no-overflow.BV.c.cil.c [2018-10-27 00:55:29,632 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dfa56819-0896-46cc-b2c3-ae109b68c335/bin-2019/utaipan/data/7c5526fa3/6da09ba72c5b499f97fc836839f407b7/FLAG6aef5c118 [2018-10-27 00:55:29,649 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_dfa56819-0896-46cc-b2c3-ae109b68c335/bin-2019/utaipan/data/7c5526fa3/6da09ba72c5b499f97fc836839f407b7 [2018-10-27 00:55:29,653 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 00:55:29,655 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 00:55:29,656 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 00:55:29,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 00:55:29,663 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 00:55:29,664 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:55:29" (1/1) ... [2018-10-27 00:55:29,668 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ed72f28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:29, skipping insertion in model container [2018-10-27 00:55:29,669 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:55:29" (1/1) ... [2018-10-27 00:55:29,679 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 00:55:29,724 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 00:55:29,940 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:55:29,943 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 00:55:30,010 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:55:30,023 INFO L193 MainTranslator]: Completed translation [2018-10-27 00:55:30,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:30 WrapperNode [2018-10-27 00:55:30,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 00:55:30,029 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 00:55:30,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 00:55:30,030 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 00:55:30,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:30" (1/1) ... [2018-10-27 00:55:30,053 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:30" (1/1) ... [2018-10-27 00:55:30,059 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 00:55:30,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 00:55:30,060 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 00:55:30,060 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 00:55:30,068 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:30" (1/1) ... [2018-10-27 00:55:30,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:30" (1/1) ... [2018-10-27 00:55:30,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:30" (1/1) ... [2018-10-27 00:55:30,071 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:30" (1/1) ... [2018-10-27 00:55:30,080 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:30" (1/1) ... [2018-10-27 00:55:30,091 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:30" (1/1) ... [2018-10-27 00:55:30,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:30" (1/1) ... [2018-10-27 00:55:30,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 00:55:30,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 00:55:30,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 00:55:30,098 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 00:55:30,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dfa56819-0896-46cc-b2c3-ae109b68c335/bin-2019/utaipan/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-10-27 00:55:30,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 00:55:30,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 00:55:30,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 00:55:30,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 00:55:30,226 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-10-27 00:55:30,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-10-27 00:55:30,226 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 00:55:30,227 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 00:55:30,423 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-10-27 00:55:30,424 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-10-27 00:55:31,272 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 00:55:31,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:55:31 BoogieIcfgContainer [2018-10-27 00:55:31,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 00:55:31,273 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 00:55:31,273 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 00:55:31,276 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 00:55:31,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:55:29" (1/3) ... [2018-10-27 00:55:31,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546ee5e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:55:31, skipping insertion in model container [2018-10-27 00:55:31,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:30" (2/3) ... [2018-10-27 00:55:31,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546ee5e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:55:31, skipping insertion in model container [2018-10-27 00:55:31,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:55:31" (3/3) ... [2018-10-27 00:55:31,280 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3_true-unreach-call_true-no-overflow.BV.c.cil.c [2018-10-27 00:55:31,290 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 00:55:31,305 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 00:55:31,322 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 00:55:31,363 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 00:55:31,364 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 00:55:31,364 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 00:55:31,364 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 00:55:31,364 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 00:55:31,364 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 00:55:31,364 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 00:55:31,365 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 00:55:31,385 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states. [2018-10-27 00:55:31,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-27 00:55:31,393 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:55:31,394 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:55:31,396 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:55:31,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:55:31,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1793961723, now seen corresponding path program 1 times [2018-10-27 00:55:31,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:55:31,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:31,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:55:31,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:31,454 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:55:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:55:31,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:55:31,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:55:31,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:55:31,642 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:55:31,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:55:31,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:55:31,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:55:31,662 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 3 states. [2018-10-27 00:55:32,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:55:32,029 INFO L93 Difference]: Finished difference Result 261 states and 437 transitions. [2018-10-27 00:55:32,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:55:32,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-27 00:55:32,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:55:32,042 INFO L225 Difference]: With dead ends: 261 [2018-10-27 00:55:32,043 INFO L226 Difference]: Without dead ends: 120 [2018-10-27 00:55:32,045 INFO L605 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-10-27 00:55:32,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-27 00:55:32,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-10-27 00:55:32,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-10-27 00:55:32,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 178 transitions. [2018-10-27 00:55:32,091 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 178 transitions. Word has length 31 [2018-10-27 00:55:32,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:55:32,092 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 178 transitions. [2018-10-27 00:55:32,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:55:32,092 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 178 transitions. [2018-10-27 00:55:32,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-27 00:55:32,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:55:32,093 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-27 00:55:32,094 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:55:32,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:55:32,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1894219512, now seen corresponding path program 1 times [2018-10-27 00:55:32,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:55:32,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:32,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:55:32,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:32,096 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:55:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:55:32,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:55:32,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:55:32,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:55:32,188 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:55:32,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:55:32,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:55:32,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:55:32,190 INFO L87 Difference]: Start difference. First operand 120 states and 178 transitions. Second operand 3 states. [2018-10-27 00:55:32,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:55:32,957 INFO L93 Difference]: Finished difference Result 242 states and 365 transitions. [2018-10-27 00:55:32,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:55:32,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-10-27 00:55:32,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:55:32,959 INFO L225 Difference]: With dead ends: 242 [2018-10-27 00:55:32,959 INFO L226 Difference]: Without dead ends: 139 [2018-10-27 00:55:32,961 INFO L605 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-10-27 00:55:32,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-27 00:55:32,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2018-10-27 00:55:32,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-27 00:55:32,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 199 transitions. [2018-10-27 00:55:32,971 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 199 transitions. Word has length 44 [2018-10-27 00:55:32,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:55:32,972 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 199 transitions. [2018-10-27 00:55:32,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:55:32,972 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 199 transitions. [2018-10-27 00:55:32,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-27 00:55:32,973 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:55:32,973 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:55:32,973 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:55:32,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:55:32,974 INFO L82 PathProgramCache]: Analyzing trace with hash 779443730, now seen corresponding path program 1 times [2018-10-27 00:55:32,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:55:32,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:32,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:55:32,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:32,975 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:55:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:55:33,065 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 00:55:33,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:55:33,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:55:33,066 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:55:33,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:55:33,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:55:33,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:55:33,067 INFO L87 Difference]: Start difference. First operand 136 states and 199 transitions. Second operand 3 states. [2018-10-27 00:55:33,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:55:33,247 INFO L93 Difference]: Finished difference Result 277 states and 413 transitions. [2018-10-27 00:55:33,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:55:33,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-10-27 00:55:33,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:55:33,251 INFO L225 Difference]: With dead ends: 277 [2018-10-27 00:55:33,251 INFO L226 Difference]: Without dead ends: 158 [2018-10-27 00:55:33,252 INFO L605 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-10-27 00:55:33,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-27 00:55:33,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 154. [2018-10-27 00:55:33,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-10-27 00:55:33,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 222 transitions. [2018-10-27 00:55:33,274 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 222 transitions. Word has length 59 [2018-10-27 00:55:33,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:55:33,274 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 222 transitions. [2018-10-27 00:55:33,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:55:33,274 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 222 transitions. [2018-10-27 00:55:33,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-27 00:55:33,276 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:55:33,276 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:55:33,276 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:55:33,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:55:33,276 INFO L82 PathProgramCache]: Analyzing trace with hash 2088419485, now seen corresponding path program 1 times [2018-10-27 00:55:33,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:55:33,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:33,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:55:33,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:33,279 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:55:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:55:33,445 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-27 00:55:33,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:55:33,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:55:33,446 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:55:33,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:55:33,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:55:33,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:55:33,447 INFO L87 Difference]: Start difference. First operand 154 states and 222 transitions. Second operand 3 states. [2018-10-27 00:55:33,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:55:33,508 INFO L93 Difference]: Finished difference Result 431 states and 624 transitions. [2018-10-27 00:55:33,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:55:33,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-10-27 00:55:33,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:55:33,512 INFO L225 Difference]: With dead ends: 431 [2018-10-27 00:55:33,512 INFO L226 Difference]: Without dead ends: 294 [2018-10-27 00:55:33,513 INFO L605 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-10-27 00:55:33,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-10-27 00:55:33,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2018-10-27 00:55:33,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-10-27 00:55:33,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 420 transitions. [2018-10-27 00:55:33,532 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 420 transitions. Word has length 77 [2018-10-27 00:55:33,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:55:33,532 INFO L481 AbstractCegarLoop]: Abstraction has 292 states and 420 transitions. [2018-10-27 00:55:33,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:55:33,533 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 420 transitions. [2018-10-27 00:55:33,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-27 00:55:33,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:55:33,535 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:55:33,536 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:55:33,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:55:33,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1954405979, now seen corresponding path program 1 times [2018-10-27 00:55:33,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:55:33,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:33,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:55:33,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:33,537 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:55:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:55:33,669 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-27 00:55:33,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:55:33,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:55:33,670 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:55:33,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:55:33,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:55:33,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:55:33,671 INFO L87 Difference]: Start difference. First operand 292 states and 420 transitions. Second operand 3 states. [2018-10-27 00:55:33,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:55:33,786 INFO L93 Difference]: Finished difference Result 832 states and 1207 transitions. [2018-10-27 00:55:33,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:55:33,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-10-27 00:55:33,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:55:33,790 INFO L225 Difference]: With dead ends: 832 [2018-10-27 00:55:33,790 INFO L226 Difference]: Without dead ends: 561 [2018-10-27 00:55:33,792 INFO L605 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-10-27 00:55:33,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-10-27 00:55:33,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2018-10-27 00:55:33,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2018-10-27 00:55:33,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 807 transitions. [2018-10-27 00:55:33,828 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 807 transitions. Word has length 77 [2018-10-27 00:55:33,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:55:33,829 INFO L481 AbstractCegarLoop]: Abstraction has 561 states and 807 transitions. [2018-10-27 00:55:33,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:55:33,829 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 807 transitions. [2018-10-27 00:55:33,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-27 00:55:33,834 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:55:33,835 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:55:33,835 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:55:33,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:55:33,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1539543640, now seen corresponding path program 1 times [2018-10-27 00:55:33,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:55:33,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:33,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:55:33,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:33,837 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:55:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:55:33,969 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-10-27 00:55:33,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:55:33,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:55:33,970 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:55:33,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:55:33,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:55:33,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:55:33,971 INFO L87 Difference]: Start difference. First operand 561 states and 807 transitions. Second operand 3 states. [2018-10-27 00:55:34,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:55:34,321 INFO L93 Difference]: Finished difference Result 1201 states and 1758 transitions. [2018-10-27 00:55:34,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:55:34,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2018-10-27 00:55:34,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:55:34,329 INFO L225 Difference]: With dead ends: 1201 [2018-10-27 00:55:34,330 INFO L226 Difference]: Without dead ends: 661 [2018-10-27 00:55:34,331 INFO L605 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-10-27 00:55:34,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2018-10-27 00:55:34,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 649. [2018-10-27 00:55:34,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2018-10-27 00:55:34,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 915 transitions. [2018-10-27 00:55:34,357 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 915 transitions. Word has length 96 [2018-10-27 00:55:34,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:55:34,358 INFO L481 AbstractCegarLoop]: Abstraction has 649 states and 915 transitions. [2018-10-27 00:55:34,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:55:34,358 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 915 transitions. [2018-10-27 00:55:34,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-27 00:55:34,361 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:55:34,361 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:55:34,362 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:55:34,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:55:34,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1105441981, now seen corresponding path program 1 times [2018-10-27 00:55:34,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:55:34,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:34,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:55:34,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:34,364 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:55:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:55:34,506 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-10-27 00:55:34,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:55:34,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:55:34,507 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:55:34,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:55:34,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:55:34,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:55:34,509 INFO L87 Difference]: Start difference. First operand 649 states and 915 transitions. Second operand 3 states. [2018-10-27 00:55:34,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:55:34,791 INFO L93 Difference]: Finished difference Result 964 states and 1363 transitions. [2018-10-27 00:55:34,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:55:34,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2018-10-27 00:55:34,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:55:34,795 INFO L225 Difference]: With dead ends: 964 [2018-10-27 00:55:34,795 INFO L226 Difference]: Without dead ends: 962 [2018-10-27 00:55:34,796 INFO L605 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-10-27 00:55:34,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2018-10-27 00:55:34,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2018-10-27 00:55:34,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2018-10-27 00:55:34,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1360 transitions. [2018-10-27 00:55:34,820 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1360 transitions. Word has length 117 [2018-10-27 00:55:34,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:55:34,820 INFO L481 AbstractCegarLoop]: Abstraction has 962 states and 1360 transitions. [2018-10-27 00:55:34,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:55:34,821 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1360 transitions. [2018-10-27 00:55:34,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-27 00:55:34,824 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:55:34,824 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:55:34,824 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:55:34,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:55:34,825 INFO L82 PathProgramCache]: Analyzing trace with hash -642399451, now seen corresponding path program 1 times [2018-10-27 00:55:34,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:55:34,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:34,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:55:34,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:34,827 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:55:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:55:34,929 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-10-27 00:55:34,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:55:34,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:55:34,930 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:55:34,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:55:34,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:55:34,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:55:34,931 INFO L87 Difference]: Start difference. First operand 962 states and 1360 transitions. Second operand 3 states. [2018-10-27 00:55:36,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:55:36,362 INFO L93 Difference]: Finished difference Result 2203 states and 3222 transitions. [2018-10-27 00:55:36,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:55:36,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2018-10-27 00:55:36,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:55:36,371 INFO L225 Difference]: With dead ends: 2203 [2018-10-27 00:55:36,371 INFO L226 Difference]: Without dead ends: 1256 [2018-10-27 00:55:36,374 INFO L605 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-10-27 00:55:36,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2018-10-27 00:55:36,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1208. [2018-10-27 00:55:36,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1208 states. [2018-10-27 00:55:36,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1756 transitions. [2018-10-27 00:55:36,408 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1756 transitions. Word has length 136 [2018-10-27 00:55:36,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:55:36,409 INFO L481 AbstractCegarLoop]: Abstraction has 1208 states and 1756 transitions. [2018-10-27 00:55:36,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:55:36,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1756 transitions. [2018-10-27 00:55:36,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-27 00:55:36,414 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:55:36,414 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 00:55:36,414 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:55:36,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:55:36,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1110967660, now seen corresponding path program 1 times [2018-10-27 00:55:36,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:55:36,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:36,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:55:36,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:36,417 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:55:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:55:36,527 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-10-27 00:55:36,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:55:36,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:55:36,528 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:55:36,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:55:36,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:55:36,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:55:36,529 INFO L87 Difference]: Start difference. First operand 1208 states and 1756 transitions. Second operand 3 states. [2018-10-27 00:55:37,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:55:37,494 INFO L93 Difference]: Finished difference Result 2961 states and 4431 transitions. [2018-10-27 00:55:37,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:55:37,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2018-10-27 00:55:37,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:55:37,501 INFO L225 Difference]: With dead ends: 2961 [2018-10-27 00:55:37,505 INFO L226 Difference]: Without dead ends: 1672 [2018-10-27 00:55:37,508 INFO L605 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-10-27 00:55:37,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2018-10-27 00:55:37,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1598. [2018-10-27 00:55:37,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1598 states. [2018-10-27 00:55:37,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2272 transitions. [2018-10-27 00:55:37,554 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2272 transitions. Word has length 164 [2018-10-27 00:55:37,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:55:37,555 INFO L481 AbstractCegarLoop]: Abstraction has 1598 states and 2272 transitions. [2018-10-27 00:55:37,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:55:37,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2272 transitions. [2018-10-27 00:55:37,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-27 00:55:37,562 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:55:37,562 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 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-10-27 00:55:37,562 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:55:37,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:55:37,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1540071454, now seen corresponding path program 1 times [2018-10-27 00:55:37,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:55:37,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:37,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:55:37,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:37,565 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:55:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:55:37,704 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-10-27 00:55:37,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:55:37,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:55:37,704 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:55:37,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:55:37,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:55:37,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:55:37,705 INFO L87 Difference]: Start difference. First operand 1598 states and 2272 transitions. Second operand 3 states. [2018-10-27 00:55:37,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:55:37,934 INFO L93 Difference]: Finished difference Result 3493 states and 5004 transitions. [2018-10-27 00:55:37,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:55:37,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2018-10-27 00:55:37,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:55:37,945 INFO L225 Difference]: With dead ends: 3493 [2018-10-27 00:55:37,945 INFO L226 Difference]: Without dead ends: 1826 [2018-10-27 00:55:37,949 INFO L605 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-10-27 00:55:37,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2018-10-27 00:55:37,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1754. [2018-10-27 00:55:37,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1754 states. [2018-10-27 00:55:37,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 2470 transitions. [2018-10-27 00:55:37,994 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 2470 transitions. Word has length 186 [2018-10-27 00:55:37,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:55:37,995 INFO L481 AbstractCegarLoop]: Abstraction has 1754 states and 2470 transitions. [2018-10-27 00:55:37,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:55:37,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 2470 transitions. [2018-10-27 00:55:38,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-27 00:55:38,001 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:55:38,001 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 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] [2018-10-27 00:55:38,001 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:55:38,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:55:38,002 INFO L82 PathProgramCache]: Analyzing trace with hash -148829878, now seen corresponding path program 1 times [2018-10-27 00:55:38,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:55:38,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:38,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:55:38,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:38,003 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:55:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:55:38,123 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-10-27 00:55:38,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:55:38,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:55:38,123 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:55:38,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:55:38,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:55:38,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:55:38,124 INFO L87 Difference]: Start difference. First operand 1754 states and 2470 transitions. Second operand 3 states. [2018-10-27 00:55:39,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:55:39,369 INFO L93 Difference]: Finished difference Result 3805 states and 5394 transitions. [2018-10-27 00:55:39,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:55:39,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-10-27 00:55:39,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:55:39,377 INFO L225 Difference]: With dead ends: 3805 [2018-10-27 00:55:39,378 INFO L226 Difference]: Without dead ends: 1994 [2018-10-27 00:55:39,382 INFO L605 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-10-27 00:55:39,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2018-10-27 00:55:39,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1928. [2018-10-27 00:55:39,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-10-27 00:55:39,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2698 transitions. [2018-10-27 00:55:39,432 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2698 transitions. Word has length 211 [2018-10-27 00:55:39,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:55:39,432 INFO L481 AbstractCegarLoop]: Abstraction has 1928 states and 2698 transitions. [2018-10-27 00:55:39,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:55:39,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2698 transitions. [2018-10-27 00:55:39,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-27 00:55:39,438 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:55:39,439 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 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] [2018-10-27 00:55:39,439 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:55:39,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:55:39,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1116180532, now seen corresponding path program 1 times [2018-10-27 00:55:39,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:55:39,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:39,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:55:39,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:39,444 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:55:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:55:39,535 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-10-27 00:55:39,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:55:39,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:55:39,535 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:55:39,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:55:39,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:55:39,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:55:39,536 INFO L87 Difference]: Start difference. First operand 1928 states and 2698 transitions. Second operand 3 states. [2018-10-27 00:55:39,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:55:39,795 INFO L93 Difference]: Finished difference Result 4153 states and 5856 transitions. [2018-10-27 00:55:39,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:55:39,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-10-27 00:55:39,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:55:39,802 INFO L225 Difference]: With dead ends: 4153 [2018-10-27 00:55:39,802 INFO L226 Difference]: Without dead ends: 2192 [2018-10-27 00:55:39,806 INFO L605 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-10-27 00:55:39,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2018-10-27 00:55:39,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 2120. [2018-10-27 00:55:39,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2120 states. [2018-10-27 00:55:39,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 2968 transitions. [2018-10-27 00:55:39,859 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 2968 transitions. Word has length 211 [2018-10-27 00:55:39,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:55:39,859 INFO L481 AbstractCegarLoop]: Abstraction has 2120 states and 2968 transitions. [2018-10-27 00:55:39,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:55:39,860 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 2968 transitions. [2018-10-27 00:55:39,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-27 00:55:39,867 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:55:39,867 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 4, 4, 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-10-27 00:55:39,868 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:55:39,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:55:39,868 INFO L82 PathProgramCache]: Analyzing trace with hash 971581549, now seen corresponding path program 1 times [2018-10-27 00:55:39,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:55:39,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:39,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:55:39,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:39,872 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:55:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:55:40,033 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2018-10-27 00:55:40,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:55:40,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:55:40,034 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:55:40,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:55:40,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:55:40,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:55:40,035 INFO L87 Difference]: Start difference. First operand 2120 states and 2968 transitions. Second operand 3 states. [2018-10-27 00:55:40,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:55:40,177 INFO L93 Difference]: Finished difference Result 6312 states and 8846 transitions. [2018-10-27 00:55:40,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:55:40,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 242 [2018-10-27 00:55:40,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:55:40,191 INFO L225 Difference]: With dead ends: 6312 [2018-10-27 00:55:40,191 INFO L226 Difference]: Without dead ends: 4213 [2018-10-27 00:55:40,195 INFO L605 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-10-27 00:55:40,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4213 states. [2018-10-27 00:55:40,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4213 to 4211. [2018-10-27 00:55:40,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4211 states. [2018-10-27 00:55:40,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4211 states to 4211 states and 5897 transitions. [2018-10-27 00:55:40,289 INFO L78 Accepts]: Start accepts. Automaton has 4211 states and 5897 transitions. Word has length 242 [2018-10-27 00:55:40,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:55:40,290 INFO L481 AbstractCegarLoop]: Abstraction has 4211 states and 5897 transitions. [2018-10-27 00:55:40,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:55:40,290 INFO L276 IsEmpty]: Start isEmpty. Operand 4211 states and 5897 transitions. [2018-10-27 00:55:40,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-27 00:55:40,299 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:55:40,299 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 4, 4, 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-10-27 00:55:40,299 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:55:40,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:55:40,300 INFO L82 PathProgramCache]: Analyzing trace with hash 4230895, now seen corresponding path program 1 times [2018-10-27 00:55:40,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:55:40,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:40,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:55:40,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:40,302 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:55:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:55:40,384 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 373 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-10-27 00:55:40,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:55:40,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:55:40,385 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:55:40,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:55:40,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:55:40,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:55:40,386 INFO L87 Difference]: Start difference. First operand 4211 states and 5897 transitions. Second operand 3 states. [2018-10-27 00:55:40,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:55:40,828 INFO L93 Difference]: Finished difference Result 9025 states and 12716 transitions. [2018-10-27 00:55:40,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:55:40,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 242 [2018-10-27 00:55:40,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:55:40,843 INFO L225 Difference]: With dead ends: 9025 [2018-10-27 00:55:40,843 INFO L226 Difference]: Without dead ends: 4775 [2018-10-27 00:55:40,850 INFO L605 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-10-27 00:55:40,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4775 states. [2018-10-27 00:55:40,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4775 to 4643. [2018-10-27 00:55:40,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4643 states. [2018-10-27 00:55:40,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4643 states to 4643 states and 6533 transitions. [2018-10-27 00:55:40,944 INFO L78 Accepts]: Start accepts. Automaton has 4643 states and 6533 transitions. Word has length 242 [2018-10-27 00:55:40,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:55:40,944 INFO L481 AbstractCegarLoop]: Abstraction has 4643 states and 6533 transitions. [2018-10-27 00:55:40,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:55:40,945 INFO L276 IsEmpty]: Start isEmpty. Operand 4643 states and 6533 transitions. [2018-10-27 00:55:40,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-10-27 00:55:40,985 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:55:40,985 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 00:55:40,986 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:55:40,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:55:40,986 INFO L82 PathProgramCache]: Analyzing trace with hash -36215738, now seen corresponding path program 1 times [2018-10-27 00:55:40,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:55:40,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:40,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:55:40,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:40,987 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:55:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:55:41,113 INFO L134 CoverageAnalysis]: Checked inductivity of 913 backedges. 422 proven. 0 refuted. 0 times theorem prover too weak. 491 trivial. 0 not checked. [2018-10-27 00:55:41,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:55:41,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:55:41,114 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:55:41,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:55:41,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:55:41,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:55:41,114 INFO L87 Difference]: Start difference. First operand 4643 states and 6533 transitions. Second operand 3 states. [2018-10-27 00:55:41,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:55:41,642 INFO L93 Difference]: Finished difference Result 9397 states and 13196 transitions. [2018-10-27 00:55:41,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:55:41,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2018-10-27 00:55:41,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:55:41,664 INFO L225 Difference]: With dead ends: 9397 [2018-10-27 00:55:41,664 INFO L226 Difference]: Without dead ends: 4739 [2018-10-27 00:55:41,672 INFO L605 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-10-27 00:55:41,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4739 states. [2018-10-27 00:55:41,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4739 to 4607. [2018-10-27 00:55:41,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4607 states. [2018-10-27 00:55:41,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4607 states to 4607 states and 6425 transitions. [2018-10-27 00:55:41,774 INFO L78 Accepts]: Start accepts. Automaton has 4607 states and 6425 transitions. Word has length 278 [2018-10-27 00:55:41,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:55:41,774 INFO L481 AbstractCegarLoop]: Abstraction has 4607 states and 6425 transitions. [2018-10-27 00:55:41,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:55:41,774 INFO L276 IsEmpty]: Start isEmpty. Operand 4607 states and 6425 transitions. [2018-10-27 00:55:41,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-10-27 00:55:41,783 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:55:41,783 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:55:41,783 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:55:41,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:55:41,784 INFO L82 PathProgramCache]: Analyzing trace with hash 265020415, now seen corresponding path program 1 times [2018-10-27 00:55:41,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:55:41,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:41,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:55:41,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:41,787 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:55:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:55:41,919 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2018-10-27 00:55:41,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:55:41,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:55:41,919 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:55:41,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:55:41,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:55:41,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:55:41,920 INFO L87 Difference]: Start difference. First operand 4607 states and 6425 transitions. Second operand 3 states. [2018-10-27 00:55:43,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:55:43,080 INFO L93 Difference]: Finished difference Result 9301 states and 12956 transitions. [2018-10-27 00:55:43,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:55:43,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 287 [2018-10-27 00:55:43,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:55:43,089 INFO L225 Difference]: With dead ends: 9301 [2018-10-27 00:55:43,090 INFO L226 Difference]: Without dead ends: 4715 [2018-10-27 00:55:43,098 INFO L605 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-10-27 00:55:43,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4715 states. [2018-10-27 00:55:43,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4715 to 4607. [2018-10-27 00:55:43,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4607 states. [2018-10-27 00:55:43,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4607 states to 4607 states and 6317 transitions. [2018-10-27 00:55:43,176 INFO L78 Accepts]: Start accepts. Automaton has 4607 states and 6317 transitions. Word has length 287 [2018-10-27 00:55:43,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:55:43,176 INFO L481 AbstractCegarLoop]: Abstraction has 4607 states and 6317 transitions. [2018-10-27 00:55:43,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:55:43,176 INFO L276 IsEmpty]: Start isEmpty. Operand 4607 states and 6317 transitions. [2018-10-27 00:55:43,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-10-27 00:55:43,184 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:55:43,184 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 00:55:43,184 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:55:43,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:55:43,184 INFO L82 PathProgramCache]: Analyzing trace with hash -655131460, now seen corresponding path program 1 times [2018-10-27 00:55:43,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:55:43,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:43,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:55:43,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:43,188 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:55:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:55:43,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2018-10-27 00:55:43,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:55:43,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:55:43,327 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:55:43,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:55:43,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:55:43,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:55:43,328 INFO L87 Difference]: Start difference. First operand 4607 states and 6317 transitions. Second operand 3 states. [2018-10-27 00:55:44,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:55:44,525 INFO L93 Difference]: Finished difference Result 9799 states and 13322 transitions. [2018-10-27 00:55:44,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:55:44,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2018-10-27 00:55:44,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:55:44,542 INFO L225 Difference]: With dead ends: 9799 [2018-10-27 00:55:44,542 INFO L226 Difference]: Without dead ends: 5213 [2018-10-27 00:55:44,548 INFO L605 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-10-27 00:55:44,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5213 states. [2018-10-27 00:55:44,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5213 to 4793. [2018-10-27 00:55:44,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4793 states. [2018-10-27 00:55:44,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4793 states to 4793 states and 6563 transitions. [2018-10-27 00:55:44,635 INFO L78 Accepts]: Start accepts. Automaton has 4793 states and 6563 transitions. Word has length 316 [2018-10-27 00:55:44,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:55:44,635 INFO L481 AbstractCegarLoop]: Abstraction has 4793 states and 6563 transitions. [2018-10-27 00:55:44,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:55:44,636 INFO L276 IsEmpty]: Start isEmpty. Operand 4793 states and 6563 transitions. [2018-10-27 00:55:44,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-10-27 00:55:44,643 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:55:44,644 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 00:55:44,644 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:55:44,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:55:44,644 INFO L82 PathProgramCache]: Analyzing trace with hash 666255515, now seen corresponding path program 1 times [2018-10-27 00:55:44,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:55:44,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:44,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:55:44,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:44,648 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:55:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:55:44,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2018-10-27 00:55:44,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:55:44,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:55:44,830 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:55:44,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:55:44,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:55:44,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:55:44,831 INFO L87 Difference]: Start difference. First operand 4793 states and 6563 transitions. Second operand 3 states. [2018-10-27 00:55:45,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:55:45,162 INFO L93 Difference]: Finished difference Result 9889 states and 13424 transitions. [2018-10-27 00:55:45,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:55:45,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 317 [2018-10-27 00:55:45,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:55:45,176 INFO L225 Difference]: With dead ends: 9889 [2018-10-27 00:55:45,176 INFO L226 Difference]: Without dead ends: 4583 [2018-10-27 00:55:45,184 INFO L605 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-10-27 00:55:45,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4583 states. [2018-10-27 00:55:45,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4583 to 4571. [2018-10-27 00:55:45,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4571 states. [2018-10-27 00:55:45,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4571 states to 4571 states and 6233 transitions. [2018-10-27 00:55:45,271 INFO L78 Accepts]: Start accepts. Automaton has 4571 states and 6233 transitions. Word has length 317 [2018-10-27 00:55:45,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:55:45,271 INFO L481 AbstractCegarLoop]: Abstraction has 4571 states and 6233 transitions. [2018-10-27 00:55:45,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:55:45,271 INFO L276 IsEmpty]: Start isEmpty. Operand 4571 states and 6233 transitions. [2018-10-27 00:55:45,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-10-27 00:55:45,279 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:55:45,280 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 00:55:45,280 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:55:45,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:55:45,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1495728710, now seen corresponding path program 1 times [2018-10-27 00:55:45,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:55:45,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:45,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:55:45,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:45,281 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:55:45,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:55:45,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 504 proven. 13 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2018-10-27 00:55:45,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:55:45,511 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 00:55:45,513 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 327 with the following transitions: [2018-10-27 00:55:45,516 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [16], [27], [33], [37], [43], [45], [48], [50], [55], [60], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [123], [125], [130], [135], [140], [145], [150], [153], [155], [160], [165], [170], [173], [175], [180], [183], [185], [190], [195], [200], [203], [213], [215], [218], [226], [241], [247], [252], [254], [257], [265], [268], [273], [276], [278], [281], [289], [294], [296], [302], [305], [313], [315], [317], [320], [328], [333], [335], [338], [340], [345], [347], [352], [357], [359], [368], [373], [378], [380], [389], [394], [397], [405], [410], [412], [417], [428], [430], [455], [457], [523], [525], [538], [543], [547], [548], [549], [551] [2018-10-27 00:55:45,590 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 00:55:45,590 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 00:55:46,652 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 00:57:10,358 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 00:57:10,359 INFO L272 AbstractInterpreter]: Visited 108 different actions 3060 times. Merged at 94 different actions 2605 times. Widened at 22 different actions 389 times. Found 326 fixpoints after 23 different actions. Largest state had 92 variables. [2018-10-27 00:57:10,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:57:10,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 00:57:10,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:57:10,374 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dfa56819-0896-46cc-b2c3-ae109b68c335/bin-2019/utaipan/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-10-27 00:57:10,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:57:10,382 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 00:57:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:57:10,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:57:10,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 504 proven. 13 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2018-10-27 00:57:10,579 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 00:57:10,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 504 proven. 13 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2018-10-27 00:57:10,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 00:57:10,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-10-27 00:57:10,870 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 00:57:10,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 00:57:10,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 00:57:10,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 00:57:10,871 INFO L87 Difference]: Start difference. First operand 4571 states and 6233 transitions. Second operand 4 states. [2018-10-27 00:57:13,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:57:13,184 INFO L93 Difference]: Finished difference Result 9237 states and 12741 transitions. [2018-10-27 00:57:13,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 00:57:13,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 326 [2018-10-27 00:57:13,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:57:13,207 INFO L225 Difference]: With dead ends: 9237 [2018-10-27 00:57:13,207 INFO L226 Difference]: Without dead ends: 6814 [2018-10-27 00:57:13,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 657 GetRequests, 652 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-27 00:57:13,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6814 states. [2018-10-27 00:57:13,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6814 to 5243. [2018-10-27 00:57:13,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5243 states. [2018-10-27 00:57:13,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5243 states to 5243 states and 7251 transitions. [2018-10-27 00:57:13,337 INFO L78 Accepts]: Start accepts. Automaton has 5243 states and 7251 transitions. Word has length 326 [2018-10-27 00:57:13,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:57:13,338 INFO L481 AbstractCegarLoop]: Abstraction has 5243 states and 7251 transitions. [2018-10-27 00:57:13,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 00:57:13,338 INFO L276 IsEmpty]: Start isEmpty. Operand 5243 states and 7251 transitions. [2018-10-27 00:57:13,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-10-27 00:57:13,346 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:57:13,346 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 00:57:13,347 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:57:13,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:57:13,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1306856041, now seen corresponding path program 1 times [2018-10-27 00:57:13,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:57:13,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:57:13,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:57:13,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:57:13,350 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:57:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:57:13,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 504 proven. 13 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2018-10-27 00:57:13,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:57:13,569 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 00:57:13,569 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 328 with the following transitions: [2018-10-27 00:57:13,570 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [16], [27], [31], [37], [43], [45], [48], [50], [55], [60], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [123], [125], [130], [135], [140], [145], [150], [153], [155], [160], [165], [170], [173], [175], [180], [183], [185], [190], [195], [200], [203], [213], [215], [218], [226], [241], [247], [252], [254], [257], [265], [268], [273], [276], [278], [281], [289], [292], [296], [302], [305], [313], [315], [317], [320], [328], [333], [335], [338], [340], [345], [347], [352], [357], [359], [368], [373], [378], [380], [389], [394], [397], [405], [410], [412], [417], [420], [425], [430], [455], [457], [523], [525], [538], [543], [547], [548], [549], [551] [2018-10-27 00:57:13,576 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 00:57:13,576 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 00:57:14,027 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 00:58:39,627 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 00:58:39,627 INFO L272 AbstractInterpreter]: Visited 109 different actions 3090 times. Merged at 95 different actions 2634 times. Widened at 22 different actions 389 times. Found 326 fixpoints after 23 different actions. Largest state had 92 variables. [2018-10-27 00:58:39,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:58:39,637 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 00:58:39,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:58:39,638 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dfa56819-0896-46cc-b2c3-ae109b68c335/bin-2019/utaipan/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-10-27 00:58:39,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:58:39,645 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 00:58:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:58:39,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:58:39,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 504 proven. 13 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2018-10-27 00:58:39,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 00:58:39,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 504 proven. 13 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2018-10-27 00:58:39,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 00:58:39,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-10-27 00:58:39,862 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 00:58:39,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 00:58:39,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 00:58:39,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 00:58:39,863 INFO L87 Difference]: Start difference. First operand 5243 states and 7251 transitions. Second operand 4 states. [2018-10-27 00:58:40,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:58:40,495 INFO L93 Difference]: Finished difference Result 8978 states and 12412 transitions. [2018-10-27 00:58:40,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 00:58:40,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 327 [2018-10-27 00:58:40,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:58:40,503 INFO L225 Difference]: With dead ends: 8978 [2018-10-27 00:58:40,503 INFO L226 Difference]: Without dead ends: 3400 [2018-10-27 00:58:40,509 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 654 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-27 00:58:40,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3400 states. [2018-10-27 00:58:40,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3400 to 2560. [2018-10-27 00:58:40,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2560 states. [2018-10-27 00:58:40,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 3526 transitions. [2018-10-27 00:58:40,570 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 3526 transitions. Word has length 327 [2018-10-27 00:58:40,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:58:40,571 INFO L481 AbstractCegarLoop]: Abstraction has 2560 states and 3526 transitions. [2018-10-27 00:58:40,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 00:58:40,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 3526 transitions. [2018-10-27 00:58:40,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-10-27 00:58:40,576 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:58:40,576 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 00:58:40,576 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:58:40,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:58:40,577 INFO L82 PathProgramCache]: Analyzing trace with hash -232767871, now seen corresponding path program 1 times [2018-10-27 00:58:40,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:58:40,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:58:40,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:58:40,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:58:40,577 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:58:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:58:40,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1360 backedges. 705 proven. 6 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2018-10-27 00:58:40,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:58:40,806 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 00:58:40,806 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 355 with the following transitions: [2018-10-27 00:58:40,807 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [16], [27], [33], [37], [43], [45], [48], [50], [55], [60], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [123], [125], [130], [135], [140], [145], [150], [153], [155], [160], [165], [170], [173], [175], [180], [183], [185], [190], [195], [200], [203], [213], [215], [218], [226], [241], [247], [252], [254], [257], [259], [265], [268], [273], [276], [278], [281], [289], [294], [296], [302], [305], [313], [315], [317], [320], [328], [333], [335], [338], [340], [345], [347], [352], [357], [359], [368], [373], [378], [380], [389], [394], [397], [405], [410], [412], [417], [428], [430], [455], [457], [523], [525], [538], [543], [547], [548], [549], [551] [2018-10-27 00:58:40,810 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 00:58:40,811 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 00:58:41,192 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 01:00:01,151 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 01:00:01,152 INFO L272 AbstractInterpreter]: Visited 109 different actions 3154 times. Merged at 95 different actions 2667 times. Widened at 22 different actions 390 times. Found 356 fixpoints after 23 different actions. Largest state had 92 variables. [2018-10-27 01:00:01,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:00:01,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 01:00:01,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:00:01,162 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dfa56819-0896-46cc-b2c3-ae109b68c335/bin-2019/utaipan/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-10-27 01:00:01,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:00:01,170 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 01:00:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:00:01,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 01:00:01,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1360 backedges. 705 proven. 6 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2018-10-27 01:00:01,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 01:00:01,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1360 backedges. 705 proven. 6 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2018-10-27 01:00:01,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 01:00:01,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-10-27 01:00:01,370 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 01:00:01,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 01:00:01,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 01:00:01,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 01:00:01,371 INFO L87 Difference]: Start difference. First operand 2560 states and 3526 transitions. Second operand 4 states. [2018-10-27 01:00:01,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:00:01,505 INFO L93 Difference]: Finished difference Result 3659 states and 4974 transitions. [2018-10-27 01:00:01,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 01:00:01,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 354 [2018-10-27 01:00:01,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:00:01,507 INFO L225 Difference]: With dead ends: 3659 [2018-10-27 01:00:01,507 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 01:00:01,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 713 GetRequests, 708 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-27 01:00:01,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 01:00:01,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 01:00:01,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 01:00:01,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 01:00:01,512 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 354 [2018-10-27 01:00:01,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:00:01,512 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 01:00:01,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 01:00:01,512 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 01:00:01,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 01:00:01,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 01:00:01,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:01,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:00:02,042 WARN L179 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 9 [2018-10-27 01:00:02,334 WARN L179 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2018-10-27 01:00:03,006 WARN L179 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 3 [2018-10-27 01:00:03,367 WARN L179 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2018-10-27 01:00:03,480 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-27 01:00:03,480 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 01:00:03,480 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 01:00:03,480 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-27 01:00:03,481 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 01:00:03,481 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 01:00:03,481 INFO L425 ceAbstractionStarter]: For program point L432(lines 432 436) no Hoare annotation was computed. [2018-10-27 01:00:03,481 INFO L425 ceAbstractionStarter]: For program point L432-2(lines 202 534) no Hoare annotation was computed. [2018-10-27 01:00:03,481 INFO L428 ceAbstractionStarter]: At program point L201(lines 200 537) the Hoare annotation is: true [2018-10-27 01:00:03,481 INFO L421 ceAbstractionStarter]: At program point L168(lines 164 549) the Hoare annotation is: (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4512) (<= ssl3_connect_~blastFlag~0 4)) [2018-10-27 01:00:03,481 INFO L421 ceAbstractionStarter]: At program point L102(lines 101 570) the Hoare annotation is: (and (<= ssl3_connect_~blastFlag~0 2) (= ssl3_connect_~s__state~0 12292)) [2018-10-27 01:00:03,481 INFO L425 ceAbstractionStarter]: For program point L367(lines 367 371) no Hoare annotation was computed. [2018-10-27 01:00:03,481 INFO L425 ceAbstractionStarter]: For program point L401(lines 401 406) no Hoare annotation was computed. [2018-10-27 01:00:03,481 INFO L425 ceAbstractionStarter]: For program point L401-2(lines 401 406) no Hoare annotation was computed. [2018-10-27 01:00:03,481 INFO L425 ceAbstractionStarter]: For program point L170(lines 170 547) no Hoare annotation was computed. [2018-10-27 01:00:03,481 INFO L425 ceAbstractionStarter]: For program point L137(lines 137 558) no Hoare annotation was computed. [2018-10-27 01:00:03,481 INFO L425 ceAbstractionStarter]: For program point L104(lines 104 569) no Hoare annotation was computed. [2018-10-27 01:00:03,482 INFO L421 ceAbstractionStarter]: At program point L138(lines 134 559) the Hoare annotation is: (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (<= ssl3_connect_~s__state~0 4432)) [2018-10-27 01:00:03,482 INFO L421 ceAbstractionStarter]: At program point L535(lines 98 601) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~0)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse5 (= ssl3_connect_~s__hit~0 0)) (.cse3 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0))) (or (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1 .cse2) (<= ssl3_connect_~s__state~0 3) (and (= ssl3_connect_~s__state~0 4416) .cse2) (and (<= 4432 ssl3_connect_~s__state~0) .cse2 (<= ssl3_connect_~s__state~0 4528)) (and .cse2 .cse3 .cse4 .cse0 .cse1 .cse5) (<= ssl3_connect_~blastFlag~0 2) (and .cse4 (<= 4560 ssl3_connect_~s__state~0) .cse2 .cse5 (<= ssl3_connect_~s__state~0 4560) .cse3))) [2018-10-27 01:00:03,482 INFO L425 ceAbstractionStarter]: For program point L73(lines 73 81) no Hoare annotation was computed. [2018-10-27 01:00:03,482 INFO L425 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 613) no Hoare annotation was computed. [2018-10-27 01:00:03,482 INFO L428 ceAbstractionStarter]: At program point L602(lines 97 603) the Hoare annotation is: true [2018-10-27 01:00:03,482 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 546) no Hoare annotation was computed. [2018-10-27 01:00:03,482 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 557) no Hoare annotation was computed. [2018-10-27 01:00:03,482 INFO L425 ceAbstractionStarter]: For program point L107(lines 107 568) no Hoare annotation was computed. [2018-10-27 01:00:03,482 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 376) no Hoare annotation was computed. [2018-10-27 01:00:03,482 INFO L425 ceAbstractionStarter]: For program point L372-2(lines 372 376) no Hoare annotation was computed. [2018-10-27 01:00:03,483 INFO L421 ceAbstractionStarter]: At program point L207(lines 104 569) the Hoare annotation is: (<= ssl3_connect_~blastFlag~0 2) [2018-10-27 01:00:03,483 INFO L421 ceAbstractionStarter]: At program point L174(lines 170 547) the Hoare annotation is: (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4512) (<= ssl3_connect_~blastFlag~0 4)) [2018-10-27 01:00:03,483 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 599) no Hoare annotation was computed. [2018-10-27 01:00:03,483 INFO L425 ceAbstractionStarter]: For program point L76(lines 76 80) no Hoare annotation was computed. [2018-10-27 01:00:03,483 INFO L425 ceAbstractionStarter]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2018-10-27 01:00:03,483 INFO L425 ceAbstractionStarter]: For program point L572(lines 572 596) no Hoare annotation was computed. [2018-10-27 01:00:03,483 INFO L425 ceAbstractionStarter]: For program point L506-1(lines 202 534) no Hoare annotation was computed. [2018-10-27 01:00:03,483 INFO L425 ceAbstractionStarter]: For program point L341(lines 341 346) no Hoare annotation was computed. [2018-10-27 01:00:03,483 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 279) no Hoare annotation was computed. [2018-10-27 01:00:03,483 INFO L425 ceAbstractionStarter]: For program point L308-1(lines 308 322) no Hoare annotation was computed. [2018-10-27 01:00:03,483 INFO L425 ceAbstractionStarter]: For program point L176(lines 176 545) no Hoare annotation was computed. [2018-10-27 01:00:03,483 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 556) no Hoare annotation was computed. [2018-10-27 01:00:03,483 INFO L425 ceAbstractionStarter]: For program point L110(lines 110 567) no Hoare annotation was computed. [2018-10-27 01:00:03,484 INFO L425 ceAbstractionStarter]: For program point L606(lines 606 610) no Hoare annotation was computed. [2018-10-27 01:00:03,484 INFO L425 ceAbstractionStarter]: For program point L573(lines 573 582) no Hoare annotation was computed. [2018-10-27 01:00:03,484 INFO L425 ceAbstractionStarter]: For program point L606-2(lines 606 610) no Hoare annotation was computed. [2018-10-27 01:00:03,484 INFO L425 ceAbstractionStarter]: For program point L573-2(lines 572 594) no Hoare annotation was computed. [2018-10-27 01:00:03,484 INFO L421 ceAbstractionStarter]: At program point L144(lines 140 557) the Hoare annotation is: (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (<= ssl3_connect_~s__state~0 4448)) [2018-10-27 01:00:03,484 INFO L425 ceAbstractionStarter]: For program point L575(lines 575 579) no Hoare annotation was computed. [2018-10-27 01:00:03,484 INFO L425 ceAbstractionStarter]: For program point L443(lines 443 448) no Hoare annotation was computed. [2018-10-27 01:00:03,484 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 216) no Hoare annotation was computed. [2018-10-27 01:00:03,484 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 544) no Hoare annotation was computed. [2018-10-27 01:00:03,484 INFO L425 ceAbstractionStarter]: For program point L146(lines 146 555) no Hoare annotation was computed. [2018-10-27 01:00:03,484 INFO L425 ceAbstractionStarter]: For program point L212-2(lines 202 534) no Hoare annotation was computed. [2018-10-27 01:00:03,484 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 566) no Hoare annotation was computed. [2018-10-27 01:00:03,484 INFO L425 ceAbstractionStarter]: For program point L477(lines 477 481) no Hoare annotation was computed. [2018-10-27 01:00:03,485 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 316) no Hoare annotation was computed. [2018-10-27 01:00:03,485 INFO L425 ceAbstractionStarter]: For program point L312-2(lines 310 322) no Hoare annotation was computed. [2018-10-27 01:00:03,485 INFO L421 ceAbstractionStarter]: At program point L180(lines 176 545) the Hoare annotation is: (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (<= ssl3_connect_~s__state~0 4528)) [2018-10-27 01:00:03,485 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 511 515) no Hoare annotation was computed. [2018-10-27 01:00:03,485 INFO L425 ceAbstractionStarter]: For program point L412(lines 412 416) no Hoare annotation was computed. [2018-10-27 01:00:03,485 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 253) no Hoare annotation was computed. [2018-10-27 01:00:03,485 INFO L425 ceAbstractionStarter]: For program point L182(lines 182 543) no Hoare annotation was computed. [2018-10-27 01:00:03,485 INFO L425 ceAbstractionStarter]: For program point L149(lines 149 554) no Hoare annotation was computed. [2018-10-27 01:00:03,485 INFO L425 ceAbstractionStarter]: For program point L116(lines 116 565) no Hoare annotation was computed. [2018-10-27 01:00:03,485 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 91) no Hoare annotation was computed. [2018-10-27 01:00:03,485 INFO L425 ceAbstractionStarter]: For program point L83-1(lines 65 619) no Hoare annotation was computed. [2018-10-27 01:00:03,485 INFO L421 ceAbstractionStarter]: At program point L150(lines 146 555) the Hoare annotation is: (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4464) (<= ssl3_connect_~blastFlag~0 4)) [2018-10-27 01:00:03,486 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 88) no Hoare annotation was computed. [2018-10-27 01:00:03,486 INFO L428 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 7 620) the Hoare annotation is: true [2018-10-27 01:00:03,486 INFO L425 ceAbstractionStarter]: For program point L482(lines 482 486) no Hoare annotation was computed. [2018-10-27 01:00:03,486 INFO L425 ceAbstractionStarter]: For program point L482-2(lines 482 486) no Hoare annotation was computed. [2018-10-27 01:00:03,486 INFO L425 ceAbstractionStarter]: For program point L284(lines 284 292) no Hoare annotation was computed. [2018-10-27 01:00:03,486 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 542) no Hoare annotation was computed. [2018-10-27 01:00:03,486 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 553) no Hoare annotation was computed. [2018-10-27 01:00:03,486 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 564) no Hoare annotation was computed. [2018-10-27 01:00:03,486 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 388) no Hoare annotation was computed. [2018-10-27 01:00:03,486 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 355) no Hoare annotation was computed. [2018-10-27 01:00:03,486 INFO L421 ceAbstractionStarter]: At program point L186(lines 182 543) the Hoare annotation is: (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560) (<= ssl3_connect_~blastFlag~0 4)) [2018-10-27 01:00:03,486 INFO L421 ceAbstractionStarter]: At program point L120(lines 116 565) the Hoare annotation is: (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4432)) [2018-10-27 01:00:03,486 INFO L421 ceAbstractionStarter]: At program point L352(lines 65 619) the Hoare annotation is: false [2018-10-27 01:00:03,486 INFO L425 ceAbstractionStarter]: For program point $Ultimate##87(lines 202 536) no Hoare annotation was computed. [2018-10-27 01:00:03,487 INFO L428 ceAbstractionStarter]: At program point L617(lines 65 619) the Hoare annotation is: true [2018-10-27 01:00:03,487 INFO L425 ceAbstractionStarter]: For program point L584(lines 584 590) no Hoare annotation was computed. [2018-10-27 01:00:03,487 INFO L425 ceAbstractionStarter]: For program point L518(lines 518 522) no Hoare annotation was computed. [2018-10-27 01:00:03,487 INFO L425 ceAbstractionStarter]: For program point L518-2(lines 518 522) no Hoare annotation was computed. [2018-10-27 01:00:03,487 INFO L425 ceAbstractionStarter]: For program point $Ultimate##88(lines 202 536) no Hoare annotation was computed. [2018-10-27 01:00:03,487 INFO L425 ceAbstractionStarter]: For program point L287(lines 287 291) no Hoare annotation was computed. [2018-10-27 01:00:03,487 INFO L425 ceAbstractionStarter]: For program point L287-2(lines 202 534) no Hoare annotation was computed. [2018-10-27 01:00:03,487 INFO L425 ceAbstractionStarter]: For program point L188(lines 188 541) no Hoare annotation was computed. [2018-10-27 01:00:03,487 INFO L425 ceAbstractionStarter]: For program point L155(lines 155 552) no Hoare annotation was computed. [2018-10-27 01:00:03,487 INFO L425 ceAbstractionStarter]: For program point L122(lines 122 563) no Hoare annotation was computed. [2018-10-27 01:00:03,487 INFO L425 ceAbstractionStarter]: For program point L453(lines 453 457) no Hoare annotation was computed. [2018-10-27 01:00:03,487 INFO L425 ceAbstractionStarter]: For program point L356(lines 356 360) no Hoare annotation was computed. [2018-10-27 01:00:03,487 INFO L425 ceAbstractionStarter]: For program point L224(lines 224 241) no Hoare annotation was computed. [2018-10-27 01:00:03,487 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 540) no Hoare annotation was computed. [2018-10-27 01:00:03,488 INFO L425 ceAbstractionStarter]: For program point L158(lines 158 551) no Hoare annotation was computed. [2018-10-27 01:00:03,488 INFO L425 ceAbstractionStarter]: For program point L224-2(lines 202 534) no Hoare annotation was computed. [2018-10-27 01:00:03,488 INFO L425 ceAbstractionStarter]: For program point L125(lines 125 562) no Hoare annotation was computed. [2018-10-27 01:00:03,488 INFO L425 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 7 620) no Hoare annotation was computed. [2018-10-27 01:00:03,488 INFO L421 ceAbstractionStarter]: At program point L192(lines 188 541) the Hoare annotation is: (or (and (<= ssl3_connect_~blastFlag~0 2) (<= 4560 ssl3_connect_~s__state~0)) (and (<= 4432 ssl3_connect_~s__state~0) (= ssl3_connect_~s__hit~0 0))) [2018-10-27 01:00:03,488 INFO L421 ceAbstractionStarter]: At program point L126(lines 122 563) the Hoare annotation is: (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4432)) [2018-10-27 01:00:03,488 INFO L425 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 7 620) no Hoare annotation was computed. [2018-10-27 01:00:03,488 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 490 502) no Hoare annotation was computed. [2018-10-27 01:00:03,488 INFO L425 ceAbstractionStarter]: For program point L424(lines 424 428) no Hoare annotation was computed. [2018-10-27 01:00:03,488 INFO L425 ceAbstractionStarter]: For program point L226(lines 226 231) no Hoare annotation was computed. [2018-10-27 01:00:03,488 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 539) no Hoare annotation was computed. [2018-10-27 01:00:03,488 INFO L425 ceAbstractionStarter]: For program point L161(lines 161 550) no Hoare annotation was computed. [2018-10-27 01:00:03,488 INFO L425 ceAbstractionStarter]: For program point L128(lines 128 561) no Hoare annotation was computed. [2018-10-27 01:00:03,488 INFO L425 ceAbstractionStarter]: For program point L525(lines 525 529) no Hoare annotation was computed. [2018-10-27 01:00:03,488 INFO L421 ceAbstractionStarter]: At program point L195(lines 194 539) the Hoare annotation is: (let ((.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~0))) (or (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1 .cse2) (and .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0) (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 (= ssl3_connect_~s__hit~0 0)))) [2018-10-27 01:00:03,489 INFO L421 ceAbstractionStarter]: At program point L162(lines 152 553) the Hoare annotation is: (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4480) (<= ssl3_connect_~blastFlag~0 4)) [2018-10-27 01:00:03,489 INFO L425 ceAbstractionStarter]: For program point L493(lines 493 498) no Hoare annotation was computed. [2018-10-27 01:00:03,489 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 471) no Hoare annotation was computed. [2018-10-27 01:00:03,489 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 460 471) no Hoare annotation was computed. [2018-10-27 01:00:03,489 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 266) no Hoare annotation was computed. [2018-10-27 01:00:03,489 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 202 534) no Hoare annotation was computed. [2018-10-27 01:00:03,489 INFO L425 ceAbstractionStarter]: For program point L395(lines 395 399) no Hoare annotation was computed. [2018-10-27 01:00:03,489 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 333) no Hoare annotation was computed. [2018-10-27 01:00:03,489 INFO L425 ceAbstractionStarter]: For program point L329-2(lines 202 534) no Hoare annotation was computed. [2018-10-27 01:00:03,489 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 538) no Hoare annotation was computed. [2018-10-27 01:00:03,489 INFO L425 ceAbstractionStarter]: For program point L164(lines 164 549) no Hoare annotation was computed. [2018-10-27 01:00:03,489 INFO L425 ceAbstractionStarter]: For program point L131(lines 131 560) no Hoare annotation was computed. [2018-10-27 01:00:03,489 INFO L425 ceAbstractionStarter]: For program point L98(lines 98 601) no Hoare annotation was computed. [2018-10-27 01:00:03,489 INFO L425 ceAbstractionStarter]: For program point L98-2(lines 65 619) no Hoare annotation was computed. [2018-10-27 01:00:03,489 INFO L425 ceAbstractionStarter]: For program point L462(lines 462 468) no Hoare annotation was computed. [2018-10-27 01:00:03,490 INFO L428 ceAbstractionStarter]: At program point L198(lines 197 538) the Hoare annotation is: true [2018-10-27 01:00:03,490 INFO L421 ceAbstractionStarter]: At program point L132(lines 128 561) the Hoare annotation is: (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4432)) [2018-10-27 01:00:03,490 INFO L425 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-10-27 01:00:03,490 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 237) no Hoare annotation was computed. [2018-10-27 01:00:03,490 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 303) no Hoare annotation was computed. [2018-10-27 01:00:03,490 INFO L425 ceAbstractionStarter]: For program point L299-2(lines 299 303) no Hoare annotation was computed. [2018-10-27 01:00:03,490 INFO L425 ceAbstractionStarter]: For program point L167(lines 167 548) no Hoare annotation was computed. [2018-10-27 01:00:03,490 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 559) no Hoare annotation was computed. [2018-10-27 01:00:03,490 INFO L425 ceAbstractionStarter]: For program point L101(lines 101 570) no Hoare annotation was computed. [2018-10-27 01:00:03,490 INFO L425 ceAbstractionStarter]: For program point L626-1(line 626) no Hoare annotation was computed. [2018-10-27 01:00:03,490 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 621 631) the Hoare annotation is: true [2018-10-27 01:00:03,490 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 621 631) no Hoare annotation was computed. [2018-10-27 01:00:03,490 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 621 631) no Hoare annotation was computed. [2018-10-27 01:00:03,490 INFO L428 ceAbstractionStarter]: At program point L626(line 626) the Hoare annotation is: true [2018-10-27 01:00:03,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 01:00:03 BoogieIcfgContainer [2018-10-27 01:00:03,506 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 01:00:03,506 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 01:00:03,506 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 01:00:03,506 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 01:00:03,507 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:55:31" (3/4) ... [2018-10-27 01:00:03,509 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-27 01:00:03,522 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-27 01:00:03,523 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_connect [2018-10-27 01:00:03,523 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-27 01:00:03,539 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-10-27 01:00:03,540 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-10-27 01:00:03,540 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-27 01:00:03,659 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_dfa56819-0896-46cc-b2c3-ae109b68c335/bin-2019/utaipan/witness.graphml [2018-10-27 01:00:03,660 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 01:00:03,660 INFO L168 Benchmark]: Toolchain (without parser) took 274006.22 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.1 GB). Free memory was 959.6 MB in the beginning and 3.5 GB in the end (delta: -2.6 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-10-27 01:00:03,661 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 01:00:03,661 INFO L168 Benchmark]: CACSL2BoogieTranslator took 368.30 ms. Allocated memory is still 1.0 GB. Free memory was 959.6 MB in the beginning and 943.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-10-27 01:00:03,661 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.81 ms. Allocated memory is still 1.0 GB. Free memory was 943.5 MB in the beginning and 940.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 01:00:03,664 INFO L168 Benchmark]: Boogie Preprocessor took 37.61 ms. Allocated memory is still 1.0 GB. Free memory was 940.8 MB in the beginning and 938.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 01:00:03,664 INFO L168 Benchmark]: RCFGBuilder took 1174.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -164.9 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2018-10-27 01:00:03,664 INFO L168 Benchmark]: TraceAbstraction took 272232.83 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 3.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-10-27 01:00:03,665 INFO L168 Benchmark]: Witness Printer took 153.69 ms. Allocated memory is still 5.1 GB. Free memory was 3.5 GB in the beginning and 3.5 GB in the end (delta: 2.1 kB). Peak memory consumption was 2.1 kB. Max. memory is 11.5 GB. [2018-10-27 01:00:03,666 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 368.30 ms. Allocated memory is still 1.0 GB. Free memory was 959.6 MB in the beginning and 943.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.81 ms. Allocated memory is still 1.0 GB. Free memory was 943.5 MB in the beginning and 940.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.61 ms. Allocated memory is still 1.0 GB. Free memory was 940.8 MB in the beginning and 938.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1174.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -164.9 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 272232.83 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 3.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 153.69 ms. Allocated memory is still 5.1 GB. Free memory was 3.5 GB in the beginning and 3.5 GB in the end (delta: 2.1 kB). Peak memory consumption was 2.1 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 613]: 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: 98]: Loop Invariant Derived loop invariant: ((((((((s__s3__tmp__next_state___0 <= 3 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) || s__state <= 3) || (s__state == 4416 && blastFlag <= 4)) || ((4432 <= s__state && blastFlag <= 4) && s__state <= 4528)) || (((((blastFlag <= 4 && 4560 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4352) && 4352 <= s__state) && s__hit == 0)) || blastFlag <= 2) || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (4432 <= s__state && s__state <= 4464) && blastFlag <= 4 - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (4352 <= s__state && blastFlag <= 4) && s__state <= 4432 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && 4560 <= s__state) || (4432 <= s__state && s__hit == 0) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && 4352 <= s__state) && s__state <= 4432 - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: (4432 <= s__state && s__state <= 4512) && blastFlag <= 4 - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && 4352 <= s__state) && s__state <= 4432 - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (4432 <= s__state && s__state <= 4480) && blastFlag <= 4 - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && s__state <= 4352) && 4352 <= s__state) || (((s__s3__tmp__next_state___0 <= 3 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4)) || (((((blastFlag <= 4 && 4560 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: blastFlag <= 2 && s__state == 12292 - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (4432 <= s__state && blastFlag <= 4) && s__state <= 4448 - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 182]: Loop Invariant Derived loop invariant: (4432 <= s__state && s__state <= 4560) && blastFlag <= 4 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && 4352 <= s__state) && s__state <= 4432 - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (4432 <= s__state && blastFlag <= 4) && s__state <= 4528 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (4432 <= s__state && s__state <= 4512) && blastFlag <= 4 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 137 locations, 1 error locations. SAFE Result, 272.1s OverallTime, 21 OverallIterations, 15 TraceHistogramMax, 13.4s AutomataDifference, 0.0s DeadEndRemovalTime, 1.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 4057 SDtfs, 1672 SDslu, 2345 SDs, 0 SdLazy, 2084 SolverSat, 534 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2083 GetRequests, 2050 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5243occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 251.2s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 3570 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 27 PreInvPairs, 148 NumberOfFragments, 264 HoareAnnotationTreeSize, 27 FomulaSimplifications, 32227 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 27 FomulaSimplificationsInter, 24926 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 5105 NumberOfCodeBlocks, 5105 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 6085 ConstructedInterpolants, 0 QuantifiedInterpolants, 2076897 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1918 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 27 InterpolantComputations, 18 PerfectInterpolantSequences, 18915/19011 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...