./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.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_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/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 9b2fdeede7b1203b845c20c562beaee69c29ce3b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/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 9b2fdeede7b1203b845c20c562beaee69c29ce3b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 23:25:43,272 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 23:25:43,273 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 23:25:43,284 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 23:25:43,284 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 23:25:43,285 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 23:25:43,286 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 23:25:43,288 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 23:25:43,289 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 23:25:43,290 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 23:25:43,291 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 23:25:43,291 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 23:25:43,292 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 23:25:43,293 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 23:25:43,294 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 23:25:43,295 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 23:25:43,295 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 23:25:43,297 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 23:25:43,299 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 23:25:43,300 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 23:25:43,301 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 23:25:43,302 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 23:25:43,304 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 23:25:43,305 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 23:25:43,305 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 23:25:43,306 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 23:25:43,307 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 23:25:43,307 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 23:25:43,308 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 23:25:43,309 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 23:25:43,309 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 23:25:43,310 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 23:25:43,310 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 23:25:43,311 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 23:25:43,311 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 23:25:43,312 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 23:25:43,313 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 23:25:43,326 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 23:25:43,326 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 23:25:43,327 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 23:25:43,327 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 23:25:43,327 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 23:25:43,327 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 23:25:43,328 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 23:25:43,328 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 23:25:43,328 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 23:25:43,328 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 23:25:43,328 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 23:25:43,329 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 23:25:43,329 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 23:25:43,329 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 23:25:43,330 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 23:25:43,330 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 23:25:43,330 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 23:25:43,330 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 23:25:43,330 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 23:25:43,331 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 23:25:43,331 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 23:25:43,331 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 23:25:43,331 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 23:25:43,331 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 23:25:43,332 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 23:25:43,332 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 23:25:43,332 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 23:25:43,332 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 23:25:43,332 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 23:25:43,333 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 23:25:43,333 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 23:25:43,333 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 23:25:43,333 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 23:25:43,333 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 23:25:43,333 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_7c471cf4-57b8-4f6e-b092-a32846bd8020/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 -> 9b2fdeede7b1203b845c20c562beaee69c29ce3b [2018-10-26 23:25:43,370 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 23:25:43,388 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 23:25:43,391 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 23:25:43,392 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 23:25:43,393 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 23:25:43,394 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c [2018-10-26 23:25:43,445 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/data/b5a3c0465/d770fe7d93e743848444a4db8eff074e/FLAG5f256d539 [2018-10-26 23:25:43,972 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 23:25:43,973 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c [2018-10-26 23:25:44,000 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/data/b5a3c0465/d770fe7d93e743848444a4db8eff074e/FLAG5f256d539 [2018-10-26 23:25:44,014 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/data/b5a3c0465/d770fe7d93e743848444a4db8eff074e [2018-10-26 23:25:44,018 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 23:25:44,020 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 23:25:44,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 23:25:44,021 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 23:25:44,026 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 23:25:44,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:25:44" (1/1) ... [2018-10-26 23:25:44,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ae27fc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:25:44, skipping insertion in model container [2018-10-26 23:25:44,030 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:25:44" (1/1) ... [2018-10-26 23:25:44,039 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 23:25:44,099 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 23:25:44,880 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:25:44,891 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 23:25:45,365 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:25:45,384 INFO L193 MainTranslator]: Completed translation [2018-10-26 23:25:45,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:25:45 WrapperNode [2018-10-26 23:25:45,384 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 23:25:45,385 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 23:25:45,385 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 23:25:45,385 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 23:25:45,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:25:45" (1/1) ... [2018-10-26 23:25:45,576 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:25:45" (1/1) ... [2018-10-26 23:25:45,644 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 23:25:45,644 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 23:25:45,644 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 23:25:45,644 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 23:25:45,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:25:45" (1/1) ... [2018-10-26 23:25:45,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:25:45" (1/1) ... [2018-10-26 23:25:45,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:25:45" (1/1) ... [2018-10-26 23:25:45,670 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:25:45" (1/1) ... [2018-10-26 23:25:45,713 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:25:45" (1/1) ... [2018-10-26 23:25:45,722 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:25:45" (1/1) ... [2018-10-26 23:25:45,729 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:25:45" (1/1) ... [2018-10-26 23:25:45,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 23:25:45,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 23:25:45,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 23:25:45,738 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 23:25:45,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:25:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/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-26 23:25:45,811 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 23:25:45,812 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 23:25:45,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 23:25:45,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 23:25:45,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 23:25:45,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 23:25:45,812 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-10-26 23:25:45,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-10-26 23:25:46,464 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-10-26 23:25:46,465 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-10-26 23:25:48,208 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 23:25:48,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:25:48 BoogieIcfgContainer [2018-10-26 23:25:48,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 23:25:48,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 23:25:48,210 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 23:25:48,213 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 23:25:48,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 11:25:44" (1/3) ... [2018-10-26 23:25:48,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@750ff30d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 11:25:48, skipping insertion in model container [2018-10-26 23:25:48,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:25:45" (2/3) ... [2018-10-26 23:25:48,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@750ff30d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 11:25:48, skipping insertion in model container [2018-10-26 23:25:48,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:25:48" (3/3) ... [2018-10-26 23:25:48,217 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01_false-unreach-call.i.cil.c [2018-10-26 23:25:48,227 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 23:25:48,235 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 23:25:48,253 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 23:25:48,287 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 23:25:48,287 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 23:25:48,287 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 23:25:48,288 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 23:25:48,288 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 23:25:48,288 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 23:25:48,288 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 23:25:48,288 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 23:25:48,309 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2018-10-26 23:25:48,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-26 23:25:48,316 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:25:48,317 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-26 23:25:48,320 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:25:48,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:25:48,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1265738566, now seen corresponding path program 1 times [2018-10-26 23:25:48,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:25:48,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:25:48,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:25:48,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:25:48,390 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:25:48,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:48,771 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-26 23:25:48,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:25:48,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:25:48,774 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:25:48,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:25:48,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:25:48,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:25:48,796 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 3 states. [2018-10-26 23:25:49,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:25:49,012 INFO L93 Difference]: Finished difference Result 388 states and 640 transitions. [2018-10-26 23:25:49,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:25:49,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-26 23:25:49,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:25:49,032 INFO L225 Difference]: With dead ends: 388 [2018-10-26 23:25:49,032 INFO L226 Difference]: Without dead ends: 225 [2018-10-26 23:25:49,036 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-26 23:25:49,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-26 23:25:49,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-10-26 23:25:49,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-10-26 23:25:49,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 329 transitions. [2018-10-26 23:25:49,102 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 329 transitions. Word has length 31 [2018-10-26 23:25:49,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:25:49,102 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 329 transitions. [2018-10-26 23:25:49,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:25:49,102 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 329 transitions. [2018-10-26 23:25:49,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-26 23:25:49,105 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:25:49,105 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-26 23:25:49,105 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:25:49,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:25:49,106 INFO L82 PathProgramCache]: Analyzing trace with hash -186957446, now seen corresponding path program 1 times [2018-10-26 23:25:49,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:25:49,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:25:49,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:25:49,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:25:49,108 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:25:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:49,263 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:25:49,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:25:49,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:25:49,264 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:25:49,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:25:49,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:25:49,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:25:49,275 INFO L87 Difference]: Start difference. First operand 225 states and 329 transitions. Second operand 3 states. [2018-10-26 23:25:49,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:25:49,400 INFO L93 Difference]: Finished difference Result 436 states and 646 transitions. [2018-10-26 23:25:49,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:25:49,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-10-26 23:25:49,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:25:49,404 INFO L225 Difference]: With dead ends: 436 [2018-10-26 23:25:49,404 INFO L226 Difference]: Without dead ends: 328 [2018-10-26 23:25:49,405 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-26 23:25:49,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-26 23:25:49,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-10-26 23:25:49,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-10-26 23:25:49,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 479 transitions. [2018-10-26 23:25:49,431 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 479 transitions. Word has length 47 [2018-10-26 23:25:49,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:25:49,432 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 479 transitions. [2018-10-26 23:25:49,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:25:49,432 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 479 transitions. [2018-10-26 23:25:49,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-26 23:25:49,435 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:25:49,436 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:25:49,436 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:25:49,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:25:49,436 INFO L82 PathProgramCache]: Analyzing trace with hash 435222576, now seen corresponding path program 1 times [2018-10-26 23:25:49,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:25:49,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:25:49,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:25:49,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:25:49,440 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:25:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:49,621 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 23:25:49,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:25:49,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:25:49,623 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:25:49,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:25:49,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:25:49,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:25:49,624 INFO L87 Difference]: Start difference. First operand 328 states and 479 transitions. Second operand 3 states. [2018-10-26 23:25:49,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:25:49,824 INFO L93 Difference]: Finished difference Result 645 states and 950 transitions. [2018-10-26 23:25:49,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:25:49,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-26 23:25:49,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:25:49,828 INFO L225 Difference]: With dead ends: 645 [2018-10-26 23:25:49,828 INFO L226 Difference]: Without dead ends: 434 [2018-10-26 23:25:49,829 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-26 23:25:49,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-10-26 23:25:49,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-10-26 23:25:49,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-10-26 23:25:49,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 636 transitions. [2018-10-26 23:25:49,859 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 636 transitions. Word has length 66 [2018-10-26 23:25:49,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:25:49,860 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 636 transitions. [2018-10-26 23:25:49,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:25:49,860 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 636 transitions. [2018-10-26 23:25:49,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-26 23:25:49,865 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:25:49,865 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:25:49,866 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:25:49,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:25:49,867 INFO L82 PathProgramCache]: Analyzing trace with hash -244885070, now seen corresponding path program 1 times [2018-10-26 23:25:49,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:25:49,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:25:49,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:25:49,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:25:49,869 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:25:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:50,064 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-26 23:25:50,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:25:50,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:25:50,067 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:25:50,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:25:50,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:25:50,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:25:50,069 INFO L87 Difference]: Start difference. First operand 434 states and 636 transitions. Second operand 3 states. [2018-10-26 23:25:50,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:25:50,228 INFO L93 Difference]: Finished difference Result 542 states and 797 transitions. [2018-10-26 23:25:50,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:25:50,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-10-26 23:25:50,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:25:50,238 INFO L225 Difference]: With dead ends: 542 [2018-10-26 23:25:50,238 INFO L226 Difference]: Without dead ends: 540 [2018-10-26 23:25:50,240 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-26 23:25:50,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-10-26 23:25:50,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2018-10-26 23:25:50,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2018-10-26 23:25:50,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 794 transitions. [2018-10-26 23:25:50,281 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 794 transitions. Word has length 87 [2018-10-26 23:25:50,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:25:50,281 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 794 transitions. [2018-10-26 23:25:50,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:25:50,281 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 794 transitions. [2018-10-26 23:25:50,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-26 23:25:50,287 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:25:50,287 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:25:50,287 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:25:50,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:25:50,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1961911637, now seen corresponding path program 1 times [2018-10-26 23:25:50,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:25:50,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:25:50,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:25:50,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:25:50,291 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:25:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:50,520 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-26 23:25:50,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:25:50,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:25:50,522 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:25:50,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:25:50,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:25:50,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:25:50,525 INFO L87 Difference]: Start difference. First operand 540 states and 794 transitions. Second operand 3 states. [2018-10-26 23:25:50,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:25:50,737 INFO L93 Difference]: Finished difference Result 542 states and 795 transitions. [2018-10-26 23:25:50,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:25:50,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2018-10-26 23:25:50,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:25:50,741 INFO L225 Difference]: With dead ends: 542 [2018-10-26 23:25:50,742 INFO L226 Difference]: Without dead ends: 540 [2018-10-26 23:25:50,750 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-26 23:25:50,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-10-26 23:25:50,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2018-10-26 23:25:50,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2018-10-26 23:25:50,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 793 transitions. [2018-10-26 23:25:50,775 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 793 transitions. Word has length 109 [2018-10-26 23:25:50,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:25:50,777 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 793 transitions. [2018-10-26 23:25:50,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:25:50,777 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 793 transitions. [2018-10-26 23:25:50,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-26 23:25:50,784 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:25:50,785 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:25:50,785 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:25:50,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:25:50,785 INFO L82 PathProgramCache]: Analyzing trace with hash -234771568, now seen corresponding path program 1 times [2018-10-26 23:25:50,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:25:50,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:25:50,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:25:50,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:25:50,787 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:25:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:51,162 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-26 23:25:51,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:25:51,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:25:51,162 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:25:51,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:25:51,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:25:51,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:25:51,164 INFO L87 Difference]: Start difference. First operand 540 states and 793 transitions. Second operand 4 states. [2018-10-26 23:25:52,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:25:52,090 INFO L93 Difference]: Finished difference Result 1329 states and 1956 transitions. [2018-10-26 23:25:52,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:25:52,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2018-10-26 23:25:52,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:25:52,095 INFO L225 Difference]: With dead ends: 1329 [2018-10-26 23:25:52,095 INFO L226 Difference]: Without dead ends: 802 [2018-10-26 23:25:52,097 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:25:52,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2018-10-26 23:25:52,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 665. [2018-10-26 23:25:52,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2018-10-26 23:25:52,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 1008 transitions. [2018-10-26 23:25:52,127 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 1008 transitions. Word has length 111 [2018-10-26 23:25:52,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:25:52,127 INFO L481 AbstractCegarLoop]: Abstraction has 665 states and 1008 transitions. [2018-10-26 23:25:52,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:25:52,127 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 1008 transitions. [2018-10-26 23:25:52,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-26 23:25:52,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:25:52,130 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:25:52,132 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:25:52,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:25:52,133 INFO L82 PathProgramCache]: Analyzing trace with hash 608334435, now seen corresponding path program 1 times [2018-10-26 23:25:52,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:25:52,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:25:52,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:25:52,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:25:52,135 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:25:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:52,384 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-26 23:25:52,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:25:52,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:25:52,385 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:25:52,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:25:52,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:25:52,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:25:52,387 INFO L87 Difference]: Start difference. First operand 665 states and 1008 transitions. Second operand 4 states. [2018-10-26 23:25:54,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:25:54,465 INFO L93 Difference]: Finished difference Result 1449 states and 2161 transitions. [2018-10-26 23:25:54,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:25:54,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-10-26 23:25:54,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:25:54,470 INFO L225 Difference]: With dead ends: 1449 [2018-10-26 23:25:54,472 INFO L226 Difference]: Without dead ends: 797 [2018-10-26 23:25:54,473 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:25:54,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2018-10-26 23:25:54,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 665. [2018-10-26 23:25:54,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2018-10-26 23:25:54,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 1003 transitions. [2018-10-26 23:25:54,503 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 1003 transitions. Word has length 127 [2018-10-26 23:25:54,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:25:54,504 INFO L481 AbstractCegarLoop]: Abstraction has 665 states and 1003 transitions. [2018-10-26 23:25:54,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:25:54,504 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 1003 transitions. [2018-10-26 23:25:54,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-26 23:25:54,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:25:54,511 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:25:54,511 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:25:54,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:25:54,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1105633659, now seen corresponding path program 1 times [2018-10-26 23:25:54,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:25:54,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:25:54,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:25:54,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:25:54,513 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:25:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:54,968 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-26 23:25:55,171 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-10-26 23:25:55,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:25:55,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 23:25:55,172 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:25:55,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 23:25:55,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 23:25:55,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:25:55,173 INFO L87 Difference]: Start difference. First operand 665 states and 1003 transitions. Second operand 6 states. [2018-10-26 23:25:56,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:25:56,602 INFO L93 Difference]: Finished difference Result 1275 states and 1922 transitions. [2018-10-26 23:25:56,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:25:56,603 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-10-26 23:25:56,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:25:56,608 INFO L225 Difference]: With dead ends: 1275 [2018-10-26 23:25:56,608 INFO L226 Difference]: Without dead ends: 750 [2018-10-26 23:25:56,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:25:56,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2018-10-26 23:25:56,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 674. [2018-10-26 23:25:56,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2018-10-26 23:25:56,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1017 transitions. [2018-10-26 23:25:56,636 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 1017 transitions. Word has length 127 [2018-10-26 23:25:56,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:25:56,637 INFO L481 AbstractCegarLoop]: Abstraction has 674 states and 1017 transitions. [2018-10-26 23:25:56,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 23:25:56,638 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1017 transitions. [2018-10-26 23:25:56,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-26 23:25:56,639 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:25:56,640 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:25:56,640 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:25:56,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:25:56,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1154145746, now seen corresponding path program 1 times [2018-10-26 23:25:56,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:25:56,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:25:56,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:25:56,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:25:56,642 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:25:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:56,914 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-26 23:25:56,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:25:56,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:25:56,915 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:25:56,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:25:56,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:25:56,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:25:56,916 INFO L87 Difference]: Start difference. First operand 674 states and 1017 transitions. Second operand 4 states. [2018-10-26 23:25:57,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:25:57,831 INFO L93 Difference]: Finished difference Result 1809 states and 2716 transitions. [2018-10-26 23:25:57,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:25:57,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2018-10-26 23:25:57,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:25:57,838 INFO L225 Difference]: With dead ends: 1809 [2018-10-26 23:25:57,838 INFO L226 Difference]: Without dead ends: 1157 [2018-10-26 23:25:57,840 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:25:57,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2018-10-26 23:25:57,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 798. [2018-10-26 23:25:57,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2018-10-26 23:25:57,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1206 transitions. [2018-10-26 23:25:57,877 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1206 transitions. Word has length 128 [2018-10-26 23:25:57,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:25:57,877 INFO L481 AbstractCegarLoop]: Abstraction has 798 states and 1206 transitions. [2018-10-26 23:25:57,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:25:57,878 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1206 transitions. [2018-10-26 23:25:57,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-26 23:25:57,884 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:25:57,884 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:25:57,884 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:25:57,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:25:57,885 INFO L82 PathProgramCache]: Analyzing trace with hash -804429040, now seen corresponding path program 1 times [2018-10-26 23:25:57,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:25:57,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:25:57,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:25:57,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:25:57,886 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:25:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:58,156 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-10-26 23:25:58,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:25:58,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:25:58,156 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:25:58,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:25:58,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:25:58,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:25:58,159 INFO L87 Difference]: Start difference. First operand 798 states and 1206 transitions. Second operand 4 states. [2018-10-26 23:25:58,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:25:58,578 INFO L93 Difference]: Finished difference Result 1706 states and 2543 transitions. [2018-10-26 23:25:58,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:25:58,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2018-10-26 23:25:58,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:25:58,583 INFO L225 Difference]: With dead ends: 1706 [2018-10-26 23:25:58,583 INFO L226 Difference]: Without dead ends: 930 [2018-10-26 23:25:58,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:25:58,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2018-10-26 23:25:58,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 798. [2018-10-26 23:25:58,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2018-10-26 23:25:58,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1201 transitions. [2018-10-26 23:25:58,620 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1201 transitions. Word has length 128 [2018-10-26 23:25:58,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:25:58,620 INFO L481 AbstractCegarLoop]: Abstraction has 798 states and 1201 transitions. [2018-10-26 23:25:58,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:25:58,621 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1201 transitions. [2018-10-26 23:25:58,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-26 23:25:58,625 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:25:58,625 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:25:58,625 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:25:58,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:25:58,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1196040717, now seen corresponding path program 1 times [2018-10-26 23:25:58,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:25:58,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:25:58,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:25:58,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:25:58,627 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:25:58,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:58,910 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-10-26 23:25:58,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:25:58,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:25:58,911 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:25:58,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:25:58,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:25:58,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:25:58,912 INFO L87 Difference]: Start difference. First operand 798 states and 1201 transitions. Second operand 4 states. [2018-10-26 23:25:59,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:25:59,168 INFO L93 Difference]: Finished difference Result 1562 states and 2352 transitions. [2018-10-26 23:25:59,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:25:59,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2018-10-26 23:25:59,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:25:59,174 INFO L225 Difference]: With dead ends: 1562 [2018-10-26 23:25:59,175 INFO L226 Difference]: Without dead ends: 940 [2018-10-26 23:25:59,177 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:25:59,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2018-10-26 23:25:59,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 874. [2018-10-26 23:25:59,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-10-26 23:25:59,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1325 transitions. [2018-10-26 23:25:59,216 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1325 transitions. Word has length 128 [2018-10-26 23:25:59,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:25:59,216 INFO L481 AbstractCegarLoop]: Abstraction has 874 states and 1325 transitions. [2018-10-26 23:25:59,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:25:59,216 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1325 transitions. [2018-10-26 23:25:59,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-26 23:25:59,220 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:25:59,221 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:25:59,221 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:25:59,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:25:59,221 INFO L82 PathProgramCache]: Analyzing trace with hash 380620777, now seen corresponding path program 1 times [2018-10-26 23:25:59,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:25:59,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:25:59,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:25:59,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:25:59,225 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:25:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:59,484 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-10-26 23:25:59,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:25:59,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:25:59,484 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:25:59,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:25:59,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:25:59,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:25:59,485 INFO L87 Difference]: Start difference. First operand 874 states and 1325 transitions. Second operand 4 states. [2018-10-26 23:26:00,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:26:00,388 INFO L93 Difference]: Finished difference Result 1858 states and 2781 transitions. [2018-10-26 23:26:00,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:26:00,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2018-10-26 23:26:00,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:26:00,392 INFO L225 Difference]: With dead ends: 1858 [2018-10-26 23:26:00,393 INFO L226 Difference]: Without dead ends: 1006 [2018-10-26 23:26:00,396 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:26:00,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2018-10-26 23:26:00,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 874. [2018-10-26 23:26:00,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-10-26 23:26:00,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1320 transitions. [2018-10-26 23:26:00,431 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1320 transitions. Word has length 129 [2018-10-26 23:26:00,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:26:00,431 INFO L481 AbstractCegarLoop]: Abstraction has 874 states and 1320 transitions. [2018-10-26 23:26:00,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:26:00,431 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1320 transitions. [2018-10-26 23:26:00,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-26 23:26:00,436 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:26:00,436 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:26:00,436 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:26:00,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:26:00,436 INFO L82 PathProgramCache]: Analyzing trace with hash -705047861, now seen corresponding path program 1 times [2018-10-26 23:26:00,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:26:00,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:26:00,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:26:00,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:26:00,438 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:26:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:26:00,713 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-10-26 23:26:00,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:26:00,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:26:00,713 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:26:00,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:26:00,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:26:00,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:26:00,716 INFO L87 Difference]: Start difference. First operand 874 states and 1320 transitions. Second operand 4 states. [2018-10-26 23:26:01,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:26:01,834 INFO L93 Difference]: Finished difference Result 1858 states and 2771 transitions. [2018-10-26 23:26:01,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:26:01,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2018-10-26 23:26:01,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:26:01,843 INFO L225 Difference]: With dead ends: 1858 [2018-10-26 23:26:01,843 INFO L226 Difference]: Without dead ends: 1006 [2018-10-26 23:26:01,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:26:01,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2018-10-26 23:26:01,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 874. [2018-10-26 23:26:01,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-10-26 23:26:01,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1315 transitions. [2018-10-26 23:26:01,881 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1315 transitions. Word has length 130 [2018-10-26 23:26:01,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:26:01,882 INFO L481 AbstractCegarLoop]: Abstraction has 874 states and 1315 transitions. [2018-10-26 23:26:01,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:26:01,882 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1315 transitions. [2018-10-26 23:26:01,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-26 23:26:01,886 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:26:01,887 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:26:01,887 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:26:01,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:26:01,888 INFO L82 PathProgramCache]: Analyzing trace with hash 324717383, now seen corresponding path program 1 times [2018-10-26 23:26:01,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:26:01,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:26:01,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:26:01,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:26:01,889 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:26:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:26:02,138 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-10-26 23:26:02,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:26:02,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:26:02,139 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:26:02,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:26:02,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:26:02,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:26:02,141 INFO L87 Difference]: Start difference. First operand 874 states and 1315 transitions. Second operand 4 states. [2018-10-26 23:26:02,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:26:02,758 INFO L93 Difference]: Finished difference Result 1858 states and 2761 transitions. [2018-10-26 23:26:02,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:26:02,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2018-10-26 23:26:02,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:26:02,767 INFO L225 Difference]: With dead ends: 1858 [2018-10-26 23:26:02,768 INFO L226 Difference]: Without dead ends: 1006 [2018-10-26 23:26:02,770 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:26:02,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2018-10-26 23:26:02,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 874. [2018-10-26 23:26:02,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-10-26 23:26:02,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1310 transitions. [2018-10-26 23:26:02,805 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1310 transitions. Word has length 131 [2018-10-26 23:26:02,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:26:02,806 INFO L481 AbstractCegarLoop]: Abstraction has 874 states and 1310 transitions. [2018-10-26 23:26:02,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:26:02,806 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1310 transitions. [2018-10-26 23:26:02,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-26 23:26:02,810 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:26:02,810 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:26:02,810 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:26:02,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:26:02,811 INFO L82 PathProgramCache]: Analyzing trace with hash 831455428, now seen corresponding path program 1 times [2018-10-26 23:26:02,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:26:02,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:26:02,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:26:02,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:26:02,812 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:26:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:26:02,970 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-10-26 23:26:02,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:26:02,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:26:02,971 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:26:02,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:26:02,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:26:02,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:26:02,972 INFO L87 Difference]: Start difference. First operand 874 states and 1310 transitions. Second operand 4 states. [2018-10-26 23:26:03,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:26:03,489 INFO L93 Difference]: Finished difference Result 1813 states and 2696 transitions. [2018-10-26 23:26:03,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:26:03,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2018-10-26 23:26:03,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:26:03,492 INFO L225 Difference]: With dead ends: 1813 [2018-10-26 23:26:03,492 INFO L226 Difference]: Without dead ends: 961 [2018-10-26 23:26:03,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:26:03,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2018-10-26 23:26:03,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 874. [2018-10-26 23:26:03,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-10-26 23:26:03,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1305 transitions. [2018-10-26 23:26:03,533 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1305 transitions. Word has length 131 [2018-10-26 23:26:03,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:26:03,533 INFO L481 AbstractCegarLoop]: Abstraction has 874 states and 1305 transitions. [2018-10-26 23:26:03,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:26:03,534 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1305 transitions. [2018-10-26 23:26:03,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-26 23:26:03,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:26:03,539 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:26:03,539 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:26:03,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:26:03,539 INFO L82 PathProgramCache]: Analyzing trace with hash -490863186, now seen corresponding path program 1 times [2018-10-26 23:26:03,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:26:03,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:26:03,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:26:03,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:26:03,540 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:26:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:26:03,786 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-10-26 23:26:03,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:26:03,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:26:03,787 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:26:03,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:26:03,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:26:03,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:26:03,788 INFO L87 Difference]: Start difference. First operand 874 states and 1305 transitions. Second operand 4 states. [2018-10-26 23:26:04,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:26:04,279 INFO L93 Difference]: Finished difference Result 1795 states and 2661 transitions. [2018-10-26 23:26:04,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:26:04,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2018-10-26 23:26:04,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:26:04,288 INFO L225 Difference]: With dead ends: 1795 [2018-10-26 23:26:04,288 INFO L226 Difference]: Without dead ends: 943 [2018-10-26 23:26:04,290 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:26:04,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2018-10-26 23:26:04,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 874. [2018-10-26 23:26:04,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-10-26 23:26:04,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1300 transitions. [2018-10-26 23:26:04,333 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1300 transitions. Word has length 132 [2018-10-26 23:26:04,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:26:04,333 INFO L481 AbstractCegarLoop]: Abstraction has 874 states and 1300 transitions. [2018-10-26 23:26:04,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:26:04,334 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1300 transitions. [2018-10-26 23:26:04,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-26 23:26:04,339 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:26:04,339 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 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] [2018-10-26 23:26:04,339 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:26:04,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:26:04,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1502175526, now seen corresponding path program 1 times [2018-10-26 23:26:04,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:26:04,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:26:04,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:26:04,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:26:04,341 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:26:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:26:04,680 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2018-10-26 23:26:04,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:26:04,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:26:04,680 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:26:04,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:26:04,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:26:04,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:26:04,681 INFO L87 Difference]: Start difference. First operand 874 states and 1300 transitions. Second operand 4 states. [2018-10-26 23:26:05,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:26:05,062 INFO L93 Difference]: Finished difference Result 1963 states and 2916 transitions. [2018-10-26 23:26:05,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:26:05,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2018-10-26 23:26:05,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:26:05,071 INFO L225 Difference]: With dead ends: 1963 [2018-10-26 23:26:05,071 INFO L226 Difference]: Without dead ends: 1111 [2018-10-26 23:26:05,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:26:05,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2018-10-26 23:26:05,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 989. [2018-10-26 23:26:05,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 989 states. [2018-10-26 23:26:05,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1490 transitions. [2018-10-26 23:26:05,111 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1490 transitions. Word has length 132 [2018-10-26 23:26:05,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:26:05,112 INFO L481 AbstractCegarLoop]: Abstraction has 989 states and 1490 transitions. [2018-10-26 23:26:05,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:26:05,112 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1490 transitions. [2018-10-26 23:26:05,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-26 23:26:05,115 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:26:05,115 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:26:05,115 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:26:05,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:26:05,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1795878271, now seen corresponding path program 1 times [2018-10-26 23:26:05,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:26:05,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:26:05,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:26:05,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:26:05,117 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:26:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:26:05,326 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-10-26 23:26:05,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:26:05,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 23:26:05,326 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:26:05,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 23:26:05,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 23:26:05,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:26:05,327 INFO L87 Difference]: Start difference. First operand 989 states and 1490 transitions. Second operand 6 states. [2018-10-26 23:26:05,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:26:05,637 INFO L93 Difference]: Finished difference Result 1854 states and 2793 transitions. [2018-10-26 23:26:05,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:26:05,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2018-10-26 23:26:05,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:26:05,640 INFO L225 Difference]: With dead ends: 1854 [2018-10-26 23:26:05,640 INFO L226 Difference]: Without dead ends: 1062 [2018-10-26 23:26:05,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:26:05,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2018-10-26 23:26:05,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 990. [2018-10-26 23:26:05,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 990 states. [2018-10-26 23:26:05,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1491 transitions. [2018-10-26 23:26:05,679 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1491 transitions. Word has length 135 [2018-10-26 23:26:05,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:26:05,679 INFO L481 AbstractCegarLoop]: Abstraction has 990 states and 1491 transitions. [2018-10-26 23:26:05,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 23:26:05,679 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1491 transitions. [2018-10-26 23:26:05,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-26 23:26:05,684 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:26:05,684 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:26:05,685 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:26:05,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:26:05,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1269980539, now seen corresponding path program 1 times [2018-10-26 23:26:05,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:26:05,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:26:05,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:26:05,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:26:05,686 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:26:05,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 23:26:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 23:26:06,150 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-26 23:26:06,181 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 23:26:06,183 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 23:26:06,185 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 23:26:06,185 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 23:26:06,186 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 23:26:06,186 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 23:26:06,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 11:26:06 BoogieIcfgContainer [2018-10-26 23:26:06,285 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 23:26:06,286 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 23:26:06,286 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 23:26:06,286 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 23:26:06,287 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:25:48" (3/4) ... [2018-10-26 23:26:06,290 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-26 23:26:06,292 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 23:26:06,293 INFO L168 Benchmark]: Toolchain (without parser) took 22274.46 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 233.3 MB). Free memory was 957.0 MB in the beginning and 907.5 MB in the end (delta: 49.5 MB). Peak memory consumption was 282.8 MB. Max. memory is 11.5 GB. [2018-10-26 23:26:06,294 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 23:26:06,294 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1363.60 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 785.2 MB in the end (delta: 171.8 MB). Peak memory consumption was 171.8 MB. Max. memory is 11.5 GB. [2018-10-26 23:26:06,295 INFO L168 Benchmark]: Boogie Procedure Inliner took 258.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 785.2 MB in the beginning and 1.2 GB in the end (delta: -376.2 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2018-10-26 23:26:06,295 INFO L168 Benchmark]: Boogie Preprocessor took 92.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2018-10-26 23:26:06,296 INFO L168 Benchmark]: RCFGBuilder took 2471.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 995.3 MB in the end (delta: 156.2 MB). Peak memory consumption was 156.2 MB. Max. memory is 11.5 GB. [2018-10-26 23:26:06,296 INFO L168 Benchmark]: TraceAbstraction took 18075.47 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 62.9 MB). Free memory was 995.3 MB in the beginning and 907.5 MB in the end (delta: 87.8 MB). Peak memory consumption was 150.8 MB. Max. memory is 11.5 GB. [2018-10-26 23:26:06,297 INFO L168 Benchmark]: Witness Printer took 6.49 ms. Allocated memory is still 1.3 GB. Free memory is still 907.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 23:26:06,306 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1363.60 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 785.2 MB in the end (delta: 171.8 MB). Peak memory consumption was 171.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 258.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 785.2 MB in the beginning and 1.2 GB in the end (delta: -376.2 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 92.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2471.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 995.3 MB in the end (delta: 156.2 MB). Peak memory consumption was 156.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18075.47 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 62.9 MB). Free memory was 995.3 MB in the beginning and 907.5 MB in the end (delta: 87.8 MB). Peak memory consumption was 150.8 MB. Max. memory is 11.5 GB. * Witness Printer took 6.49 ms. Allocated memory is still 1.3 GB. Free memory is still 907.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1646]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1331. Possible FailurePath: [L1042] static int init = 1; [L1043] CALL static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1065] EXPR, FCALL malloc(sizeof(SSL)) [L1065] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1069] EXPR, FCALL malloc(sizeof(struct ssl3_state_st)) [L1069] CALL s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1069] RET s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] EXPR, FCALL malloc(sizeof(SSL_CTX)) [L1070] CALL s->ctx = malloc(sizeof(SSL_CTX)) [L1070] RET s->ctx = malloc(sizeof(SSL_CTX)) [L1071] EXPR, FCALL malloc(sizeof(SSL_SESSION)) [L1071] CALL s->session = malloc(sizeof(SSL_SESSION)) [L1071] RET s->session = malloc(sizeof(SSL_SESSION)) [L1072] CALL s->state = 12292 [L1072] RET s->state = 12292 [L1073] CALL s->version = __VERIFIER_nondet_int() [L1073] RET s->version = __VERIFIER_nondet_int() [L1074] CALL ssl3_connect(s) VAL [init=1, SSLv3_client_data={20489:0}] [L1080] BUF_MEM *buf = __VERIFIER_nondet_pointer() ; [L1081] unsigned long tmp ; [L1082] unsigned long l ; [L1083] long num1 ; [L1084] void (*cb)() ; [L1085] int ret ; [L1086] int new_state ; [L1087] int state ; [L1088] int skip ; [L1089] int *tmp___0 = __VERIFIER_nondet_pointer() ; [L1090] int tmp___1 = __VERIFIER_nondet_int() ; [L1091] int tmp___2 = __VERIFIER_nondet_int() ; [L1092] int tmp___3 ; [L1093] int tmp___4 ; [L1094] int tmp___5 ; [L1095] int tmp___6 ; [L1096] int tmp___7 ; [L1097] int tmp___8 ; [L1098] long tmp___9 ; [L1100] int blastFlag ; [L1103] blastFlag = 0 [L1104] CALL s->hit=__VERIFIER_nondet_int () [L1104] RET s->hit=__VERIFIER_nondet_int () [L1105] CALL s->state = 12292 [L1105] RET s->state = 12292 [L1106] tmp = __VERIFIER_nondet_int() [L1107] cb = (void (*)())((void *)0) [L1108] ret = -1 [L1109] skip = 0 [L1110] CALL *tmp___0 = 0 [L1110] RET *tmp___0 = 0 [L1111] CALL, EXPR s->info_callback [L1111] RET, EXPR s->info_callback [L1111] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1112] CALL, EXPR s->info_callback [L1112] RET, EXPR s->info_callback [L1112] cb = s->info_callback [L1120] CALL, EXPR s->in_handshake [L1120] RET, EXPR s->in_handshake [L1120] CALL s->in_handshake += 1 [L1120] RET s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={20489:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={20489:0}] [L1133] CALL, EXPR s->state [L1133] RET, EXPR s->state [L1133] state = s->state [L1134] CALL, EXPR s->state [L1134] RET, EXPR s->state [L1134] COND TRUE s->state == 12292 [L1237] CALL s->new_session = 1 [L1237] RET s->new_session = 1 [L1238] CALL s->state = 4096 [L1238] RET s->state = 4096 [L1239] CALL, EXPR s->ctx [L1239] RET, EXPR s->ctx [L1239] CALL, EXPR (s->ctx)->stats.sess_connect_renegotiate [L1239] RET, EXPR (s->ctx)->stats.sess_connect_renegotiate [L1239] CALL (s->ctx)->stats.sess_connect_renegotiate += 1 [L1239] RET (s->ctx)->stats.sess_connect_renegotiate += 1 [L1244] CALL s->server = 0 [L1244] RET s->server = 0 [L1245] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={20489:0}] [L1250] CALL, EXPR s->version [L1250] RET, EXPR s->version [L1250] COND FALSE !((s->version & 65280) != 768) [L1256] CALL s->type = 4096 [L1256] RET s->type = 4096 [L1257] CALL, EXPR s->init_buf [L1257] RET, EXPR s->init_buf [L1257] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1269] tmp___4 = __VERIFIER_nondet_int() [L1270] COND FALSE !(! tmp___4) [L1276] tmp___5 = __VERIFIER_nondet_int() [L1277] COND FALSE !(! tmp___5) [L1283] CALL s->state = 4368 [L1283] RET s->state = 4368 [L1284] CALL, EXPR s->ctx [L1284] RET, EXPR s->ctx [L1284] CALL, EXPR (s->ctx)->stats.sess_connect [L1284] RET, EXPR (s->ctx)->stats.sess_connect [L1284] CALL (s->ctx)->stats.sess_connect += 1 [L1284] RET (s->ctx)->stats.sess_connect += 1 [L1285] CALL s->init_num = 0 [L1285] RET s->init_num = 0 [L1605] CALL, EXPR s->s3 [L1605] RET, EXPR s->s3 [L1605] CALL, EXPR (s->s3)->tmp.reuse_message [L1605] RET, EXPR (s->s3)->tmp.reuse_message [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={20489:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={20489:0}] [L1133] CALL, EXPR s->state [L1133] RET, EXPR s->state [L1133] state = s->state [L1134] CALL, EXPR s->state [L1134] RET, EXPR s->state [L1134] COND FALSE !(s->state == 12292) [L1137] CALL, EXPR s->state [L1137] RET, EXPR s->state [L1137] COND FALSE !(s->state == 16384) [L1140] CALL, EXPR s->state [L1140] RET, EXPR s->state [L1140] COND FALSE !(s->state == 4096) [L1143] CALL, EXPR s->state [L1143] RET, EXPR s->state [L1143] COND FALSE !(s->state == 20480) [L1146] CALL, EXPR s->state [L1146] RET, EXPR s->state [L1146] COND FALSE !(s->state == 4099) [L1149] CALL, EXPR s->state [L1149] RET, EXPR s->state [L1149] COND TRUE s->state == 4368 [L1289] CALL s->shutdown = 0 [L1289] RET s->shutdown = 0 [L1290] ret = __VERIFIER_nondet_int() [L1291] COND TRUE blastFlag == 0 [L1292] blastFlag = 1 VAL [init=1, SSLv3_client_data={20489:0}] [L1296] COND FALSE !(ret <= 0) [L1301] CALL s->state = 4384 [L1301] RET s->state = 4384 [L1302] CALL s->init_num = 0 [L1302] RET s->init_num = 0 [L1303] CALL, EXPR s->bbio [L1303] RET, EXPR s->bbio [L1303] CALL, EXPR s->wbio [L1303] RET, EXPR s->wbio [L1303] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1605] CALL, EXPR s->s3 [L1605] RET, EXPR s->s3 [L1605] CALL, EXPR (s->s3)->tmp.reuse_message [L1605] RET, EXPR (s->s3)->tmp.reuse_message [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={20489:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={20489:0}] [L1133] CALL, EXPR s->state [L1133] RET, EXPR s->state [L1133] state = s->state [L1134] CALL, EXPR s->state [L1134] RET, EXPR s->state [L1134] COND FALSE !(s->state == 12292) [L1137] CALL, EXPR s->state [L1137] RET, EXPR s->state [L1137] COND FALSE !(s->state == 16384) [L1140] CALL, EXPR s->state [L1140] RET, EXPR s->state [L1140] COND FALSE !(s->state == 4096) [L1143] CALL, EXPR s->state [L1143] RET, EXPR s->state [L1143] COND FALSE !(s->state == 20480) [L1146] CALL, EXPR s->state [L1146] RET, EXPR s->state [L1146] COND FALSE !(s->state == 4099) [L1149] CALL, EXPR s->state [L1149] RET, EXPR s->state [L1149] COND FALSE !(s->state == 4368) [L1152] CALL, EXPR s->state [L1152] RET, EXPR s->state [L1152] COND FALSE !(s->state == 4369) [L1155] CALL, EXPR s->state [L1155] RET, EXPR s->state [L1155] COND TRUE s->state == 4384 [L1311] ret = __VERIFIER_nondet_int() [L1312] COND TRUE blastFlag == 1 [L1313] blastFlag = 2 VAL [init=1, SSLv3_client_data={20489:0}] [L1317] COND FALSE !(ret <= 0) [L1322] CALL s->hit [L1322] RET s->hit [L1322] COND FALSE !(s->hit) [L1325] CALL s->state = 4400 [L1325] RET s->state = 4400 [L1327] CALL s->init_num = 0 [L1327] RET s->init_num = 0 [L1605] CALL, EXPR s->s3 [L1605] RET, EXPR s->s3 [L1605] CALL, EXPR (s->s3)->tmp.reuse_message [L1605] RET, EXPR (s->s3)->tmp.reuse_message [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={20489:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={20489:0}] [L1133] CALL, EXPR s->state [L1133] RET, EXPR s->state [L1133] state = s->state [L1134] CALL, EXPR s->state [L1134] RET, EXPR s->state [L1134] COND FALSE !(s->state == 12292) [L1137] CALL, EXPR s->state [L1137] RET, EXPR s->state [L1137] COND FALSE !(s->state == 16384) [L1140] CALL, EXPR s->state [L1140] RET, EXPR s->state [L1140] COND FALSE !(s->state == 4096) [L1143] CALL, EXPR s->state [L1143] RET, EXPR s->state [L1143] COND FALSE !(s->state == 20480) [L1146] CALL, EXPR s->state [L1146] RET, EXPR s->state [L1146] COND FALSE !(s->state == 4099) [L1149] CALL, EXPR s->state [L1149] RET, EXPR s->state [L1149] COND FALSE !(s->state == 4368) [L1152] CALL, EXPR s->state [L1152] RET, EXPR s->state [L1152] COND FALSE !(s->state == 4369) [L1155] CALL, EXPR s->state [L1155] RET, EXPR s->state [L1155] COND FALSE !(s->state == 4384) [L1158] CALL, EXPR s->state [L1158] RET, EXPR s->state [L1158] COND FALSE !(s->state == 4385) [L1161] CALL, EXPR s->state [L1161] RET, EXPR s->state [L1161] COND TRUE s->state == 4400 [L1331] CALL, EXPR s->s3 [L1331] RET, EXPR s->s3 [L1331] CALL, EXPR (s->s3)->tmp.new_cipher [L1331] RET, EXPR (s->s3)->tmp.new_cipher [L1331] CALL, EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1331] RET, EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1331] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1334] ret = __VERIFIER_nondet_int() [L1335] COND TRUE blastFlag == 2 [L1336] blastFlag = 3 VAL [init=1, SSLv3_client_data={20489:0}] [L1340] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={20489:0}] [L1346] CALL s->state = 4416 [L1346] RET s->state = 4416 [L1347] CALL s->init_num = 0 [L1347] RET s->init_num = 0 [L1605] CALL, EXPR s->s3 [L1605] RET, EXPR s->s3 [L1605] CALL, EXPR (s->s3)->tmp.reuse_message [L1605] RET, EXPR (s->s3)->tmp.reuse_message [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={20489:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={20489:0}] [L1133] CALL, EXPR s->state [L1133] RET, EXPR s->state [L1133] state = s->state [L1134] CALL, EXPR s->state [L1134] RET, EXPR s->state [L1134] COND FALSE !(s->state == 12292) [L1137] CALL, EXPR s->state [L1137] RET, EXPR s->state [L1137] COND FALSE !(s->state == 16384) [L1140] CALL, EXPR s->state [L1140] RET, EXPR s->state [L1140] COND FALSE !(s->state == 4096) [L1143] CALL, EXPR s->state [L1143] RET, EXPR s->state [L1143] COND FALSE !(s->state == 20480) [L1146] CALL, EXPR s->state [L1146] RET, EXPR s->state [L1146] COND FALSE !(s->state == 4099) [L1149] CALL, EXPR s->state [L1149] RET, EXPR s->state [L1149] COND FALSE !(s->state == 4368) [L1152] CALL, EXPR s->state [L1152] RET, EXPR s->state [L1152] COND FALSE !(s->state == 4369) [L1155] CALL, EXPR s->state [L1155] RET, EXPR s->state [L1155] COND FALSE !(s->state == 4384) [L1158] CALL, EXPR s->state [L1158] RET, EXPR s->state [L1158] COND FALSE !(s->state == 4385) [L1161] CALL, EXPR s->state [L1161] RET, EXPR s->state [L1161] COND FALSE !(s->state == 4400) [L1164] CALL, EXPR s->state [L1164] RET, EXPR s->state [L1164] COND FALSE !(s->state == 4401) [L1167] CALL, EXPR s->state [L1167] RET, EXPR s->state [L1167] COND TRUE s->state == 4416 [L1351] ret = __VERIFIER_nondet_int() [L1352] COND TRUE blastFlag == 3 [L1353] blastFlag = 4 VAL [init=1, SSLv3_client_data={20489:0}] [L1357] COND FALSE !(ret <= 0) [L1362] CALL s->state = 4432 [L1362] RET s->state = 4432 [L1363] CALL s->init_num = 0 [L1363] RET s->init_num = 0 [L1364] tmp___6 = __VERIFIER_nondet_int() [L1365] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={20489:0}] [L1605] CALL, EXPR s->s3 [L1605] RET, EXPR s->s3 [L1605] CALL, EXPR (s->s3)->tmp.reuse_message [L1605] RET, EXPR (s->s3)->tmp.reuse_message [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={20489:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={20489:0}] [L1133] CALL, EXPR s->state [L1133] RET, EXPR s->state [L1133] state = s->state [L1134] CALL, EXPR s->state [L1134] RET, EXPR s->state [L1134] COND FALSE !(s->state == 12292) [L1137] CALL, EXPR s->state [L1137] RET, EXPR s->state [L1137] COND FALSE !(s->state == 16384) [L1140] CALL, EXPR s->state [L1140] RET, EXPR s->state [L1140] COND FALSE !(s->state == 4096) [L1143] CALL, EXPR s->state [L1143] RET, EXPR s->state [L1143] COND FALSE !(s->state == 20480) [L1146] CALL, EXPR s->state [L1146] RET, EXPR s->state [L1146] COND FALSE !(s->state == 4099) [L1149] CALL, EXPR s->state [L1149] RET, EXPR s->state [L1149] COND FALSE !(s->state == 4368) [L1152] CALL, EXPR s->state [L1152] RET, EXPR s->state [L1152] COND FALSE !(s->state == 4369) [L1155] CALL, EXPR s->state [L1155] RET, EXPR s->state [L1155] COND FALSE !(s->state == 4384) [L1158] CALL, EXPR s->state [L1158] RET, EXPR s->state [L1158] COND FALSE !(s->state == 4385) [L1161] CALL, EXPR s->state [L1161] RET, EXPR s->state [L1161] COND FALSE !(s->state == 4400) [L1164] CALL, EXPR s->state [L1164] RET, EXPR s->state [L1164] COND FALSE !(s->state == 4401) [L1167] CALL, EXPR s->state [L1167] RET, EXPR s->state [L1167] COND FALSE !(s->state == 4416) [L1170] CALL, EXPR s->state [L1170] RET, EXPR s->state [L1170] COND FALSE !(s->state == 4417) [L1173] CALL, EXPR s->state [L1173] RET, EXPR s->state [L1173] COND TRUE s->state == 4432 [L1374] ret = __VERIFIER_nondet_int() [L1375] COND FALSE !(blastFlag == 5) VAL [init=1, SSLv3_client_data={20489:0}] [L1380] COND FALSE !(ret <= 0) [L1385] CALL s->state = 4448 [L1385] RET s->state = 4448 [L1386] CALL s->init_num = 0 [L1386] RET s->init_num = 0 [L1605] CALL, EXPR s->s3 [L1605] RET, EXPR s->s3 [L1605] CALL, EXPR (s->s3)->tmp.reuse_message [L1605] RET, EXPR (s->s3)->tmp.reuse_message [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={20489:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={20489:0}] [L1133] CALL, EXPR s->state [L1133] RET, EXPR s->state [L1133] state = s->state [L1134] CALL, EXPR s->state [L1134] RET, EXPR s->state [L1134] COND FALSE !(s->state == 12292) [L1137] CALL, EXPR s->state [L1137] RET, EXPR s->state [L1137] COND FALSE !(s->state == 16384) [L1140] CALL, EXPR s->state [L1140] RET, EXPR s->state [L1140] COND FALSE !(s->state == 4096) [L1143] CALL, EXPR s->state [L1143] RET, EXPR s->state [L1143] COND FALSE !(s->state == 20480) [L1146] CALL, EXPR s->state [L1146] RET, EXPR s->state [L1146] COND FALSE !(s->state == 4099) [L1149] CALL, EXPR s->state [L1149] RET, EXPR s->state [L1149] COND FALSE !(s->state == 4368) [L1152] CALL, EXPR s->state [L1152] RET, EXPR s->state [L1152] COND FALSE !(s->state == 4369) [L1155] CALL, EXPR s->state [L1155] RET, EXPR s->state [L1155] COND FALSE !(s->state == 4384) [L1158] CALL, EXPR s->state [L1158] RET, EXPR s->state [L1158] COND FALSE !(s->state == 4385) [L1161] CALL, EXPR s->state [L1161] RET, EXPR s->state [L1161] COND FALSE !(s->state == 4400) [L1164] CALL, EXPR s->state [L1164] RET, EXPR s->state [L1164] COND FALSE !(s->state == 4401) [L1167] CALL, EXPR s->state [L1167] RET, EXPR s->state [L1167] COND FALSE !(s->state == 4416) [L1170] CALL, EXPR s->state [L1170] RET, EXPR s->state [L1170] COND FALSE !(s->state == 4417) [L1173] CALL, EXPR s->state [L1173] RET, EXPR s->state [L1173] COND FALSE !(s->state == 4432) [L1176] CALL, EXPR s->state [L1176] RET, EXPR s->state [L1176] COND FALSE !(s->state == 4433) [L1179] CALL, EXPR s->state [L1179] RET, EXPR s->state [L1179] COND TRUE s->state == 4448 [L1390] ret = __VERIFIER_nondet_int() [L1391] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={20489:0}] [L1646] __VERIFIER_error() VAL [init=1, SSLv3_client_data={20489:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 143 locations, 1 error locations. UNSAFE Result, 18.0s OverallTime, 19 OverallIterations, 7 TraceHistogramMax, 11.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3536 SDtfs, 1776 SDslu, 3915 SDs, 0 SdLazy, 2305 SolverSat, 146 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=990occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 1648 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 2159 NumberOfCodeBlocks, 2159 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1991 ConstructedInterpolants, 0 QuantifiedInterpolants, 452180 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 2589/2589 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-10-26 23:26:08,638 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 23:26:08,640 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 23:26:08,649 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 23:26:08,650 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 23:26:08,651 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 23:26:08,652 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 23:26:08,653 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 23:26:08,655 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 23:26:08,656 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 23:26:08,657 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 23:26:08,657 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 23:26:08,658 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 23:26:08,659 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 23:26:08,660 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 23:26:08,661 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 23:26:08,663 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 23:26:08,664 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 23:26:08,666 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 23:26:08,668 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 23:26:08,669 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 23:26:08,670 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 23:26:08,672 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 23:26:08,673 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 23:26:08,673 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 23:26:08,674 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 23:26:08,678 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 23:26:08,679 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 23:26:08,680 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 23:26:08,681 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 23:26:08,681 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 23:26:08,683 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 23:26:08,683 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 23:26:08,683 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 23:26:08,684 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 23:26:08,685 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 23:26:08,685 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-10-26 23:26:08,708 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 23:26:08,709 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 23:26:08,710 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 23:26:08,710 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 23:26:08,710 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 23:26:08,711 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 23:26:08,711 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 23:26:08,711 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 23:26:08,712 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 23:26:08,712 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 23:26:08,712 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 23:26:08,712 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 23:26:08,712 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 23:26:08,712 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 23:26:08,713 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 23:26:08,713 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-10-26 23:26:08,713 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-10-26 23:26:08,713 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 23:26:08,713 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 23:26:08,713 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 23:26:08,714 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 23:26:08,714 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 23:26:08,716 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 23:26:08,716 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 23:26:08,717 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 23:26:08,717 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 23:26:08,717 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 23:26:08,717 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 23:26:08,717 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-10-26 23:26:08,718 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 23:26:08,718 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-10-26 23:26:08,718 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-10-26 23:26:08,718 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/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 -> 9b2fdeede7b1203b845c20c562beaee69c29ce3b [2018-10-26 23:26:08,760 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 23:26:08,773 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 23:26:08,776 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 23:26:08,778 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 23:26:08,779 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 23:26:08,779 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c [2018-10-26 23:26:08,833 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/data/0b1e11828/3b6f0a5f9ebe4a929545b9eec4835c08/FLAGc49d1c985 [2018-10-26 23:26:09,371 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 23:26:09,372 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c [2018-10-26 23:26:09,391 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/data/0b1e11828/3b6f0a5f9ebe4a929545b9eec4835c08/FLAGc49d1c985 [2018-10-26 23:26:09,412 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/data/0b1e11828/3b6f0a5f9ebe4a929545b9eec4835c08 [2018-10-26 23:26:09,415 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 23:26:09,417 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 23:26:09,418 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 23:26:09,418 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 23:26:09,423 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 23:26:09,424 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:26:09" (1/1) ... [2018-10-26 23:26:09,427 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18c25bd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:26:09, skipping insertion in model container [2018-10-26 23:26:09,427 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:26:09" (1/1) ... [2018-10-26 23:26:09,437 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 23:26:09,527 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 23:26:10,246 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:26:10,261 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 23:26:10,524 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:26:10,557 INFO L193 MainTranslator]: Completed translation [2018-10-26 23:26:10,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:26:10 WrapperNode [2018-10-26 23:26:10,559 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 23:26:10,560 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 23:26:10,560 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 23:26:10,560 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 23:26:10,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:26:10" (1/1) ... [2018-10-26 23:26:10,701 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:26:10" (1/1) ... [2018-10-26 23:26:10,798 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 23:26:10,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 23:26:10,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 23:26:10,798 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 23:26:10,809 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:26:10" (1/1) ... [2018-10-26 23:26:10,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:26:10" (1/1) ... [2018-10-26 23:26:10,837 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:26:10" (1/1) ... [2018-10-26 23:26:10,844 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:26:10" (1/1) ... [2018-10-26 23:26:10,912 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:26:10" (1/1) ... [2018-10-26 23:26:10,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:26:10" (1/1) ... [2018-10-26 23:26:10,941 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:26:10" (1/1) ... [2018-10-26 23:26:10,952 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 23:26:10,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 23:26:10,954 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 23:26:10,954 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 23:26:10,955 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:26:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/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-26 23:26:11,016 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 23:26:11,016 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 23:26:11,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 23:26:11,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 23:26:11,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 23:26:11,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 23:26:11,017 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-10-26 23:26:11,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-10-26 23:26:13,659 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-10-26 23:26:13,659 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-10-26 23:26:15,652 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 23:26:15,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:26:15 BoogieIcfgContainer [2018-10-26 23:26:15,653 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 23:26:15,654 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 23:26:15,654 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 23:26:15,656 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 23:26:15,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 11:26:09" (1/3) ... [2018-10-26 23:26:15,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d1d134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 11:26:15, skipping insertion in model container [2018-10-26 23:26:15,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:26:10" (2/3) ... [2018-10-26 23:26:15,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d1d134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 11:26:15, skipping insertion in model container [2018-10-26 23:26:15,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:26:15" (3/3) ... [2018-10-26 23:26:15,664 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01_false-unreach-call.i.cil.c [2018-10-26 23:26:15,675 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 23:26:15,686 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 23:26:15,704 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 23:26:15,736 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 23:26:15,736 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 23:26:15,737 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 23:26:15,737 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 23:26:15,737 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 23:26:15,737 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 23:26:15,737 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 23:26:15,737 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 23:26:15,737 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 23:26:15,767 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2018-10-26 23:26:15,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-26 23:26:15,778 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:26:15,779 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-26 23:26:15,782 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:26:15,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:26:15,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1265738566, now seen corresponding path program 1 times [2018-10-26 23:26:15,793 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:26:15,794 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 23:26:15,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:26:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:26:15,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:26:16,031 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-26 23:26:16,031 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:26:16,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:26:16,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:26:16,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:26:16,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:26:16,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:26:16,052 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 3 states. [2018-10-26 23:26:16,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:26:16,469 INFO L93 Difference]: Finished difference Result 388 states and 640 transitions. [2018-10-26 23:26:16,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:26:16,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-26 23:26:16,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:26:16,497 INFO L225 Difference]: With dead ends: 388 [2018-10-26 23:26:16,497 INFO L226 Difference]: Without dead ends: 225 [2018-10-26 23:26:16,501 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 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-26 23:26:16,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-26 23:26:16,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-10-26 23:26:16,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-10-26 23:26:16,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 329 transitions. [2018-10-26 23:26:16,588 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 329 transitions. Word has length 31 [2018-10-26 23:26:16,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:26:16,590 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 329 transitions. [2018-10-26 23:26:16,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:26:16,591 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 329 transitions. [2018-10-26 23:26:16,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-26 23:26:16,593 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:26:16,593 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-26 23:26:16,593 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:26:16,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:26:16,594 INFO L82 PathProgramCache]: Analyzing trace with hash -186957446, now seen corresponding path program 1 times [2018-10-26 23:26:16,598 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:26:16,598 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 23:26:16,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:26:16,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:26:16,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:26:16,880 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:26:16,881 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:26:16,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:26:16,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:26:16,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:26:16,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:26:16,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:26:16,889 INFO L87 Difference]: Start difference. First operand 225 states and 329 transitions. Second operand 3 states. [2018-10-26 23:26:17,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:26:17,225 INFO L93 Difference]: Finished difference Result 436 states and 646 transitions. [2018-10-26 23:26:17,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:26:17,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-10-26 23:26:17,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:26:17,228 INFO L225 Difference]: With dead ends: 436 [2018-10-26 23:26:17,228 INFO L226 Difference]: Without dead ends: 328 [2018-10-26 23:26:17,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 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-26 23:26:17,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-26 23:26:17,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-10-26 23:26:17,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-10-26 23:26:17,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 479 transitions. [2018-10-26 23:26:17,266 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 479 transitions. Word has length 47 [2018-10-26 23:26:17,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:26:17,267 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 479 transitions. [2018-10-26 23:26:17,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:26:17,267 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 479 transitions. [2018-10-26 23:26:17,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-26 23:26:17,271 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:26:17,271 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:26:17,271 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:26:17,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:26:17,272 INFO L82 PathProgramCache]: Analyzing trace with hash 435222576, now seen corresponding path program 1 times [2018-10-26 23:26:17,274 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:26:17,274 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 23:26:17,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:26:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:26:17,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:26:17,572 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 23:26:17,578 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:26:17,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:26:17,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:26:17,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:26:17,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:26:17,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:26:17,584 INFO L87 Difference]: Start difference. First operand 328 states and 479 transitions. Second operand 3 states. [2018-10-26 23:26:17,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:26:17,781 INFO L93 Difference]: Finished difference Result 644 states and 949 transitions. [2018-10-26 23:26:17,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:26:17,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-26 23:26:17,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:26:17,785 INFO L225 Difference]: With dead ends: 644 [2018-10-26 23:26:17,785 INFO L226 Difference]: Without dead ends: 433 [2018-10-26 23:26:17,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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-26 23:26:17,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-10-26 23:26:17,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2018-10-26 23:26:17,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-10-26 23:26:17,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 632 transitions. [2018-10-26 23:26:17,815 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 632 transitions. Word has length 66 [2018-10-26 23:26:17,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:26:17,816 INFO L481 AbstractCegarLoop]: Abstraction has 433 states and 632 transitions. [2018-10-26 23:26:17,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:26:17,816 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 632 transitions. [2018-10-26 23:26:17,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-26 23:26:17,821 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:26:17,821 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:26:17,822 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:26:17,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:26:17,823 INFO L82 PathProgramCache]: Analyzing trace with hash -244885070, now seen corresponding path program 1 times [2018-10-26 23:26:17,824 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:26:17,824 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 23:26:17,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:26:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:26:18,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:26:18,199 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-26 23:26:18,199 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:26:18,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:26:18,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:26:18,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:26:18,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:26:18,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:26:18,203 INFO L87 Difference]: Start difference. First operand 433 states and 632 transitions. Second operand 3 states. [2018-10-26 23:26:18,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:26:18,514 INFO L93 Difference]: Finished difference Result 853 states and 1254 transitions. [2018-10-26 23:26:18,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:26:18,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-10-26 23:26:18,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:26:18,517 INFO L225 Difference]: With dead ends: 853 [2018-10-26 23:26:18,518 INFO L226 Difference]: Without dead ends: 537 [2018-10-26 23:26:18,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 85 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-26 23:26:18,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-10-26 23:26:18,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2018-10-26 23:26:18,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-10-26 23:26:18,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 784 transitions. [2018-10-26 23:26:18,541 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 784 transitions. Word has length 87 [2018-10-26 23:26:18,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:26:18,542 INFO L481 AbstractCegarLoop]: Abstraction has 537 states and 784 transitions. [2018-10-26 23:26:18,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:26:18,543 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 784 transitions. [2018-10-26 23:26:18,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-26 23:26:18,548 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:26:18,548 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:26:18,549 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:26:18,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:26:18,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1961911637, now seen corresponding path program 1 times [2018-10-26 23:26:18,551 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:26:18,551 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 23:26:18,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:26:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:26:18,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:26:18,924 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-26 23:26:18,925 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:26:18,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:26:18,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:26:18,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:26:18,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:26:18,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:26:18,928 INFO L87 Difference]: Start difference. First operand 537 states and 784 transitions. Second operand 3 states. [2018-10-26 23:26:19,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:26:19,112 INFO L93 Difference]: Finished difference Result 954 states and 1396 transitions. [2018-10-26 23:26:19,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:26:19,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2018-10-26 23:26:19,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:26:19,116 INFO L225 Difference]: With dead ends: 954 [2018-10-26 23:26:19,116 INFO L226 Difference]: Without dead ends: 534 [2018-10-26 23:26:19,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 107 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-26 23:26:19,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-10-26 23:26:19,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2018-10-26 23:26:19,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2018-10-26 23:26:19,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 774 transitions. [2018-10-26 23:26:19,137 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 774 transitions. Word has length 109 [2018-10-26 23:26:19,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:26:19,137 INFO L481 AbstractCegarLoop]: Abstraction has 534 states and 774 transitions. [2018-10-26 23:26:19,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:26:19,138 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 774 transitions. [2018-10-26 23:26:19,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-26 23:26:19,142 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:26:19,142 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:26:19,143 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:26:19,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:26:19,143 INFO L82 PathProgramCache]: Analyzing trace with hash -234771568, now seen corresponding path program 1 times [2018-10-26 23:26:19,144 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:26:19,144 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 23:26:19,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:26:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:26:20,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:26:20,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 23:26:20,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 23:26:20,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:26:20,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:26:20,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:26:20,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:26:20,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 23:26:20,854 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:26:20,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 23:26:20,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:26:20,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:26:20,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:26:20,883 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:26:20,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 23:26:20,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 23:26:20,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:26:20,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:26:20,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:26:20,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-10-26 23:26:20,960 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-26 23:26:20,960 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:26:20,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:26:20,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:26:20,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:26:20,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:26:20,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:26:20,969 INFO L87 Difference]: Start difference. First operand 534 states and 774 transitions. Second operand 7 states. [2018-10-26 23:26:24,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:26:24,188 INFO L93 Difference]: Finished difference Result 1429 states and 2079 transitions. [2018-10-26 23:26:24,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:26:24,191 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-10-26 23:26:24,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:26:24,197 INFO L225 Difference]: With dead ends: 1429 [2018-10-26 23:26:24,198 INFO L226 Difference]: Without dead ends: 908 [2018-10-26 23:26:24,199 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-10-26 23:26:24,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2018-10-26 23:26:24,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 622. [2018-10-26 23:26:24,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-10-26 23:26:24,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 918 transitions. [2018-10-26 23:26:24,239 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 918 transitions. Word has length 111 [2018-10-26 23:26:24,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:26:24,248 INFO L481 AbstractCegarLoop]: Abstraction has 622 states and 918 transitions. [2018-10-26 23:26:24,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:26:24,249 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 918 transitions. [2018-10-26 23:26:24,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-26 23:26:24,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:26:24,251 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:26:24,252 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:26:24,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:26:24,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1673686222, now seen corresponding path program 1 times [2018-10-26 23:26:24,253 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:26:24,253 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 23:26:24,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:26:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:26:25,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:26:25,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 23:26:25,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 23:26:25,842 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:26:25,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 23:26:25,846 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:26:25,854 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:26:25,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:26:25,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:26:25,874 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:26:26,148 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-26 23:26:26,148 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (8)] Exception during sending of exit command (exit): Broken pipe [2018-10-26 23:26:26,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:26:26,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:26:26,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:26:26,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:26:26,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:26:26,161 INFO L87 Difference]: Start difference. First operand 622 states and 918 transitions. Second operand 7 states. [2018-10-26 23:26:30,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:26:30,340 INFO L93 Difference]: Finished difference Result 1441 states and 2120 transitions. [2018-10-26 23:26:30,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:26:30,342 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-10-26 23:26:30,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:26:30,345 INFO L225 Difference]: With dead ends: 1441 [2018-10-26 23:26:30,345 INFO L226 Difference]: Without dead ends: 832 [2018-10-26 23:26:30,348 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-26 23:26:30,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2018-10-26 23:26:30,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 722. [2018-10-26 23:26:30,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2018-10-26 23:26:30,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1090 transitions. [2018-10-26 23:26:30,381 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1090 transitions. Word has length 111 [2018-10-26 23:26:30,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:26:30,382 INFO L481 AbstractCegarLoop]: Abstraction has 722 states and 1090 transitions. [2018-10-26 23:26:30,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:26:30,383 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1090 transitions. [2018-10-26 23:26:30,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-26 23:26:30,385 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:26:30,386 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:26:30,386 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:26:30,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:26:30,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1350240351, now seen corresponding path program 1 times [2018-10-26 23:26:30,387 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:26:30,387 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 23:26:30,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:26:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:26:32,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:26:33,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 23:26:33,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 23:26:33,110 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:26:33,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 23:26:33,136 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:26:33,235 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:26:33,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:26:33,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:26:33,407 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:26:33,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 23:26:33,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 23:26:33,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:26:33,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:26:33,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:26:33,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-10-26 23:26:33,719 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 85 proven. 4 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-26 23:26:33,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:26:33,755 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 23:26:33,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:26:33,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:26:33,757 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-10-26 23:26:33,773 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-26 23:26:33,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:26:33,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 23:26:33,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 23:26:33,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 23:26:33,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 23:26:33,782 INFO L87 Difference]: Start difference. First operand 722 states and 1090 transitions. Second operand 9 states. [2018-10-26 23:26:38,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:26:38,149 INFO L93 Difference]: Finished difference Result 2007 states and 2971 transitions. [2018-10-26 23:26:38,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 23:26:38,155 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 127 [2018-10-26 23:26:38,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:26:38,160 INFO L225 Difference]: With dead ends: 2007 [2018-10-26 23:26:38,162 INFO L226 Difference]: Without dead ends: 1298 [2018-10-26 23:26:38,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-10-26 23:26:38,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2018-10-26 23:26:38,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 797. [2018-10-26 23:26:38,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-10-26 23:26:38,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1182 transitions. [2018-10-26 23:26:38,211 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1182 transitions. Word has length 127 [2018-10-26 23:26:38,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:26:38,212 INFO L481 AbstractCegarLoop]: Abstraction has 797 states and 1182 transitions. [2018-10-26 23:26:38,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 23:26:38,212 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1182 transitions. [2018-10-26 23:26:38,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-26 23:26:38,215 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:26:38,216 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:26:38,216 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:26:38,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:26:38,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1230758851, now seen corresponding path program 1 times [2018-10-26 23:26:38,219 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:26:38,219 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 23:26:38,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:26:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:26:40,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:26:40,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 23:26:40,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 23:26:40,090 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:26:40,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 23:26:40,099 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:26:40,107 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:26:40,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:26:40,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:26:40,129 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:26:40,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 23:26:40,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 23:26:40,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:26:40,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:26:40,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:26:40,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-10-26 23:26:40,186 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 90 proven. 4 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-26 23:26:40,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:26:40,317 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 23:26:40,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:26:40,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:26:40,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-10-26 23:26:40,395 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-26 23:26:40,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:26:40,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 23:26:40,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 23:26:40,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 23:26:40,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 23:26:40,402 INFO L87 Difference]: Start difference. First operand 797 states and 1182 transitions. Second operand 9 states. [2018-10-26 23:26:46,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:26:46,512 INFO L93 Difference]: Finished difference Result 2087 states and 3056 transitions. [2018-10-26 23:26:46,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 23:26:46,515 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 127 [2018-10-26 23:26:46,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:26:46,521 INFO L225 Difference]: With dead ends: 2087 [2018-10-26 23:26:46,521 INFO L226 Difference]: Without dead ends: 1303 [2018-10-26 23:26:46,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-10-26 23:26:46,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states. [2018-10-26 23:26:46,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 806. [2018-10-26 23:26:46,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2018-10-26 23:26:46,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1184 transitions. [2018-10-26 23:26:46,575 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1184 transitions. Word has length 127 [2018-10-26 23:26:46,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:26:46,576 INFO L481 AbstractCegarLoop]: Abstraction has 806 states and 1184 transitions. [2018-10-26 23:26:46,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 23:26:46,576 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1184 transitions. [2018-10-26 23:26:46,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-26 23:26:46,578 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:26:46,579 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:26:46,579 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:26:46,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:26:46,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1063738688, now seen corresponding path program 1 times [2018-10-26 23:26:46,580 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:26:46,580 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 23:26:46,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:26:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:26:48,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:26:48,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 23:26:48,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 23:26:48,241 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:26:48,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 23:26:48,243 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:26:48,251 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:26:48,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:26:48,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:26:48,268 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:26:48,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 23:26:48,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 23:26:48,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:26:48,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:26:48,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:26:48,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-10-26 23:26:48,338 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 114 proven. 4 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-26 23:26:48,338 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:26:48,423 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 23:26:48,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:26:48,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:26:48,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-10-26 23:26:48,434 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-26 23:26:48,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:26:48,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 23:26:48,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 23:26:48,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 23:26:48,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 23:26:48,440 INFO L87 Difference]: Start difference. First operand 806 states and 1184 transitions. Second operand 9 states. [2018-10-26 23:26:54,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:26:54,723 INFO L93 Difference]: Finished difference Result 1992 states and 2885 transitions. [2018-10-26 23:26:54,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 23:26:54,724 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 127 [2018-10-26 23:26:54,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:26:54,729 INFO L225 Difference]: With dead ends: 1992 [2018-10-26 23:26:54,729 INFO L226 Difference]: Without dead ends: 1368 [2018-10-26 23:26:54,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-10-26 23:26:54,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2018-10-26 23:26:54,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 891. [2018-10-26 23:26:54,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2018-10-26 23:26:54,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1301 transitions. [2018-10-26 23:26:54,786 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1301 transitions. Word has length 127 [2018-10-26 23:26:54,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:26:54,787 INFO L481 AbstractCegarLoop]: Abstraction has 891 states and 1301 transitions. [2018-10-26 23:26:54,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 23:26:54,787 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1301 transitions. [2018-10-26 23:26:54,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-26 23:26:54,790 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:26:54,791 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:26:54,791 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:26:54,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:26:54,792 INFO L82 PathProgramCache]: Analyzing trace with hash 380620777, now seen corresponding path program 1 times [2018-10-26 23:26:54,792 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:26:54,792 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 23:26:54,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:26:56,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:26:56,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:26:56,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 23:26:56,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 23:26:56,669 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:26:56,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 23:26:56,692 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:26:56,791 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:26:56,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:26:56,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:26:56,846 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:26:56,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 23:26:56,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 23:26:56,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:26:56,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:26:56,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:26:56,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-10-26 23:26:57,079 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 96 proven. 4 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-10-26 23:26:57,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:26:57,132 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 23:26:57,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:26:57,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:26:57,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-10-26 23:26:57,178 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-10-26 23:26:57,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:26:57,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 23:26:57,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 23:26:57,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 23:26:57,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 23:26:57,183 INFO L87 Difference]: Start difference. First operand 891 states and 1301 transitions. Second operand 9 states. [2018-10-26 23:27:03,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:27:03,160 INFO L93 Difference]: Finished difference Result 2262 states and 3274 transitions. [2018-10-26 23:27:03,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 23:27:03,161 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 129 [2018-10-26 23:27:03,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:27:03,166 INFO L225 Difference]: With dead ends: 2262 [2018-10-26 23:27:03,167 INFO L226 Difference]: Without dead ends: 1388 [2018-10-26 23:27:03,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-10-26 23:27:03,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2018-10-26 23:27:03,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 896. [2018-10-26 23:27:03,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-10-26 23:27:03,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1293 transitions. [2018-10-26 23:27:03,228 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1293 transitions. Word has length 129 [2018-10-26 23:27:03,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:27:03,228 INFO L481 AbstractCegarLoop]: Abstraction has 896 states and 1293 transitions. [2018-10-26 23:27:03,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 23:27:03,228 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1293 transitions. [2018-10-26 23:27:03,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-26 23:27:03,232 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:27:03,232 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:27:03,232 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:27:03,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:27:03,232 INFO L82 PathProgramCache]: Analyzing trace with hash 402636198, now seen corresponding path program 1 times [2018-10-26 23:27:03,233 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:27:03,233 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 23:27:03,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:27:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:04,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:27:04,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 23:27:04,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 23:27:04,975 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:27:04,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 23:27:04,978 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:27:04,986 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:04,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:05,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:05,003 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:27:05,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 23:27:05,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 23:27:05,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:27:05,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:05,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:05,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-10-26 23:27:05,048 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 120 proven. 4 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-10-26 23:27:05,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:27:05,094 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 23:27:05,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:27:05,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:05,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-10-26 23:27:05,112 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-10-26 23:27:05,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:27:05,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 23:27:05,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 23:27:05,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 23:27:05,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 23:27:05,117 INFO L87 Difference]: Start difference. First operand 896 states and 1293 transitions. Second operand 9 states. [2018-10-26 23:27:08,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:27:08,572 INFO L93 Difference]: Finished difference Result 2044 states and 2927 transitions. [2018-10-26 23:27:08,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 23:27:08,573 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 129 [2018-10-26 23:27:08,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:27:08,576 INFO L225 Difference]: With dead ends: 2044 [2018-10-26 23:27:08,577 INFO L226 Difference]: Without dead ends: 1348 [2018-10-26 23:27:08,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-10-26 23:27:08,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2018-10-26 23:27:08,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 901. [2018-10-26 23:27:08,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2018-10-26 23:27:08,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1290 transitions. [2018-10-26 23:27:08,639 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1290 transitions. Word has length 129 [2018-10-26 23:27:08,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:27:08,640 INFO L481 AbstractCegarLoop]: Abstraction has 901 states and 1290 transitions. [2018-10-26 23:27:08,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 23:27:08,640 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1290 transitions. [2018-10-26 23:27:08,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-26 23:27:08,644 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:27:08,644 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:27:08,644 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:27:08,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:27:08,644 INFO L82 PathProgramCache]: Analyzing trace with hash -846982255, now seen corresponding path program 1 times [2018-10-26 23:27:08,645 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:27:08,645 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 23:27:08,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:27:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:10,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:27:11,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 23:27:11,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 23:27:11,138 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:27:11,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 23:27:11,164 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:27:11,267 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:11,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:11,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:11,438 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:27:11,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 23:27:11,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 23:27:11,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:27:11,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:11,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:11,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-10-26 23:27:11,657 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 122 proven. 4 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-10-26 23:27:11,658 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:27:11,687 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 23:27:11,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:27:11,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:11,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-10-26 23:27:11,741 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-10-26 23:27:11,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:27:11,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 23:27:11,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 23:27:11,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 23:27:11,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 23:27:11,747 INFO L87 Difference]: Start difference. First operand 901 states and 1290 transitions. Second operand 9 states. [2018-10-26 23:27:15,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:27:15,597 INFO L93 Difference]: Finished difference Result 2266 states and 3231 transitions. [2018-10-26 23:27:15,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 23:27:15,598 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 145 [2018-10-26 23:27:15,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:27:15,602 INFO L225 Difference]: With dead ends: 2266 [2018-10-26 23:27:15,602 INFO L226 Difference]: Without dead ends: 1382 [2018-10-26 23:27:15,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-10-26 23:27:15,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2018-10-26 23:27:15,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 906. [2018-10-26 23:27:15,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2018-10-26 23:27:15,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1282 transitions. [2018-10-26 23:27:15,669 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1282 transitions. Word has length 145 [2018-10-26 23:27:15,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:27:15,669 INFO L481 AbstractCegarLoop]: Abstraction has 906 states and 1282 transitions. [2018-10-26 23:27:15,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 23:27:15,670 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1282 transitions. [2018-10-26 23:27:15,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-26 23:27:15,674 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:27:15,674 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:27:15,674 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:27:15,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:27:15,675 INFO L82 PathProgramCache]: Analyzing trace with hash -18715699, now seen corresponding path program 1 times [2018-10-26 23:27:15,675 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:27:15,675 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 23:27:15,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:27:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:17,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:27:17,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 23:27:17,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 23:27:17,756 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:27:17,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 23:27:17,758 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:27:17,766 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:17,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:17,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:17,782 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:27:17,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 23:27:17,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 23:27:17,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:27:17,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:17,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:17,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-10-26 23:27:17,831 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 143 proven. 2 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-10-26 23:27:17,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:27:17,903 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 23:27:17,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:27:17,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:17,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-10-26 23:27:17,921 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-10-26 23:27:17,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:27:17,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 23:27:17,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 23:27:17,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 23:27:17,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 23:27:17,929 INFO L87 Difference]: Start difference. First operand 906 states and 1282 transitions. Second operand 9 states. [2018-10-26 23:27:22,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:27:22,230 INFO L93 Difference]: Finished difference Result 2343 states and 3301 transitions. [2018-10-26 23:27:22,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 23:27:22,231 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 146 [2018-10-26 23:27:22,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:27:22,235 INFO L225 Difference]: With dead ends: 2343 [2018-10-26 23:27:22,235 INFO L226 Difference]: Without dead ends: 1454 [2018-10-26 23:27:22,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-10-26 23:27:22,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2018-10-26 23:27:22,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 924. [2018-10-26 23:27:22,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 924 states. [2018-10-26 23:27:22,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1313 transitions. [2018-10-26 23:27:22,301 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1313 transitions. Word has length 146 [2018-10-26 23:27:22,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:27:22,301 INFO L481 AbstractCegarLoop]: Abstraction has 924 states and 1313 transitions. [2018-10-26 23:27:22,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 23:27:22,301 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1313 transitions. [2018-10-26 23:27:22,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-26 23:27:22,306 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:27:22,306 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:27:22,306 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:27:22,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:27:22,306 INFO L82 PathProgramCache]: Analyzing trace with hash 219718465, now seen corresponding path program 1 times [2018-10-26 23:27:22,307 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:27:22,307 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 23:27:22,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:27:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:24,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:27:24,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 23:27:24,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 23:27:24,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:27:24,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:24,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:24,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-26 23:27:24,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 23:27:24,473 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:27:24,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 23:27:24,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:27:24,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:24,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:24,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:27:24,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 23:27:24,524 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:27:24,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 23:27:24,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:27:24,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:24,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:24,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:27:24,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-26 23:27:24,623 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:27:24,651 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:27:24,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 41 [2018-10-26 23:27:24,671 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:27:24,672 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:27:24,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 62 [2018-10-26 23:27:24,677 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:27:24,692 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:24,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:24,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:24,714 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:22 [2018-10-26 23:27:24,752 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:27:24,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 44 [2018-10-26 23:27:24,765 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:27:24,767 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:27:24,771 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:27:24,773 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:27:24,777 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:27:24,806 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 87 [2018-10-26 23:27:25,113 WARN L179 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 59 [2018-10-26 23:27:25,118 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:27:25,119 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:27:25,120 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:27:25,121 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:27:25,123 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:27:25,125 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:27:25,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 95 [2018-10-26 23:27:25,128 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:27:25,230 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:27:25,231 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:27:25,234 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:27:25,235 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:27:25,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 70 [2018-10-26 23:27:25,241 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 23:27:25,276 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:25,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:25,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:25,298 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:40, output treesize:24 [2018-10-26 23:27:25,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-10-26 23:27:25,327 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:27:25,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-10-26 23:27:25,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:27:25,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:25,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:25,336 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-10-26 23:27:25,391 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 202 proven. 15 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-26 23:27:25,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:27:25,945 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 172 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-26 23:27:25,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:27:25,951 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 23:27:25,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:27:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:26,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:27:26,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 23:27:26,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 23:27:26,312 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:27:26,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 23:27:26,316 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:27:26,329 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:26,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:26,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:26,405 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:18, output treesize:9 [2018-10-26 23:27:26,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 23:27:26,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 23:27:26,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:27:26,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:26,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:26,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-10-26 23:27:26,612 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-10-26 23:27:26,612 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:27:26,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-26 23:27:26,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10, 5] total 14 [2018-10-26 23:27:26,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 23:27:26,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 23:27:26,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-10-26 23:27:26,638 INFO L87 Difference]: Start difference. First operand 924 states and 1313 transitions. Second operand 14 states. [2018-10-26 23:27:38,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:27:38,051 INFO L93 Difference]: Finished difference Result 3174 states and 4474 transitions. [2018-10-26 23:27:38,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-26 23:27:38,053 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 146 [2018-10-26 23:27:38,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:27:38,061 INFO L225 Difference]: With dead ends: 3174 [2018-10-26 23:27:38,061 INFO L226 Difference]: Without dead ends: 2267 [2018-10-26 23:27:38,064 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 425 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2018-10-26 23:27:38,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2267 states. [2018-10-26 23:27:38,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2267 to 1567. [2018-10-26 23:27:38,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2018-10-26 23:27:38,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2245 transitions. [2018-10-26 23:27:38,184 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2245 transitions. Word has length 146 [2018-10-26 23:27:38,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:27:38,185 INFO L481 AbstractCegarLoop]: Abstraction has 1567 states and 2245 transitions. [2018-10-26 23:27:38,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-26 23:27:38,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2245 transitions. [2018-10-26 23:27:38,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-26 23:27:38,191 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:27:38,191 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:27:38,191 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:27:38,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:27:38,191 INFO L82 PathProgramCache]: Analyzing trace with hash 726456510, now seen corresponding path program 1 times [2018-10-26 23:27:38,192 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:27:38,192 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/cvc4nyu Starting monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 23:27:38,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:27:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:40,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:27:40,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 23:27:40,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 23:27:40,558 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:27:40,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 23:27:40,561 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:27:40,568 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:40,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:40,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:40,585 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:27:40,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 23:27:40,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 23:27:40,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:27:40,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:40,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:40,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-10-26 23:27:40,637 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 127 proven. 4 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-10-26 23:27:40,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:27:40,700 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 23:27:40,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:27:40,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:40,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-10-26 23:27:40,715 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-10-26 23:27:40,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:27:40,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 23:27:40,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 23:27:40,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 23:27:40,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 23:27:40,720 INFO L87 Difference]: Start difference. First operand 1567 states and 2245 transitions. Second operand 9 states. [2018-10-26 23:27:44,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:27:44,467 INFO L93 Difference]: Finished difference Result 3875 states and 5520 transitions. [2018-10-26 23:27:44,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 23:27:44,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 146 [2018-10-26 23:27:44,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:27:44,475 INFO L225 Difference]: With dead ends: 3875 [2018-10-26 23:27:44,475 INFO L226 Difference]: Without dead ends: 2325 [2018-10-26 23:27:44,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-10-26 23:27:44,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2018-10-26 23:27:44,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 1567. [2018-10-26 23:27:44,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2018-10-26 23:27:44,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2218 transitions. [2018-10-26 23:27:44,609 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2218 transitions. Word has length 146 [2018-10-26 23:27:44,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:27:44,610 INFO L481 AbstractCegarLoop]: Abstraction has 1567 states and 2218 transitions. [2018-10-26 23:27:44,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 23:27:44,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2218 transitions. [2018-10-26 23:27:44,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-26 23:27:44,616 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:27:44,617 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:27:44,618 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:27:44,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:27:44,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1822601610, now seen corresponding path program 1 times [2018-10-26 23:27:44,619 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:27:44,619 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 23:27:44,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:27:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:46,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:27:46,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 23:27:46,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 23:27:46,764 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:27:46,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 23:27:46,768 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:27:46,775 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:46,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:46,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:46,791 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:27:46,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 23:27:46,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 23:27:46,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:27:46,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:46,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:46,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-10-26 23:27:46,833 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 142 proven. 2 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-10-26 23:27:46,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:27:46,860 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 23:27:46,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:27:46,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:46,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-10-26 23:27:46,980 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-10-26 23:27:46,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:27:46,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 23:27:46,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 23:27:46,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 23:27:46,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 23:27:46,987 INFO L87 Difference]: Start difference. First operand 1567 states and 2218 transitions. Second operand 9 states. [2018-10-26 23:27:50,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:27:50,546 INFO L93 Difference]: Finished difference Result 3847 states and 5435 transitions. [2018-10-26 23:27:50,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 23:27:50,551 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 147 [2018-10-26 23:27:50,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:27:50,558 INFO L225 Difference]: With dead ends: 3847 [2018-10-26 23:27:50,559 INFO L226 Difference]: Without dead ends: 2297 [2018-10-26 23:27:50,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-10-26 23:27:50,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2297 states. [2018-10-26 23:27:50,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2297 to 1575. [2018-10-26 23:27:50,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2018-10-26 23:27:50,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2212 transitions. [2018-10-26 23:27:50,668 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2212 transitions. Word has length 147 [2018-10-26 23:27:50,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:27:50,669 INFO L481 AbstractCegarLoop]: Abstraction has 1575 states and 2212 transitions. [2018-10-26 23:27:50,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 23:27:50,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2212 transitions. [2018-10-26 23:27:50,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-26 23:27:50,675 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:27:50,675 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:27:50,675 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:27:50,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:27:50,676 INFO L82 PathProgramCache]: Analyzing trace with hash -462174688, now seen corresponding path program 1 times [2018-10-26 23:27:50,677 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:27:50,677 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/cvc4nyu Starting monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 23:27:50,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:27:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:52,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:27:52,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 23:27:52,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 23:27:52,863 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:27:52,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 23:27:52,866 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:27:52,873 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:52,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:52,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:52,890 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:27:52,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 23:27:52,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 23:27:52,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:27:52,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:52,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:52,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-10-26 23:27:53,007 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 146 proven. 1 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-10-26 23:27:53,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:27:53,034 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 23:27:53,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:27:53,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:27:53,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-10-26 23:27:53,057 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-10-26 23:27:53,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:27:53,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 23:27:53,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 23:27:53,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 23:27:53,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 23:27:53,063 INFO L87 Difference]: Start difference. First operand 1575 states and 2212 transitions. Second operand 9 states. [2018-10-26 23:27:56,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:27:56,689 INFO L93 Difference]: Finished difference Result 3784 states and 5322 transitions. [2018-10-26 23:27:56,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 23:27:56,691 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 147 [2018-10-26 23:27:56,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:27:56,696 INFO L225 Difference]: With dead ends: 3784 [2018-10-26 23:27:56,696 INFO L226 Difference]: Without dead ends: 2226 [2018-10-26 23:27:56,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-10-26 23:27:56,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2226 states. [2018-10-26 23:27:56,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2226 to 1589. [2018-10-26 23:27:56,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1589 states. [2018-10-26 23:27:56,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2222 transitions. [2018-10-26 23:27:56,815 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2222 transitions. Word has length 147 [2018-10-26 23:27:56,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:27:56,815 INFO L481 AbstractCegarLoop]: Abstraction has 1589 states and 2222 transitions. [2018-10-26 23:27:56,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 23:27:56,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2222 transitions. [2018-10-26 23:27:56,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-26 23:27:56,818 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:27:56,821 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:27:56,821 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:27:56,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:27:56,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1269980539, now seen corresponding path program 1 times [2018-10-26 23:27:56,822 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:27:56,823 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 23:27:56,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:28:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 23:28:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 23:28:06,285 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-26 23:28:06,321 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 23:28:06,322 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 23:28:06,323 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 23:28:06,323 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 23:28:06,324 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 23:28:06,324 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 23:28:06,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 11:28:06 BoogieIcfgContainer [2018-10-26 23:28:06,405 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 23:28:06,406 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 23:28:06,406 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 23:28:06,406 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 23:28:06,409 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:26:15" (3/4) ... [2018-10-26 23:28:06,412 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 23:28:06,417 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 23:28:06,417 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 23:28:06,418 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 23:28:06,418 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 23:28:06,420 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 23:28:06,421 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 23:28:06,547 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7c471cf4-57b8-4f6e-b092-a32846bd8020/bin-2019/utaipan/witness.graphml [2018-10-26 23:28:06,547 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 23:28:06,548 INFO L168 Benchmark]: Toolchain (without parser) took 117131.96 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 432.0 MB). Free memory was 946.5 MB in the beginning and 1.3 GB in the end (delta: -318.0 MB). Peak memory consumption was 114.0 MB. Max. memory is 11.5 GB. [2018-10-26 23:28:06,549 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 23:28:06,549 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1141.17 ms. Allocated memory is still 1.0 GB. Free memory was 946.5 MB in the beginning and 769.4 MB in the end (delta: 177.2 MB). Peak memory consumption was 177.2 MB. Max. memory is 11.5 GB. [2018-10-26 23:28:06,549 INFO L168 Benchmark]: Boogie Procedure Inliner took 237.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.9 MB). Free memory was 769.4 MB in the beginning and 1.2 GB in the end (delta: -398.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2018-10-26 23:28:06,549 INFO L168 Benchmark]: Boogie Preprocessor took 155.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.8 MB). Peak memory consumption was 5.8 MB. Max. memory is 11.5 GB. [2018-10-26 23:28:06,550 INFO L168 Benchmark]: RCFGBuilder took 4698.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 992.9 MB in the end (delta: 169.2 MB). Peak memory consumption was 169.2 MB. Max. memory is 11.5 GB. [2018-10-26 23:28:06,550 INFO L168 Benchmark]: TraceAbstraction took 110751.81 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 251.1 MB). Free memory was 992.9 MB in the beginning and 1.3 GB in the end (delta: -282.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 23:28:06,554 INFO L168 Benchmark]: Witness Printer took 141.59 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. [2018-10-26 23:28:06,556 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1141.17 ms. Allocated memory is still 1.0 GB. Free memory was 946.5 MB in the beginning and 769.4 MB in the end (delta: 177.2 MB). Peak memory consumption was 177.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 237.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.9 MB). Free memory was 769.4 MB in the beginning and 1.2 GB in the end (delta: -398.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 155.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.8 MB). Peak memory consumption was 5.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4698.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 992.9 MB in the end (delta: 169.2 MB). Peak memory consumption was 169.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 110751.81 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 251.1 MB). Free memory was 992.9 MB in the beginning and 1.3 GB in the end (delta: -282.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 141.59 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1646]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1042] static int init = 1; [L1043] CALL static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1065] EXPR, FCALL malloc(sizeof(SSL)) [L1065] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1069] EXPR, FCALL malloc(sizeof(struct ssl3_state_st)) [L1069] CALL s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1069] RET s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] EXPR, FCALL malloc(sizeof(SSL_CTX)) [L1070] CALL s->ctx = malloc(sizeof(SSL_CTX)) [L1070] RET s->ctx = malloc(sizeof(SSL_CTX)) [L1071] EXPR, FCALL malloc(sizeof(SSL_SESSION)) [L1071] CALL s->session = malloc(sizeof(SSL_SESSION)) [L1071] RET s->session = malloc(sizeof(SSL_SESSION)) [L1072] CALL s->state = 12292 [L1072] RET s->state = 12292 [L1073] CALL s->version = __VERIFIER_nondet_int() [L1073] RET s->version = __VERIFIER_nondet_int() [L1074] CALL ssl3_connect(s) VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1080] BUF_MEM *buf = __VERIFIER_nondet_pointer() ; [L1081] unsigned long tmp ; [L1082] unsigned long l ; [L1083] long num1 ; [L1084] void (*cb)() ; [L1085] int ret ; [L1086] int new_state ; [L1087] int state ; [L1088] int skip ; [L1089] int *tmp___0 = __VERIFIER_nondet_pointer() ; [L1090] int tmp___1 = __VERIFIER_nondet_int() ; [L1091] int tmp___2 = __VERIFIER_nondet_int() ; [L1092] int tmp___3 ; [L1093] int tmp___4 ; [L1094] int tmp___5 ; [L1095] int tmp___6 ; [L1096] int tmp___7 ; [L1097] int tmp___8 ; [L1098] long tmp___9 ; [L1100] int blastFlag ; [L1103] blastFlag = 0 [L1104] CALL s->hit=__VERIFIER_nondet_int () [L1104] RET s->hit=__VERIFIER_nondet_int () [L1105] CALL s->state = 12292 [L1105] RET s->state = 12292 [L1106] tmp = __VERIFIER_nondet_int() [L1107] cb = (void (*)())((void *)0) [L1108] ret = -1 [L1109] skip = 0 [L1110] CALL *tmp___0 = 0 [L1110] RET *tmp___0 = 0 [L1111] CALL, EXPR s->info_callback [L1111] RET, EXPR s->info_callback [L1111] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1112] CALL, EXPR s->info_callback [L1112] RET, EXPR s->info_callback [L1112] cb = s->info_callback [L1120] CALL, EXPR s->in_handshake [L1120] RET, EXPR s->in_handshake [L1120] CALL s->in_handshake += 1 [L1120] RET s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1133] CALL, EXPR s->state [L1133] RET, EXPR s->state [L1133] state = s->state [L1134] CALL, EXPR s->state [L1134] RET, EXPR s->state [L1134] COND TRUE s->state == 12292 [L1237] CALL s->new_session = 1 [L1237] RET s->new_session = 1 [L1238] CALL s->state = 4096 [L1238] RET s->state = 4096 [L1239] CALL, EXPR s->ctx [L1239] RET, EXPR s->ctx [L1239] CALL, EXPR (s->ctx)->stats.sess_connect_renegotiate [L1239] RET, EXPR (s->ctx)->stats.sess_connect_renegotiate [L1239] CALL (s->ctx)->stats.sess_connect_renegotiate += 1 [L1239] RET (s->ctx)->stats.sess_connect_renegotiate += 1 [L1244] CALL s->server = 0 [L1244] RET s->server = 0 [L1245] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1250] CALL, EXPR s->version [L1250] RET, EXPR s->version [L1250] COND FALSE !((s->version & 65280) != 768) [L1256] CALL s->type = 4096 [L1256] RET s->type = 4096 [L1257] CALL, EXPR s->init_buf [L1257] RET, EXPR s->init_buf [L1257] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1269] tmp___4 = __VERIFIER_nondet_int() [L1270] COND FALSE !(! tmp___4) [L1276] tmp___5 = __VERIFIER_nondet_int() [L1277] COND FALSE !(! tmp___5) [L1283] CALL s->state = 4368 [L1283] RET s->state = 4368 [L1284] CALL, EXPR s->ctx [L1284] RET, EXPR s->ctx [L1284] CALL, EXPR (s->ctx)->stats.sess_connect [L1284] RET, EXPR (s->ctx)->stats.sess_connect [L1284] CALL (s->ctx)->stats.sess_connect += 1 [L1284] RET (s->ctx)->stats.sess_connect += 1 [L1285] CALL s->init_num = 0 [L1285] RET s->init_num = 0 [L1605] CALL, EXPR s->s3 [L1605] RET, EXPR s->s3 [L1605] CALL, EXPR (s->s3)->tmp.reuse_message [L1605] RET, EXPR (s->s3)->tmp.reuse_message [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1133] CALL, EXPR s->state [L1133] RET, EXPR s->state [L1133] state = s->state [L1134] CALL, EXPR s->state [L1134] RET, EXPR s->state [L1134] COND FALSE !(s->state == 12292) [L1137] CALL, EXPR s->state [L1137] RET, EXPR s->state [L1137] COND FALSE !(s->state == 16384) [L1140] CALL, EXPR s->state [L1140] RET, EXPR s->state [L1140] COND FALSE !(s->state == 4096) [L1143] CALL, EXPR s->state [L1143] RET, EXPR s->state [L1143] COND FALSE !(s->state == 20480) [L1146] CALL, EXPR s->state [L1146] RET, EXPR s->state [L1146] COND FALSE !(s->state == 4099) [L1149] CALL, EXPR s->state [L1149] RET, EXPR s->state [L1149] COND TRUE s->state == 4368 [L1289] CALL s->shutdown = 0 [L1289] RET s->shutdown = 0 [L1290] ret = __VERIFIER_nondet_int() [L1291] COND TRUE blastFlag == 0 [L1292] blastFlag = 1 VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1296] COND FALSE !(ret <= 0) [L1301] CALL s->state = 4384 [L1301] RET s->state = 4384 [L1302] CALL s->init_num = 0 [L1302] RET s->init_num = 0 [L1303] CALL, EXPR s->bbio [L1303] RET, EXPR s->bbio [L1303] CALL, EXPR s->wbio [L1303] RET, EXPR s->wbio [L1303] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1605] CALL, EXPR s->s3 [L1605] RET, EXPR s->s3 [L1605] CALL, EXPR (s->s3)->tmp.reuse_message [L1605] RET, EXPR (s->s3)->tmp.reuse_message [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1133] CALL, EXPR s->state [L1133] RET, EXPR s->state [L1133] state = s->state [L1134] CALL, EXPR s->state [L1134] RET, EXPR s->state [L1134] COND FALSE !(s->state == 12292) [L1137] CALL, EXPR s->state [L1137] RET, EXPR s->state [L1137] COND FALSE !(s->state == 16384) [L1140] CALL, EXPR s->state [L1140] RET, EXPR s->state [L1140] COND FALSE !(s->state == 4096) [L1143] CALL, EXPR s->state [L1143] RET, EXPR s->state [L1143] COND FALSE !(s->state == 20480) [L1146] CALL, EXPR s->state [L1146] RET, EXPR s->state [L1146] COND FALSE !(s->state == 4099) [L1149] CALL, EXPR s->state [L1149] RET, EXPR s->state [L1149] COND FALSE !(s->state == 4368) [L1152] CALL, EXPR s->state [L1152] RET, EXPR s->state [L1152] COND FALSE !(s->state == 4369) [L1155] CALL, EXPR s->state [L1155] RET, EXPR s->state [L1155] COND TRUE s->state == 4384 [L1311] ret = __VERIFIER_nondet_int() [L1312] COND TRUE blastFlag == 1 [L1313] blastFlag = 2 VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1317] COND FALSE !(ret <= 0) [L1322] CALL s->hit [L1322] RET s->hit [L1322] COND FALSE !(s->hit) [L1325] CALL s->state = 4400 [L1325] RET s->state = 4400 [L1327] CALL s->init_num = 0 [L1327] RET s->init_num = 0 [L1605] CALL, EXPR s->s3 [L1605] RET, EXPR s->s3 [L1605] CALL, EXPR (s->s3)->tmp.reuse_message [L1605] RET, EXPR (s->s3)->tmp.reuse_message [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1133] CALL, EXPR s->state [L1133] RET, EXPR s->state [L1133] state = s->state [L1134] CALL, EXPR s->state [L1134] RET, EXPR s->state [L1134] COND FALSE !(s->state == 12292) [L1137] CALL, EXPR s->state [L1137] RET, EXPR s->state [L1137] COND FALSE !(s->state == 16384) [L1140] CALL, EXPR s->state [L1140] RET, EXPR s->state [L1140] COND FALSE !(s->state == 4096) [L1143] CALL, EXPR s->state [L1143] RET, EXPR s->state [L1143] COND FALSE !(s->state == 20480) [L1146] CALL, EXPR s->state [L1146] RET, EXPR s->state [L1146] COND FALSE !(s->state == 4099) [L1149] CALL, EXPR s->state [L1149] RET, EXPR s->state [L1149] COND FALSE !(s->state == 4368) [L1152] CALL, EXPR s->state [L1152] RET, EXPR s->state [L1152] COND FALSE !(s->state == 4369) [L1155] CALL, EXPR s->state [L1155] RET, EXPR s->state [L1155] COND FALSE !(s->state == 4384) [L1158] CALL, EXPR s->state [L1158] RET, EXPR s->state [L1158] COND FALSE !(s->state == 4385) [L1161] CALL, EXPR s->state [L1161] RET, EXPR s->state [L1161] COND TRUE s->state == 4400 [L1331] CALL, EXPR s->s3 [L1331] RET, EXPR s->s3 [L1331] CALL, EXPR (s->s3)->tmp.new_cipher [L1331] RET, EXPR (s->s3)->tmp.new_cipher [L1331] CALL, EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1331] RET, EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1331] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1334] ret = __VERIFIER_nondet_int() [L1335] COND TRUE blastFlag == 2 [L1336] blastFlag = 3 VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1340] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1346] CALL s->state = 4416 [L1346] RET s->state = 4416 [L1347] CALL s->init_num = 0 [L1347] RET s->init_num = 0 [L1605] CALL, EXPR s->s3 [L1605] RET, EXPR s->s3 [L1605] CALL, EXPR (s->s3)->tmp.reuse_message [L1605] RET, EXPR (s->s3)->tmp.reuse_message [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1133] CALL, EXPR s->state [L1133] RET, EXPR s->state [L1133] state = s->state [L1134] CALL, EXPR s->state [L1134] RET, EXPR s->state [L1134] COND FALSE !(s->state == 12292) [L1137] CALL, EXPR s->state [L1137] RET, EXPR s->state [L1137] COND FALSE !(s->state == 16384) [L1140] CALL, EXPR s->state [L1140] RET, EXPR s->state [L1140] COND FALSE !(s->state == 4096) [L1143] CALL, EXPR s->state [L1143] RET, EXPR s->state [L1143] COND FALSE !(s->state == 20480) [L1146] CALL, EXPR s->state [L1146] RET, EXPR s->state [L1146] COND FALSE !(s->state == 4099) [L1149] CALL, EXPR s->state [L1149] RET, EXPR s->state [L1149] COND FALSE !(s->state == 4368) [L1152] CALL, EXPR s->state [L1152] RET, EXPR s->state [L1152] COND FALSE !(s->state == 4369) [L1155] CALL, EXPR s->state [L1155] RET, EXPR s->state [L1155] COND FALSE !(s->state == 4384) [L1158] CALL, EXPR s->state [L1158] RET, EXPR s->state [L1158] COND FALSE !(s->state == 4385) [L1161] CALL, EXPR s->state [L1161] RET, EXPR s->state [L1161] COND FALSE !(s->state == 4400) [L1164] CALL, EXPR s->state [L1164] RET, EXPR s->state [L1164] COND FALSE !(s->state == 4401) [L1167] CALL, EXPR s->state [L1167] RET, EXPR s->state [L1167] COND TRUE s->state == 4416 [L1351] ret = __VERIFIER_nondet_int() [L1352] COND TRUE blastFlag == 3 [L1353] blastFlag = 4 VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1357] COND FALSE !(ret <= 0) [L1362] CALL s->state = 4432 [L1362] RET s->state = 4432 [L1363] CALL s->init_num = 0 [L1363] RET s->init_num = 0 [L1364] tmp___6 = __VERIFIER_nondet_int() [L1365] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1605] CALL, EXPR s->s3 [L1605] RET, EXPR s->s3 [L1605] CALL, EXPR (s->s3)->tmp.reuse_message [L1605] RET, EXPR (s->s3)->tmp.reuse_message [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1133] CALL, EXPR s->state [L1133] RET, EXPR s->state [L1133] state = s->state [L1134] CALL, EXPR s->state [L1134] RET, EXPR s->state [L1134] COND FALSE !(s->state == 12292) [L1137] CALL, EXPR s->state [L1137] RET, EXPR s->state [L1137] COND FALSE !(s->state == 16384) [L1140] CALL, EXPR s->state [L1140] RET, EXPR s->state [L1140] COND FALSE !(s->state == 4096) [L1143] CALL, EXPR s->state [L1143] RET, EXPR s->state [L1143] COND FALSE !(s->state == 20480) [L1146] CALL, EXPR s->state [L1146] RET, EXPR s->state [L1146] COND FALSE !(s->state == 4099) [L1149] CALL, EXPR s->state [L1149] RET, EXPR s->state [L1149] COND FALSE !(s->state == 4368) [L1152] CALL, EXPR s->state [L1152] RET, EXPR s->state [L1152] COND FALSE !(s->state == 4369) [L1155] CALL, EXPR s->state [L1155] RET, EXPR s->state [L1155] COND FALSE !(s->state == 4384) [L1158] CALL, EXPR s->state [L1158] RET, EXPR s->state [L1158] COND FALSE !(s->state == 4385) [L1161] CALL, EXPR s->state [L1161] RET, EXPR s->state [L1161] COND FALSE !(s->state == 4400) [L1164] CALL, EXPR s->state [L1164] RET, EXPR s->state [L1164] COND FALSE !(s->state == 4401) [L1167] CALL, EXPR s->state [L1167] RET, EXPR s->state [L1167] COND FALSE !(s->state == 4416) [L1170] CALL, EXPR s->state [L1170] RET, EXPR s->state [L1170] COND FALSE !(s->state == 4417) [L1173] CALL, EXPR s->state [L1173] RET, EXPR s->state [L1173] COND TRUE s->state == 4432 [L1374] ret = __VERIFIER_nondet_int() [L1375] COND FALSE !(blastFlag == 5) VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1380] COND FALSE !(ret <= 0) [L1385] CALL s->state = 4448 [L1385] RET s->state = 4448 [L1386] CALL s->init_num = 0 [L1386] RET s->init_num = 0 [L1605] CALL, EXPR s->s3 [L1605] RET, EXPR s->s3 [L1605] CALL, EXPR (s->s3)->tmp.reuse_message [L1605] RET, EXPR (s->s3)->tmp.reuse_message [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1133] CALL, EXPR s->state [L1133] RET, EXPR s->state [L1133] state = s->state [L1134] CALL, EXPR s->state [L1134] RET, EXPR s->state [L1134] COND FALSE !(s->state == 12292) [L1137] CALL, EXPR s->state [L1137] RET, EXPR s->state [L1137] COND FALSE !(s->state == 16384) [L1140] CALL, EXPR s->state [L1140] RET, EXPR s->state [L1140] COND FALSE !(s->state == 4096) [L1143] CALL, EXPR s->state [L1143] RET, EXPR s->state [L1143] COND FALSE !(s->state == 20480) [L1146] CALL, EXPR s->state [L1146] RET, EXPR s->state [L1146] COND FALSE !(s->state == 4099) [L1149] CALL, EXPR s->state [L1149] RET, EXPR s->state [L1149] COND FALSE !(s->state == 4368) [L1152] CALL, EXPR s->state [L1152] RET, EXPR s->state [L1152] COND FALSE !(s->state == 4369) [L1155] CALL, EXPR s->state [L1155] RET, EXPR s->state [L1155] COND FALSE !(s->state == 4384) [L1158] CALL, EXPR s->state [L1158] RET, EXPR s->state [L1158] COND FALSE !(s->state == 4385) [L1161] CALL, EXPR s->state [L1161] RET, EXPR s->state [L1161] COND FALSE !(s->state == 4400) [L1164] CALL, EXPR s->state [L1164] RET, EXPR s->state [L1164] COND FALSE !(s->state == 4401) [L1167] CALL, EXPR s->state [L1167] RET, EXPR s->state [L1167] COND FALSE !(s->state == 4416) [L1170] CALL, EXPR s->state [L1170] RET, EXPR s->state [L1170] COND FALSE !(s->state == 4417) [L1173] CALL, EXPR s->state [L1173] RET, EXPR s->state [L1173] COND FALSE !(s->state == 4432) [L1176] CALL, EXPR s->state [L1176] RET, EXPR s->state [L1176] COND FALSE !(s->state == 4433) [L1179] CALL, EXPR s->state [L1179] RET, EXPR s->state [L1179] COND TRUE s->state == 4448 [L1390] ret = __VERIFIER_nondet_int() [L1391] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1646] __VERIFIER_error() VAL [init=1, SSLv3_client_data={-1878917085:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 143 locations, 1 error locations. UNSAFE Result, 110.6s OverallTime, 19 OverallIterations, 7 TraceHistogramMax, 65.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3508 SDtfs, 8282 SDslu, 8565 SDs, 0 SdLazy, 8294 SolverSat, 1234 SolverUnsat, 17 SolverUnknown, 0 SolverNotchecked, 59.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3824 GetRequests, 3655 SyntacticMatches, 4 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1589occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 6633 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.3s SsaConstructionTime, 22.9s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 2374 NumberOfCodeBlocks, 2374 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 3710 ConstructedInterpolants, 1 QuantifiedInterpolants, 1457973 SizeOfPredicates, 255 NumberOfNonLiveVariables, 13510 ConjunctsInSsa, 283 ConjunctsInUnsatCore, 30 InterpolantComputations, 18 PerfectInterpolantSequences, 5276/5325 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...